./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 908ebf0ce710b19ef334a87c76f83c10f178a5493f5ed2ea191592b95f89ac2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:36:06,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:36:07,042 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:36:07,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:36:07,050 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:36:07,073 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:36:07,075 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:36:07,075 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:36:07,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:36:07,075 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:36:07,076 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:36:07,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:36:07,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:36:07,077 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:36:07,077 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:36:07,077 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:36:07,077 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:36:07,077 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:36:07,077 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:36:07,077 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:36:07,077 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:36:07,078 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:36:07,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:36:07,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:36:07,078 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:36:07,078 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:36:07,078 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:36:07,078 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:36:07,078 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:36:07,078 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:36:07,079 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:36:07,079 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:36:07,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:36:07,079 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:36:07,079 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:36:07,079 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:36:07,079 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:36:07,079 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:36:07,079 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:36:07,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:36:07,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:36:07,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:36:07,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:36:07,080 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 908ebf0ce710b19ef334a87c76f83c10f178a5493f5ed2ea191592b95f89ac2f [2025-03-03 20:36:07,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:36:07,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:36:07,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:36:07,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:36:07,300 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:36:07,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i [2025-03-03 20:36:08,381 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88109ceb/793c9cf42758415ea67749fd9ec5a78d/FLAG22e28ea6c [2025-03-03 20:36:08,642 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:36:08,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i [2025-03-03 20:36:08,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88109ceb/793c9cf42758415ea67749fd9ec5a78d/FLAG22e28ea6c [2025-03-03 20:36:08,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e88109ceb/793c9cf42758415ea67749fd9ec5a78d [2025-03-03 20:36:08,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:36:08,952 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:36:08,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:36:08,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:36:08,956 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:36:08,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:36:08" (1/1) ... [2025-03-03 20:36:08,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8e51e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:08, skipping insertion in model container [2025-03-03 20:36:08,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:36:08" (1/1) ... [2025-03-03 20:36:08,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:36:09,078 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i[919,932] [2025-03-03 20:36:09,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:36:09,167 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:36:09,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i[919,932] [2025-03-03 20:36:09,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:36:09,229 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:36:09,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09 WrapperNode [2025-03-03 20:36:09,230 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:36:09,231 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:36:09,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:36:09,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:36:09,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (1/1) ... [2025-03-03 20:36:09,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (1/1) ... [2025-03-03 20:36:09,286 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2025-03-03 20:36:09,287 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:36:09,288 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:36:09,288 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:36:09,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:36:09,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (1/1) ... [2025-03-03 20:36:09,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (1/1) ... [2025-03-03 20:36:09,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (1/1) ... [2025-03-03 20:36:09,314 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:36:09,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (1/1) ... [2025-03-03 20:36:09,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (1/1) ... [2025-03-03 20:36:09,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (1/1) ... [2025-03-03 20:36:09,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (1/1) ... [2025-03-03 20:36:09,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (1/1) ... [2025-03-03 20:36:09,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (1/1) ... [2025-03-03 20:36:09,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:36:09,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:36:09,348 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:36:09,348 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:36:09,349 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (1/1) ... [2025-03-03 20:36:09,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:36:09,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:36:09,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:36:09,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:36:09,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:36:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:36:09,393 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:36:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:36:09,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:36:09,393 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:36:09,454 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:36:09,455 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:36:09,809 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L174: havoc property_#t~ite22#1;havoc property_#t~ite21#1;havoc property_#t~bitwise20#1;havoc property_#t~short23#1;havoc property_#t~ite25#1;havoc property_#t~bitwise24#1;havoc property_#t~short26#1; [2025-03-03 20:36:09,829 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2025-03-03 20:36:09,829 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:36:09,850 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:36:09,850 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:36:09,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:36:09 BoogieIcfgContainer [2025-03-03 20:36:09,850 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:36:09,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:36:09,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:36:09,857 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:36:09,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:36:08" (1/3) ... [2025-03-03 20:36:09,858 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e71b024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:36:09, skipping insertion in model container [2025-03-03 20:36:09,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:09" (2/3) ... [2025-03-03 20:36:09,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e71b024 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:36:09, skipping insertion in model container [2025-03-03 20:36:09,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:36:09" (3/3) ... [2025-03-03 20:36:09,860 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i [2025-03-03 20:36:09,870 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:36:09,873 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i that has 2 procedures, 105 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:36:09,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:36:09,943 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c0abef4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:36:09,947 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:36:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 83 states have internal predecessors, (124), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 20:36:09,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 20:36:09,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:09,960 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:09,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:09,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1457157141, now seen corresponding path program 1 times [2025-03-03 20:36:09,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:09,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122038553] [2025-03-03 20:36:09,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:09,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:10,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 20:36:10,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 20:36:10,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:10,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 20:36:10,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:10,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122038553] [2025-03-03 20:36:10,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122038553] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:36:10,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1990045256] [2025-03-03 20:36:10,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:10,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:36:10,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:36:10,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:36:10,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 20:36:10,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 20:36:10,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 20:36:10,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:10,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:10,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:36:10,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:36:10,370 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2025-03-03 20:36:10,371 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:36:10,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1990045256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:10,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:36:10,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:36:10,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808190020] [2025-03-03 20:36:10,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:10,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:36:10,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:10,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:36:10,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:36:10,395 INFO L87 Difference]: Start difference. First operand has 105 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 83 states have internal predecessors, (124), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 20:36:10,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:10,434 INFO L93 Difference]: Finished difference Result 204 states and 343 transitions. [2025-03-03 20:36:10,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:36:10,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2025-03-03 20:36:10,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:10,445 INFO L225 Difference]: With dead ends: 204 [2025-03-03 20:36:10,445 INFO L226 Difference]: Without dead ends: 102 [2025-03-03 20:36:10,449 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:36:10,452 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:10,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:36:10,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-03 20:36:10,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-03 20:36:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 20:36:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 156 transitions. [2025-03-03 20:36:10,492 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 156 transitions. Word has length 140 [2025-03-03 20:36:10,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:10,492 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 156 transitions. [2025-03-03 20:36:10,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 20:36:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions. [2025-03-03 20:36:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 20:36:10,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:10,496 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:10,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 20:36:10,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 20:36:10,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:10,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:10,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1842334831, now seen corresponding path program 1 times [2025-03-03 20:36:10,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:10,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466959677] [2025-03-03 20:36:10,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:10,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:10,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 20:36:10,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 20:36:10,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:10,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:10,886 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 20:36:10,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:10,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466959677] [2025-03-03 20:36:10,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466959677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:10,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:10,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:36:10,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463000992] [2025-03-03 20:36:10,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:10,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:36:10,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:10,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:36:10,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:36:10,890 INFO L87 Difference]: Start difference. First operand 102 states and 156 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:10,988 INFO L93 Difference]: Finished difference Result 286 states and 439 transitions. [2025-03-03 20:36:10,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:36:10,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-03 20:36:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:10,990 INFO L225 Difference]: With dead ends: 286 [2025-03-03 20:36:10,990 INFO L226 Difference]: Without dead ends: 187 [2025-03-03 20:36:10,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:36:10,991 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 141 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:10,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 336 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:36:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-03 20:36:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 140. [2025-03-03 20:36:11,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.4661016949152543) internal successors, (173), 118 states have internal predecessors, (173), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 20:36:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 213 transitions. [2025-03-03 20:36:11,016 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 213 transitions. Word has length 140 [2025-03-03 20:36:11,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:11,017 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 213 transitions. [2025-03-03 20:36:11,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 213 transitions. [2025-03-03 20:36:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 20:36:11,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:11,018 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:11,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:36:11,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:11,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:11,019 INFO L85 PathProgramCache]: Analyzing trace with hash 2053685744, now seen corresponding path program 1 times [2025-03-03 20:36:11,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:11,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263401747] [2025-03-03 20:36:11,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:11,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:11,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 20:36:11,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 20:36:11,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:11,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:11,147 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 20:36:11,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:11,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263401747] [2025-03-03 20:36:11,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263401747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:11,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:11,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:36:11,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576953533] [2025-03-03 20:36:11,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:11,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:36:11,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:11,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:36:11,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:36:11,148 INFO L87 Difference]: Start difference. First operand 140 states and 213 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:11,207 INFO L93 Difference]: Finished difference Result 324 states and 490 transitions. [2025-03-03 20:36:11,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:36:11,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-03 20:36:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:11,211 INFO L225 Difference]: With dead ends: 324 [2025-03-03 20:36:11,212 INFO L226 Difference]: Without dead ends: 187 [2025-03-03 20:36:11,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:36:11,215 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 118 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:11,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 270 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:36:11,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-03 20:36:11,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 140. [2025-03-03 20:36:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 118 states have (on average 1.423728813559322) internal successors, (168), 118 states have internal predecessors, (168), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 20:36:11,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 208 transitions. [2025-03-03 20:36:11,230 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 208 transitions. Word has length 140 [2025-03-03 20:36:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:11,231 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 208 transitions. [2025-03-03 20:36:11,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 208 transitions. [2025-03-03 20:36:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 20:36:11,233 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:11,233 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:11,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:36:11,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:11,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:11,234 INFO L85 PathProgramCache]: Analyzing trace with hash -2112198833, now seen corresponding path program 1 times [2025-03-03 20:36:11,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:11,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355102271] [2025-03-03 20:36:11,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:11,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:11,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 20:36:11,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 20:36:11,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:11,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:11,548 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 20:36:11,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:11,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355102271] [2025-03-03 20:36:11,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355102271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:11,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:11,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:36:11,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814678082] [2025-03-03 20:36:11,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:11,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:36:11,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:11,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:36:11,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:36:11,551 INFO L87 Difference]: Start difference. First operand 140 states and 208 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:11,810 INFO L93 Difference]: Finished difference Result 403 states and 600 transitions. [2025-03-03 20:36:11,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:36:11,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2025-03-03 20:36:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:11,813 INFO L225 Difference]: With dead ends: 403 [2025-03-03 20:36:11,813 INFO L226 Difference]: Without dead ends: 266 [2025-03-03 20:36:11,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:36:11,814 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 171 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:11,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 594 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:36:11,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-03 20:36:11,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 224. [2025-03-03 20:36:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 181 states have (on average 1.3977900552486189) internal successors, (253), 181 states have internal predecessors, (253), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:36:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 333 transitions. [2025-03-03 20:36:11,841 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 333 transitions. Word has length 140 [2025-03-03 20:36:11,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:11,842 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 333 transitions. [2025-03-03 20:36:11,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:11,842 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 333 transitions. [2025-03-03 20:36:11,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 20:36:11,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:11,843 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:11,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:36:11,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:11,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:11,844 INFO L85 PathProgramCache]: Analyzing trace with hash -887112975, now seen corresponding path program 1 times [2025-03-03 20:36:11,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:11,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313343646] [2025-03-03 20:36:11,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:11,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:11,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 20:36:11,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 20:36:11,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:11,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 20:36:12,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:12,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313343646] [2025-03-03 20:36:12,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313343646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:12,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:12,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:36:12,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776532101] [2025-03-03 20:36:12,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:12,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:36:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:12,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:36:12,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:36:12,503 INFO L87 Difference]: Start difference. First operand 224 states and 333 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 20:36:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:13,121 INFO L93 Difference]: Finished difference Result 578 states and 853 transitions. [2025-03-03 20:36:13,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:36:13,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2025-03-03 20:36:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:13,125 INFO L225 Difference]: With dead ends: 578 [2025-03-03 20:36:13,125 INFO L226 Difference]: Without dead ends: 357 [2025-03-03 20:36:13,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:36:13,127 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 294 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:13,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 685 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 20:36:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-03 20:36:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 340. [2025-03-03 20:36:13,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 271 states have (on average 1.3837638376383763) internal successors, (375), 272 states have internal predecessors, (375), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 20:36:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 503 transitions. [2025-03-03 20:36:13,168 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 503 transitions. Word has length 141 [2025-03-03 20:36:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:13,169 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 503 transitions. [2025-03-03 20:36:13,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 20:36:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 503 transitions. [2025-03-03 20:36:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 20:36:13,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:13,170 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:13,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:36:13,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:13,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1631700114, now seen corresponding path program 1 times [2025-03-03 20:36:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:13,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676240553] [2025-03-03 20:36:13,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:13,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 20:36:13,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 20:36:13,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:13,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:13,398 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 20:36:13,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:13,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676240553] [2025-03-03 20:36:13,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676240553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:13,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:13,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:36:13,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114671401] [2025-03-03 20:36:13,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:13,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:36:13,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:13,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:36:13,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:36:13,400 INFO L87 Difference]: Start difference. First operand 340 states and 503 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:13,520 INFO L93 Difference]: Finished difference Result 524 states and 765 transitions. [2025-03-03 20:36:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:36:13,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-03-03 20:36:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:13,523 INFO L225 Difference]: With dead ends: 524 [2025-03-03 20:36:13,523 INFO L226 Difference]: Without dead ends: 387 [2025-03-03 20:36:13,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:36:13,524 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 224 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:13,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 317 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:36:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-03 20:36:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 352. [2025-03-03 20:36:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 280 states have (on average 1.3678571428571429) internal successors, (383), 281 states have internal predecessors, (383), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-03 20:36:13,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 511 transitions. [2025-03-03 20:36:13,556 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 511 transitions. Word has length 142 [2025-03-03 20:36:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:13,556 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 511 transitions. [2025-03-03 20:36:13,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 511 transitions. [2025-03-03 20:36:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-03 20:36:13,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:13,558 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:13,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:36:13,558 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:13,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:13,558 INFO L85 PathProgramCache]: Analyzing trace with hash 861552087, now seen corresponding path program 1 times [2025-03-03 20:36:13,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:13,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443799910] [2025-03-03 20:36:13,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:13,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:13,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-03 20:36:13,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-03 20:36:13,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:13,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:13,917 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 20:36:13,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:13,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443799910] [2025-03-03 20:36:13,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443799910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:13,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:13,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:36:13,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110733399] [2025-03-03 20:36:13,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:13,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:36:13,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:13,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:36:13,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:36:13,919 INFO L87 Difference]: Start difference. First operand 352 states and 511 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:14,013 INFO L93 Difference]: Finished difference Result 729 states and 1058 transitions. [2025-03-03 20:36:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:36:14,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2025-03-03 20:36:14,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:14,016 INFO L225 Difference]: With dead ends: 729 [2025-03-03 20:36:14,016 INFO L226 Difference]: Without dead ends: 388 [2025-03-03 20:36:14,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:36:14,017 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 123 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:14,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 673 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:36:14,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-03 20:36:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 371. [2025-03-03 20:36:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 288 states have (on average 1.3402777777777777) internal successors, (386), 289 states have internal predecessors, (386), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 20:36:14,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 534 transitions. [2025-03-03 20:36:14,065 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 534 transitions. Word has length 142 [2025-03-03 20:36:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:14,066 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 534 transitions. [2025-03-03 20:36:14,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 534 transitions. [2025-03-03 20:36:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 20:36:14,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:14,067 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:14,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:36:14,068 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:14,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash -133297187, now seen corresponding path program 1 times [2025-03-03 20:36:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:14,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941430284] [2025-03-03 20:36:14,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:14,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 20:36:14,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 20:36:14,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:14,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 20:36:14,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:14,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941430284] [2025-03-03 20:36:14,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941430284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:14,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:14,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:36:14,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394651580] [2025-03-03 20:36:14,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:14,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:36:14,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:14,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:36:14,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:36:14,237 INFO L87 Difference]: Start difference. First operand 371 states and 534 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:14,538 INFO L93 Difference]: Finished difference Result 583 states and 835 transitions. [2025-03-03 20:36:14,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:36:14,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2025-03-03 20:36:14,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:14,541 INFO L225 Difference]: With dead ends: 583 [2025-03-03 20:36:14,541 INFO L226 Difference]: Without dead ends: 442 [2025-03-03 20:36:14,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:36:14,542 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 250 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:14,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 730 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 20:36:14,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-03 20:36:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 371. [2025-03-03 20:36:14,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 288 states have (on average 1.3368055555555556) internal successors, (385), 289 states have internal predecessors, (385), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2025-03-03 20:36:14,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 533 transitions. [2025-03-03 20:36:14,594 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 533 transitions. Word has length 145 [2025-03-03 20:36:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:14,595 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 533 transitions. [2025-03-03 20:36:14,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 533 transitions. [2025-03-03 20:36:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 20:36:14,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:14,596 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:14,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:36:14,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:14,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1156313298, now seen corresponding path program 1 times [2025-03-03 20:36:14,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:14,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775648624] [2025-03-03 20:36:14,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:14,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:14,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 20:36:14,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 20:36:14,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:14,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:19,897 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 20:36:19,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:36:19,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775648624] [2025-03-03 20:36:19,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775648624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:19,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:19,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-03 20:36:19,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878372303] [2025-03-03 20:36:19,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:19,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 20:36:19,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:36:19,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 20:36:19,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-03 20:36:19,899 INFO L87 Difference]: Start difference. First operand 371 states and 533 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:21,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:21,930 INFO L93 Difference]: Finished difference Result 965 states and 1368 transitions. [2025-03-03 20:36:21,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:36:21,931 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2025-03-03 20:36:21,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:21,934 INFO L225 Difference]: With dead ends: 965 [2025-03-03 20:36:21,934 INFO L226 Difference]: Without dead ends: 736 [2025-03-03 20:36:21,935 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:36:21,935 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 209 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:21,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 851 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 20:36:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-03 20:36:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 674. [2025-03-03 20:36:21,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 582 states have (on average 1.388316151202749) internal successors, (808), 586 states have internal predecessors, (808), 80 states have call successors, (80), 11 states have call predecessors, (80), 11 states have return successors, (80), 76 states have call predecessors, (80), 80 states have call successors, (80) [2025-03-03 20:36:21,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 968 transitions. [2025-03-03 20:36:21,995 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 968 transitions. Word has length 146 [2025-03-03 20:36:21,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:21,995 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 968 transitions. [2025-03-03 20:36:21,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:21,996 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 968 transitions. [2025-03-03 20:36:21,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 20:36:21,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:21,998 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:21,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:36:21,998 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:21,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:21,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1849414995, now seen corresponding path program 1 times [2025-03-03 20:36:21,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:36:21,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113801828] [2025-03-03 20:36:21,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:21,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:36:22,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 20:36:22,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 20:36:22,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:22,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 20:36:22,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717285174] [2025-03-03 20:36:22,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:22,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:36:22,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:36:22,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 20:36:22,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 20:36:22,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 20:36:22,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 20:36:22,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:22,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:36:22,192 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 20:36:22,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 20:36:22,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 20:36:22,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:22,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 20:36:22,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 20:36:22,314 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 20:36:22,315 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 20:36:22,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 20:36:22,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 20:36:22,524 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:22,608 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 20:36:22,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 08:36:22 BoogieIcfgContainer [2025-03-03 20:36:22,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 20:36:22,613 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 20:36:22,613 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 20:36:22,613 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 20:36:22,613 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:36:09" (3/4) ... [2025-03-03 20:36:22,615 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 20:36:22,615 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 20:36:22,616 INFO L158 Benchmark]: Toolchain (without parser) took 13664.22ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 109.9MB in the beginning and 350.5MB in the end (delta: -240.6MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2025-03-03 20:36:22,617 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:36:22,617 INFO L158 Benchmark]: CACSL2BoogieTranslator took 278.14ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 93.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 20:36:22,617 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.06ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 88.5MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:36:22,618 INFO L158 Benchmark]: Boogie Preprocessor took 58.93ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 81.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:36:22,619 INFO L158 Benchmark]: IcfgBuilder took 503.03ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 44.3MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-03 20:36:22,619 INFO L158 Benchmark]: TraceAbstraction took 12759.80ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 43.2MB in the beginning and 350.6MB in the end (delta: -307.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 20:36:22,619 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 419.4MB. Free memory was 350.6MB in the beginning and 350.5MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 20:36:22,620 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 278.14ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 93.5MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.06ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 88.5MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.93ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 81.2MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 503.03ms. Allocated memory is still 142.6MB. Free memory was 80.1MB in the beginning and 44.3MB in the end (delta: 35.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12759.80ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 43.2MB in the beginning and 350.6MB in the end (delta: -307.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 419.4MB. Free memory was 350.6MB in the beginning and 350.5MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 52, overapproximation of someBinaryFLOATComparisonOperation at line 138, overapproximation of someBinaryFLOATComparisonOperation at line 140, overapproximation of someBinaryFLOATComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 166, overapproximation of someBinaryDOUBLEComparisonOperation at line 168, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned short int var_1_29 = 8; [L41] unsigned short int var_1_33 = 48416; [L42] unsigned char var_1_35 = 4; [L43] unsigned long int var_1_37 = 32; [L44] unsigned char var_1_38 = 8; [L45] double var_1_40 = 31.75; [L46] double var_1_41 = 5.5; [L47] signed char var_1_43 = 100; [L48] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5] [L178] isInitial = 1 [L179] FCALL initially() [L180] COND TRUE 1 [L181] CALL updateLastVariables() [L171] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5] [L181] RET updateLastVariables() [L182] CALL updateVariables() [L137] var_1_9 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L139] var_1_10 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L140] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L141] var_1_11 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L144] var_1_12 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L147] var_1_13 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L150] var_1_14 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L153] var_1_18 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L156] var_1_19 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L157] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L159] var_1_23 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L160] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L162] var_1_33 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L163] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L165] var_1_40 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L166] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L167] var_1_41 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L182] RET updateVariables() [L183] CALL step() [L52] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L55] var_1_20 = var_1_8 [L56] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L57] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L60] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L61] COND FALSE !(\read(var_1_22)) [L68] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L70] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L71] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L72] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L73] COND FALSE !(\read(var_1_22)) [L80] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L85] signed long int stepLocal_4 = 256; [L86] unsigned char stepLocal_3 = var_1_22; [L87] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L88] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L91] COND FALSE !(stepLocal_3 || var_1_22) [L96] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=-10000, var_1_8=0] [L99] COND FALSE !(\read(var_1_23)) [L104] var_1_24 = ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=-10000, var_1_8=0] [L106] COND TRUE (var_1_20 / var_1_12) < var_1_11 [L107] var_1_29 = var_1_12 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=-10000, var_1_8=0] [L111] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=-10000, var_1_8=0] [L114] COND TRUE ((((var_1_8) < (var_1_12)) ? (var_1_8) : (var_1_12))) >= var_1_20 [L115] var_1_37 = var_1_8 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=8, var_1_43=100, var_1_5=-10000, var_1_8=0] [L117] COND FALSE !((var_1_9 * (var_1_40 - var_1_41)) >= var_1_9) [L124] var_1_38 = var_1_14 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=-389, var_1_43=100, var_1_5=-10000, var_1_8=0] [L126] COND FALSE !(((((var_1_10) > (64.75f)) ? (var_1_10) : (64.75f))) <= var_1_40) [L133] var_1_43 = var_1_13 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=-389, var_1_43=0, var_1_5=-10000, var_1_8=0] [L183] RET step() [L184] CALL, EXPR property() [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=-389, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=-389, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=-389, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=-389, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=-389, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=-389, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174-L175] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L184] RET, EXPR property() [L184] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=-389, var_1_43=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=1, var_1_12=127, var_1_13=0, var_1_14=-389, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=1, var_1_29=127, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=-389, var_1_43=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.6s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1530 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1530 mSDsluCounter, 4606 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2857 mSDsCounter, 207 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1678 IncrementalHoareTripleChecker+Invalid, 1885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 207 mSolverCounterUnsat, 1749 mSDtfsCounter, 1678 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=674occurred in iteration=9, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 338 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1708 NumberOfCodeBlocks, 1708 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1406 ConstructedInterpolants, 0 QuantifiedInterpolants, 14173 SizeOfPredicates, 0 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 7562/7600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 20:36:22,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 908ebf0ce710b19ef334a87c76f83c10f178a5493f5ed2ea191592b95f89ac2f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:36:24,604 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:36:24,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 20:36:24,719 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:36:24,720 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:36:24,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:36:24,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:36:24,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:36:24,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:36:24,741 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:36:24,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:36:24,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:36:24,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:36:24,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:36:24,742 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:36:24,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:36:24,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:36:24,743 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:36:24,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:36:24,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:36:24,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:36:24,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:36:24,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:36:24,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 20:36:24,743 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 20:36:24,743 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 20:36:24,743 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:36:24,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:36:24,743 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:36:24,744 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:36:24,744 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:36:24,744 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:36:24,744 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:36:24,744 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:36:24,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:36:24,745 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:36:24,745 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:36:24,745 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:36:24,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:36:24,745 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 20:36:24,745 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 20:36:24,745 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:36:24,745 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:36:24,745 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:36:24,745 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:36:24,746 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 908ebf0ce710b19ef334a87c76f83c10f178a5493f5ed2ea191592b95f89ac2f [2025-03-03 20:36:24,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:36:24,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:36:24,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:36:24,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:36:24,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:36:24,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i [2025-03-03 20:36:26,150 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ae2873b/1ff71f72d4cc4cc5bf4ea09b5a2c723f/FLAG6c98ee1a8 [2025-03-03 20:36:26,364 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:36:26,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i [2025-03-03 20:36:26,377 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ae2873b/1ff71f72d4cc4cc5bf4ea09b5a2c723f/FLAG6c98ee1a8 [2025-03-03 20:36:26,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ae2873b/1ff71f72d4cc4cc5bf4ea09b5a2c723f [2025-03-03 20:36:26,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:36:26,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:36:26,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:36:26,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:36:26,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:36:26,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,406 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f8b52d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26, skipping insertion in model container [2025-03-03 20:36:26,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:36:26,536 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i[919,932] [2025-03-03 20:36:26,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:36:26,628 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:36:26,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i[919,932] [2025-03-03 20:36:26,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:36:26,702 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:36:26,703 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26 WrapperNode [2025-03-03 20:36:26,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:36:26,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:36:26,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:36:26,704 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:36:26,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,724 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,748 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2025-03-03 20:36:26,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:36:26,753 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:36:26,756 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:36:26,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:36:26,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,783 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 20:36:26,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,797 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:36:26,811 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:36:26,811 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:36:26,811 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:36:26,812 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (1/1) ... [2025-03-03 20:36:26,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:36:26,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:36:26,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 20:36:26,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 20:36:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:36:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 20:36:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:36:26,864 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:36:26,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:36:26,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:36:26,928 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:36:26,930 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:36:35,659 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 20:36:35,659 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:36:35,670 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:36:35,670 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 20:36:35,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:36:35 BoogieIcfgContainer [2025-03-03 20:36:35,671 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:36:35,672 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:36:35,673 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:36:35,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:36:35,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:36:26" (1/3) ... [2025-03-03 20:36:35,678 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739eeb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:36:35, skipping insertion in model container [2025-03-03 20:36:35,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:36:26" (2/3) ... [2025-03-03 20:36:35,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@739eeb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:36:35, skipping insertion in model container [2025-03-03 20:36:35,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:36:35" (3/3) ... [2025-03-03 20:36:35,681 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i [2025-03-03 20:36:35,692 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:36:35,694 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-97.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:36:35,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:36:35,737 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7bf2ee5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:36:35,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:36:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 20:36:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 20:36:35,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:35,751 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:35,752 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:35,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:35,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1094669076, now seen corresponding path program 1 times [2025-03-03 20:36:35,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:36:35,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226960947] [2025-03-03 20:36:35,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:35,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:36:35,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:36:35,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:36:35,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-03 20:36:35,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 20:36:36,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 20:36:36,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:36,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:36,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:36:36,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:36:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-03-03 20:36:36,163 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:36:36,163 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:36:36,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226960947] [2025-03-03 20:36:36,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226960947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:36,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:36,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 20:36:36,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375675026] [2025-03-03 20:36:36,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:36,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:36:36,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:36:36,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:36:36,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:36:36,187 INFO L87 Difference]: Start difference. First operand has 74 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 52 states have internal predecessors, (75), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 20:36:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:36,210 INFO L93 Difference]: Finished difference Result 141 states and 243 transitions. [2025-03-03 20:36:36,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:36:36,212 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2025-03-03 20:36:36,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:36,217 INFO L225 Difference]: With dead ends: 141 [2025-03-03 20:36:36,217 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 20:36:36,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:36:36,221 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:36,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:36:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 20:36:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-03 20:36:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 20:36:36,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2025-03-03 20:36:36,255 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 136 [2025-03-03 20:36:36,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:36,255 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2025-03-03 20:36:36,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 20:36:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2025-03-03 20:36:36,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 20:36:36,257 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:36,258 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:36,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-03 20:36:36,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:36:36,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:36,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:36,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1527149976, now seen corresponding path program 1 times [2025-03-03 20:36:36,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:36:36,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063269185] [2025-03-03 20:36:36,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:36,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:36:36,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:36:36,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:36:36,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-03 20:36:36,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 20:36:36,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 20:36:36,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:36,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:36,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 20:36:36,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:36:37,322 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2025-03-03 20:36:37,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 20:36:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-03-03 20:36:38,154 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:36:38,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063269185] [2025-03-03 20:36:38,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063269185] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 20:36:38,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 20:36:38,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2025-03-03 20:36:38,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10439230] [2025-03-03 20:36:38,155 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 20:36:38,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 20:36:38,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:36:38,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 20:36:38,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 20:36:38,157 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 20:36:39,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:39,164 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2025-03-03 20:36:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 20:36:39,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 136 [2025-03-03 20:36:39,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:39,169 INFO L225 Difference]: With dead ends: 142 [2025-03-03 20:36:39,169 INFO L226 Difference]: Without dead ends: 75 [2025-03-03 20:36:39,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-03 20:36:39,170 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 190 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:39,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 148 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:36:39,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-03 20:36:39,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2025-03-03 20:36:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 20:36:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2025-03-03 20:36:39,179 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 98 transitions. Word has length 136 [2025-03-03 20:36:39,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:39,180 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 98 transitions. [2025-03-03 20:36:39,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-03 20:36:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 98 transitions. [2025-03-03 20:36:39,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 20:36:39,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:39,181 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:39,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-03-03 20:36:39,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:36:39,382 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:39,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:39,383 INFO L85 PathProgramCache]: Analyzing trace with hash 328302712, now seen corresponding path program 1 times [2025-03-03 20:36:39,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:36:39,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050415505] [2025-03-03 20:36:39,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:39,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:36:39,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:36:39,385 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:36:39,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-03 20:36:39,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 20:36:39,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 20:36:39,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:39,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:39,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 20:36:39,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:36:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 20:36:40,447 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:36:40,447 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:36:40,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050415505] [2025-03-03 20:36:40,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050415505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:40,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:40,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:36:40,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069860147] [2025-03-03 20:36:40,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:40,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:36:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:36:40,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:36:40,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:36:40,449 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:41,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:41,171 INFO L93 Difference]: Finished difference Result 183 states and 256 transitions. [2025-03-03 20:36:41,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:36:41,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2025-03-03 20:36:41,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:41,173 INFO L225 Difference]: With dead ends: 183 [2025-03-03 20:36:41,173 INFO L226 Difference]: Without dead ends: 115 [2025-03-03 20:36:41,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 20:36:41,174 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 88 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:41,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 303 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 20:36:41,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-03 20:36:41,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 71. [2025-03-03 20:36:41,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-03 20:36:41,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2025-03-03 20:36:41,190 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 136 [2025-03-03 20:36:41,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:41,191 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2025-03-03 20:36:41,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:41,191 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2025-03-03 20:36:41,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-03 20:36:41,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:41,193 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:41,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-03 20:36:41,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:36:41,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:41,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:41,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1911401064, now seen corresponding path program 1 times [2025-03-03 20:36:41,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:36:41,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [215163541] [2025-03-03 20:36:41,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:41,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:36:41,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:36:41,397 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:36:41,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-03 20:36:41,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-03 20:36:41,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-03 20:36:41,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:41,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:41,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 20:36:41,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:36:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-03-03 20:36:44,054 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:36:44,054 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 20:36:44,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [215163541] [2025-03-03 20:36:44,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [215163541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:36:44,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:36:44,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:36:44,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594370246] [2025-03-03 20:36:44,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:36:44,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:36:44,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 20:36:44,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:36:44,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:36:44,055 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:44,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:36:44,470 INFO L93 Difference]: Finished difference Result 222 states and 304 transitions. [2025-03-03 20:36:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:36:44,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2025-03-03 20:36:44,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:36:44,473 INFO L225 Difference]: With dead ends: 222 [2025-03-03 20:36:44,473 INFO L226 Difference]: Without dead ends: 154 [2025-03-03 20:36:44,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:36:44,474 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 74 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:36:44,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 327 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:36:44,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-03 20:36:44,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 137. [2025-03-03 20:36:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 20:36:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 189 transitions. [2025-03-03 20:36:44,502 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 189 transitions. Word has length 137 [2025-03-03 20:36:44,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:36:44,502 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 189 transitions. [2025-03-03 20:36:44,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2025-03-03 20:36:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 189 transitions. [2025-03-03 20:36:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 20:36:44,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:36:44,504 INFO L218 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 20:36:44,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-03 20:36:44,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:36:44,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:36:44,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:36:44,705 INFO L85 PathProgramCache]: Analyzing trace with hash -391359430, now seen corresponding path program 1 times [2025-03-03 20:36:44,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 20:36:44,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [104929571] [2025-03-03 20:36:44,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:36:44,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-03 20:36:44,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 20:36:44,707 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-03 20:36:44,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-03 20:36:44,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 20:36:45,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 20:36:45,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:36:45,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:36:45,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 20:36:45,553 INFO L279 TraceCheckSpWp]: Computing forward predicates...