./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-13.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 03c1f1efb08e7a9fddcc253b69596fe6be6bf22aca88662794b2f75978c70d66 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:25:08,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:25:08,147 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:25:08,151 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:25:08,151 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:25:08,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:25:08,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:25:08,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:25:08,173 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:25:08,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:25:08,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:25:08,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:25:08,175 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:25:08,175 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:25:08,176 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:25:08,176 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:25:08,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:25:08,177 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:25:08,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:25:08,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:25:08,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:25:08,179 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:25:08,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:25:08,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:25:08,179 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:25:08,180 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:25:08,180 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:25:08,180 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:25:08,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:25:08,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:25:08,181 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:25:08,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:25:08,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:25:08,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:25:08,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:25:08,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:25:08,183 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:25:08,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:25:08,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:25:08,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:25:08,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:25:08,185 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:25:08,185 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 03c1f1efb08e7a9fddcc253b69596fe6be6bf22aca88662794b2f75978c70d66 [2024-10-11 09:25:08,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:25:08,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:25:08,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:25:08,456 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:25:08,457 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:25:08,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-13.i [2024-10-11 09:25:09,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:25:10,072 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:25:10,073 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-13.i [2024-10-11 09:25:10,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f02faca4/95d1e300c47e439cb3653e88f23425c9/FLAGafe07d464 [2024-10-11 09:25:10,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0f02faca4/95d1e300c47e439cb3653e88f23425c9 [2024-10-11 09:25:10,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:25:10,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:25:10,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:25:10,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:25:10,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:25:10,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@463a88e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10, skipping insertion in model container [2024-10-11 09:25:10,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:25:10,319 WARN L248 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-pr-ci_file-13.i[919,932] [2024-10-11 09:25:10,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:25:10,442 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:25:10,454 WARN L248 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-pr-ci_file-13.i[919,932] [2024-10-11 09:25:10,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:25:10,529 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:25:10,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10 WrapperNode [2024-10-11 09:25:10,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:25:10,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:25:10,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:25:10,532 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:25:10,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,613 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-10-11 09:25:10,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:25:10,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:25:10,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:25:10,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:25:10,626 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,664 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]. [2024-10-11 09:25:10,665 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:25:10,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:25:10,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:25:10,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:25:10,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (1/1) ... [2024-10-11 09:25:10,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:25:10,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:25:10,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:25:10,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:25:10,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:25:10,866 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:25:10,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:25:10,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:25:10,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:25:10,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:25:10,941 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:25:10,943 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:25:11,362 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 09:25:11,363 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:25:11,426 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:25:11,426 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:25:11,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:25:11 BoogieIcfgContainer [2024-10-11 09:25:11,427 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:25:11,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:25:11,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:25:11,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:25:11,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:25:10" (1/3) ... [2024-10-11 09:25:11,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaa4598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:25:11, skipping insertion in model container [2024-10-11 09:25:11,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:10" (2/3) ... [2024-10-11 09:25:11,437 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eaa4598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:25:11, skipping insertion in model container [2024-10-11 09:25:11,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:25:11" (3/3) ... [2024-10-11 09:25:11,442 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-13.i [2024-10-11 09:25:11,459 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:25:11,459 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:25:11,542 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:25:11,551 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;@64a2840a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:25:11,551 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:25:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 54 states have (on average 1.537037037037037) internal successors, (83), 55 states have internal predecessors, (83), 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) [2024-10-11 09:25:11,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:25:11,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:25:11,575 INFO L215 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] [2024-10-11 09:25:11,576 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:25:11,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:25:11,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1294873970, now seen corresponding path program 1 times [2024-10-11 09:25:11,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:25:11,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321209831] [2024-10-11 09:25:11,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:11,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:25:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:11,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:25:11,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:11,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:25:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:11,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:25:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:11,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:25:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:11,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:25:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:11,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:25:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:25:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:25:12,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:25:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:25:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:25:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:25:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:25:12,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:25:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:25:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:25:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:25:12,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:25:12,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:25:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:25:12,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,062 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:25:12,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:25:12,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321209831] [2024-10-11 09:25:12,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321209831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:25:12,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:25:12,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:25:12,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314671035] [2024-10-11 09:25:12,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:25:12,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:25:12,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:25:12,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:25:12,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:25:12,121 INFO L87 Difference]: Start difference. First operand has 77 states, 54 states have (on average 1.537037037037037) internal successors, (83), 55 states have internal predecessors, (83), 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 19.5) internal successors, (39), 2 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) [2024-10-11 09:25:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:25:12,180 INFO L93 Difference]: Finished difference Result 148 states and 259 transitions. [2024-10-11 09:25:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:25:12,184 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 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 [2024-10-11 09:25:12,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:25:12,195 INFO L225 Difference]: With dead ends: 148 [2024-10-11 09:25:12,195 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 09:25:12,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:25:12,206 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:25:12,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:25:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 09:25:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 09:25:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 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) [2024-10-11 09:25:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2024-10-11 09:25:12,256 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 136 [2024-10-11 09:25:12,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:25:12,259 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2024-10-11 09:25:12,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 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) [2024-10-11 09:25:12,260 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2024-10-11 09:25:12,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 09:25:12,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:25:12,263 INFO L215 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] [2024-10-11 09:25:12,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:25:12,263 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:25:12,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:25:12,264 INFO L85 PathProgramCache]: Analyzing trace with hash 68434210, now seen corresponding path program 1 times [2024-10-11 09:25:12,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:25:12,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489780557] [2024-10-11 09:25:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:12,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:25:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:25:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:25:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:25:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:25:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:25:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:25:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:25:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:25:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:25:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:25:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:25:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:25:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:25:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:25:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:25:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:25:12,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:25:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:25:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:25:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:25:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:25:12,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:25:12,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489780557] [2024-10-11 09:25:12,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489780557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:25:12,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:25:12,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:25:12,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62029647] [2024-10-11 09:25:12,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:25:12,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:25:12,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:25:12,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:25:12,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:25:12,594 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2024-10-11 09:25:12,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:25:12,657 INFO L93 Difference]: Finished difference Result 183 states and 269 transitions. [2024-10-11 09:25:12,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:25:12,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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 138 [2024-10-11 09:25:12,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:25:12,663 INFO L225 Difference]: With dead ends: 183 [2024-10-11 09:25:12,663 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 09:25:12,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:25:12,668 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 45 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:25:12,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 237 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:25:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 09:25:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2024-10-11 09:25:12,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 80 states have (on average 1.35) internal successors, (108), 81 states have internal predecessors, (108), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:25:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-10-11 09:25:12,695 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 138 [2024-10-11 09:25:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:25:12,696 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-10-11 09:25:12,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 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) [2024-10-11 09:25:12,698 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-10-11 09:25:12,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-11 09:25:12,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:25:12,705 INFO L215 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] [2024-10-11 09:25:12,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:25:12,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:25:12,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:25:12,707 INFO L85 PathProgramCache]: Analyzing trace with hash -749214240, now seen corresponding path program 1 times [2024-10-11 09:25:12,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:25:12,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577603683] [2024-10-11 09:25:12,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:12,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:25:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:25:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:25:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:25:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:25:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:25:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:25:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:25:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:25:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:25:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:25:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:25:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:25:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:25:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:25:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:25:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:25:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:25:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:25:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:25:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:25:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:13,532 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:25:13,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:25:13,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577603683] [2024-10-11 09:25:13,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577603683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:25:13,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:25:13,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 09:25:13,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073962885] [2024-10-11 09:25:13,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:25:13,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 09:25:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:25:13,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 09:25:13,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:25:13,538 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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) [2024-10-11 09:25:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:25:13,969 INFO L93 Difference]: Finished difference Result 315 states and 464 transitions. [2024-10-11 09:25:13,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 09:25:13,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 138 [2024-10-11 09:25:13,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:25:13,974 INFO L225 Difference]: With dead ends: 315 [2024-10-11 09:25:13,974 INFO L226 Difference]: Without dead ends: 207 [2024-10-11 09:25:13,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:25:13,976 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 96 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:25:13,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 385 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:25:13,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-11 09:25:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 148. [2024-10-11 09:25:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 99 states have internal predecessors, (127), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 09:25:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 219 transitions. [2024-10-11 09:25:14,008 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 219 transitions. Word has length 138 [2024-10-11 09:25:14,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:25:14,009 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 219 transitions. [2024-10-11 09:25:14,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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) [2024-10-11 09:25:14,009 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 219 transitions. [2024-10-11 09:25:14,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 09:25:14,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:25:14,011 INFO L215 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] [2024-10-11 09:25:14,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:25:14,012 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:25:14,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:25:14,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1445818159, now seen corresponding path program 1 times [2024-10-11 09:25:14,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:25:14,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973667392] [2024-10-11 09:25:14,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:14,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:25:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:25:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:25:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:25:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:25:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:25:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:25:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:25:14,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:25:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:25:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:25:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:25:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:25:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:25:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:25:14,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:25:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:25:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:25:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:25:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:25:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:25:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:25:14,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:25:14,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973667392] [2024-10-11 09:25:14,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973667392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:25:14,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:25:14,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 09:25:14,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209836476] [2024-10-11 09:25:14,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:25:14,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:25:14,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:25:14,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:25:14,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:25:14,279 INFO L87 Difference]: Start difference. First operand 148 states and 219 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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) [2024-10-11 09:25:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:25:14,522 INFO L93 Difference]: Finished difference Result 312 states and 458 transitions. [2024-10-11 09:25:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:25:14,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 139 [2024-10-11 09:25:14,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:25:14,527 INFO L225 Difference]: With dead ends: 312 [2024-10-11 09:25:14,529 INFO L226 Difference]: Without dead ends: 204 [2024-10-11 09:25:14,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 09:25:14,531 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 109 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:25:14,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 169 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:25:14,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-11 09:25:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 156. [2024-10-11 09:25:14,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 107 states have internal predecessors, (137), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 09:25:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 229 transitions. [2024-10-11 09:25:14,577 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 229 transitions. Word has length 139 [2024-10-11 09:25:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:25:14,579 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 229 transitions. [2024-10-11 09:25:14,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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) [2024-10-11 09:25:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 229 transitions. [2024-10-11 09:25:14,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-11 09:25:14,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:25:14,581 INFO L215 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] [2024-10-11 09:25:14,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:25:14,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:25:14,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:25:14,585 INFO L85 PathProgramCache]: Analyzing trace with hash 855004431, now seen corresponding path program 1 times [2024-10-11 09:25:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:25:14,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143700876] [2024-10-11 09:25:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:14,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:25:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:25:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 09:25:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 09:25:15,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 09:25:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 09:25:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 09:25:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 09:25:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 09:25:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 09:25:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 09:25:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 09:25:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 09:25:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 09:25:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 09:25:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:25:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 09:25:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:25:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 09:25:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 09:25:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 09:25:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-11 09:25:15,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:25:15,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143700876] [2024-10-11 09:25:15,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143700876] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:25:15,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550891847] [2024-10-11 09:25:15,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:15,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:25:15,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:25:15,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:25:15,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 09:25:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:15,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 09:25:15,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:25:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 382 proven. 81 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-10-11 09:25:16,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:25:17,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550891847] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:25:17,076 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:25:17,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-11 09:25:17,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892497247] [2024-10-11 09:25:17,080 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:25:17,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 09:25:17,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:25:17,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 09:25:17,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=186, Unknown=1, NotChecked=0, Total=240 [2024-10-11 09:25:17,082 INFO L87 Difference]: Start difference. First operand 156 states and 229 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 5 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 4 states have call predecessors, (40), 5 states have call successors, (40) [2024-10-11 09:25:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:25:18,158 INFO L93 Difference]: Finished difference Result 485 states and 687 transitions. [2024-10-11 09:25:18,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-11 09:25:18,159 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 5 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 4 states have call predecessors, (40), 5 states have call successors, (40) Word has length 139 [2024-10-11 09:25:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:25:18,165 INFO L225 Difference]: With dead ends: 485 [2024-10-11 09:25:18,165 INFO L226 Difference]: Without dead ends: 369 [2024-10-11 09:25:18,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=695, Unknown=1, NotChecked=0, Total=930 [2024-10-11 09:25:18,167 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 284 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:25:18,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 462 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 09:25:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-11 09:25:18,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 290. [2024-10-11 09:25:18,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 207 states have (on average 1.285024154589372) internal successors, (266), 209 states have internal predecessors, (266), 72 states have call successors, (72), 10 states have call predecessors, (72), 10 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 09:25:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 410 transitions. [2024-10-11 09:25:18,221 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 410 transitions. Word has length 139 [2024-10-11 09:25:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:25:18,222 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 410 transitions. [2024-10-11 09:25:18,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 5 states have call successors, (40), 4 states have call predecessors, (40), 6 states have return successors, (40), 4 states have call predecessors, (40), 5 states have call successors, (40) [2024-10-11 09:25:18,222 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 410 transitions. [2024-10-11 09:25:18,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-11 09:25:18,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:25:18,224 INFO L215 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] [2024-10-11 09:25:18,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 09:25:18,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:25:18,425 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:25:18,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:25:18,426 INFO L85 PathProgramCache]: Analyzing trace with hash 336245410, now seen corresponding path program 1 times [2024-10-11 09:25:18,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:25:18,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550469079] [2024-10-11 09:25:18,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:18,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:25:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 09:25:18,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [526959107] [2024-10-11 09:25:18,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:18,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:25:18,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:25:18,553 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 09:25:18,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 09:25:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:25:18,964 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 09:25:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 09:25:19,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 09:25:19,104 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 09:25:19,105 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 09:25:19,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 09:25:19,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 09:25:19,311 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 09:25:19,426 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 09:25:19,429 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:25:19 BoogieIcfgContainer [2024-10-11 09:25:19,429 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 09:25:19,429 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 09:25:19,429 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 09:25:19,430 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 09:25:19,430 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:25:11" (3/4) ... [2024-10-11 09:25:19,432 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 09:25:19,433 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 09:25:19,434 INFO L158 Benchmark]: Toolchain (without parser) took 9325.79ms. Allocated memory was 151.0MB in the beginning and 232.8MB in the end (delta: 81.8MB). Free memory was 82.6MB in the beginning and 119.8MB in the end (delta: -37.2MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2024-10-11 09:25:19,434 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 113.2MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:25:19,434 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.48ms. Allocated memory is still 151.0MB. Free memory was 82.4MB in the beginning and 65.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 09:25:19,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.71ms. Allocated memory is still 151.0MB. Free memory was 65.5MB in the beginning and 60.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 09:25:19,435 INFO L158 Benchmark]: Boogie Preprocessor took 93.97ms. Allocated memory is still 151.0MB. Free memory was 60.7MB in the beginning and 54.0MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 09:25:19,435 INFO L158 Benchmark]: RCFGBuilder took 693.94ms. Allocated memory is still 151.0MB. Free memory was 122.3MB in the beginning and 91.1MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 09:25:19,436 INFO L158 Benchmark]: TraceAbstraction took 7998.26ms. Allocated memory was 151.0MB in the beginning and 232.8MB in the end (delta: 81.8MB). Free memory was 90.4MB in the beginning and 119.8MB in the end (delta: -29.4MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2024-10-11 09:25:19,436 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 232.8MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 09:25:19,437 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.17ms. Allocated memory is still 113.2MB. Free memory is still 74.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.48ms. Allocated memory is still 151.0MB. Free memory was 82.4MB in the beginning and 65.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.71ms. Allocated memory is still 151.0MB. Free memory was 65.5MB in the beginning and 60.7MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.97ms. Allocated memory is still 151.0MB. Free memory was 60.7MB in the beginning and 54.0MB in the end (delta: 6.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 693.94ms. Allocated memory is still 151.0MB. Free memory was 122.3MB in the beginning and 91.1MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7998.26ms. Allocated memory was 151.0MB in the beginning and 232.8MB in the end (delta: 81.8MB). Free memory was 90.4MB in the beginning and 119.8MB in the end (delta: -29.4MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 232.8MB. Free memory is still 119.8MB. There was no memory consumed. 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 someBinaryDOUBLEComparisonOperation at line 165, overapproximation of shiftRight at line 165, overapproximation of someUnaryDOUBLEoperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed char var_1_4 = 16; [L24] unsigned char var_1_5 = 1; [L25] unsigned char var_1_6 = 1; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 128; [L29] unsigned char var_1_11 = 64; [L30] signed char var_1_12 = -10; [L31] signed char var_1_13 = -10; [L32] signed char var_1_14 = -25; [L33] double var_1_15 = 64.875; [L34] double var_1_17 = 1.625; [L35] double var_1_18 = 32.2; [L36] double var_1_19 = 8.6; [L37] double var_1_20 = 10.5; [L38] signed short int var_1_21 = -64; [L39] unsigned char var_1_22 = 25; [L40] unsigned char var_1_23 = 0; [L41] unsigned long int var_1_24 = 5; [L42] double var_1_25 = 0.75; [L43] unsigned char var_1_27 = 4; [L44] signed short int var_1_35 = -64; [L45] signed char var_1_36 = -10; [L46] signed long int var_1_39 = 256; [L47] double var_1_40 = 31.6; [L48] signed short int var_1_42 = 5; [L49] signed short int last_1_var_1_21 = -64; [L50] unsigned char last_1_var_1_22 = 25; [L169] isInitial = 1 [L170] FCALL initially() [L171] COND TRUE 1 [L172] CALL updateLastVariables() [L161] last_1_var_1_21 = var_1_21 [L162] last_1_var_1_22 = var_1_22 [L172] RET updateLastVariables() [L173] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_char() [L128] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L128] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L129] CALL assume_abort_if_not(var_1_4 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L129] RET assume_abort_if_not(var_1_4 <= 32) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=1, var_1_6=1, var_1_8=1, var_1_9=0] [L130] var_1_5 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L131] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_6=1, var_1_8=1, var_1_9=0] [L132] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=1, var_1_8=1, var_1_9=0] [L132] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=1, var_1_8=1, var_1_9=0] [L133] var_1_6 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_8=1, var_1_9=0] [L134] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_8=1, var_1_9=0] [L135] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L135] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L136] var_1_9 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1] [L137] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1] [L138] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=128, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=64, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L142] var_1_11 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_11 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L143] RET assume_abort_if_not(var_1_11 >= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=-10, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L145] var_1_13 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_13 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L146] RET assume_abort_if_not(var_1_13 >= -31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_13 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_13 <= 31) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-25, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L148] var_1_14 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L149] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L150] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L150] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_17=13/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L151] var_1_17 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L152] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_18=161/5, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L153] var_1_18 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L154] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_19=43/5, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L155] var_1_19 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L156] RET assume_abort_if_not((var_1_19 >= -230584.3009213691390e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 2305843.009213691390e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_20=21/2, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L157] var_1_20 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L158] RET assume_abort_if_not((var_1_20 >= -230584.3009213691390e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 2305843.009213691390e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L173] RET updateVariables() [L174] CALL step() [L54] signed long int stepLocal_1 = ~ last_1_var_1_21; [L55] unsigned char stepLocal_0 = var_1_5; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=-255, stepLocal_1=63, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L56] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_0=-255, stepLocal_1=63, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=32, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L56] COND TRUE stepLocal_1 != (last_1_var_1_22 >> var_1_4) [L57] COND TRUE stepLocal_0 || var_1_6 [L58] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L65] COND TRUE var_1_4 >= (var_1_21 % ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L66] COND FALSE !(var_1_4 < var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=5, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L72] var_1_42 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L73] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L76] unsigned short int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_3=0, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=519/8, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L77] COND FALSE !(var_1_4 > stepLocal_3) [L80] var_1_15 = var_1_17 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L82] COND FALSE !(var_1_21 > var_1_21) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L85] COND FALSE !(var_1_1 < ((((var_1_4) < (-64)) ? (var_1_4) : (-64)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L88] EXPR var_1_11 | var_1_11 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=158/5, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L88] COND TRUE (var_1_11 | var_1_11) < (8 + var_1_10) [L89] var_1_40 = (((((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (var_1_17)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (var_1_17))) < 0 ) ? -((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (var_1_17)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (var_1_17))) : ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (var_1_17)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (var_1_17))))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=4, var_1_1=0, var_1_21=-64, var_1_22=25, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=3, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L92] COND TRUE ((- var_1_11) < 8) || var_1_9 [L93] var_1_22 = (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=4, var_1_1=0, var_1_21=-64, var_1_22=64, var_1_23=0, var_1_24=5, var_1_25=3/4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=3, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L95] var_1_25 = var_1_19 [L96] var_1_23 = (var_1_11 + var_1_4) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=4, var_1_1=0, var_1_21=-64, var_1_22=64, var_1_23=64, var_1_24=5, var_1_25=4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=3, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L97] COND TRUE var_1_18 <= var_1_20 [L98] var_1_24 = ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=4, var_1_1=0, var_1_21=-64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=3, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L104] COND FALSE !(var_1_6 || var_1_9) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=4, var_1_1=0, var_1_21=-64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=3, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L109] signed short int stepLocal_2 = var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, stepLocal_2=-64, var_1_10=127, var_1_11=-192, var_1_12=-10, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=4, var_1_1=0, var_1_21=-64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=3, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L110] COND TRUE var_1_10 > stepLocal_2 [L111] var_1_12 = ((var_1_4 + var_1_13) + var_1_14) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=4, var_1_1=0, var_1_21=-64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=3, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L113] COND FALSE !((var_1_18 >= var_1_18) && (var_1_4 >= var_1_4)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=4, var_1_1=0, var_1_21=-64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=3, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L120] COND FALSE !(var_1_18 > var_1_18) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=4, var_1_1=0, var_1_21=-64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=3, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L174] RET step() [L175] CALL, EXPR property() [L165] EXPR last_1_var_1_22 >> var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=4, var_1_1=0, var_1_21=-64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=3, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L165-L166] return (((((((((~ last_1_var_1_21) != (last_1_var_1_22 >> var_1_4)) ? ((var_1_5 || var_1_6) ? (var_1_1 == ((unsigned short int) var_1_4)) : (var_1_1 == ((unsigned short int) last_1_var_1_22))) : (var_1_1 == ((unsigned short int) 100))) && (var_1_9 ? (var_1_8 == ((unsigned char) (var_1_10 - (var_1_11 - var_1_4)))) : 1)) && ((var_1_10 > var_1_21) ? (var_1_12 == ((signed char) ((var_1_4 + var_1_13) + var_1_14))) : 1)) && ((var_1_4 > var_1_1) ? (var_1_15 == ((double) ((var_1_17 - var_1_18) + (((((var_1_19) > (499.25)) ? (var_1_19) : (499.25))) + var_1_20)))) : (var_1_15 == ((double) var_1_17)))) && ((var_1_6 || var_1_9) ? (((var_1_24 % var_1_10) > var_1_22) ? (var_1_21 == ((signed short int) (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) + var_1_14))) : 1) : 1)) && ((((- var_1_11) < 8) || var_1_9) ? (var_1_22 == ((unsigned char) (var_1_4 + ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) : 1)) && (var_1_23 == ((unsigned char) (var_1_11 + var_1_4)))) && ((var_1_18 <= var_1_20) ? (var_1_24 == ((unsigned long int) ((((var_1_8) < ((var_1_8 + var_1_11))) ? (var_1_8) : ((var_1_8 + var_1_11)))))) : ((9.99999999999998E13 < var_1_20) ? (var_1_24 == ((unsigned long int) var_1_1)) : 1)) ; [L175] RET, EXPR property() [L175] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=4, var_1_1=0, var_1_21=-64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=3, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_22=25, var_1_10=127, var_1_11=-192, var_1_12=0, var_1_13=31, var_1_14=-31, var_1_15=2, var_1_17=2, var_1_19=4, var_1_1=0, var_1_21=-64, var_1_22=64, var_1_23=64, var_1_24=1, var_1_25=4, var_1_27=4, var_1_35=-64, var_1_36=-10, var_1_39=256, var_1_40=3, var_1_42=0, var_1_4=0, var_1_5=-255, var_1_6=0, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 534 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 534 mSDsluCounter, 1357 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 878 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 987 IncrementalHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 479 mSDtfsCounter, 987 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 420 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 189 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1109 NumberOfCodeBlocks, 1109 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 823 ConstructedInterpolants, 0 QuantifiedInterpolants, 3980 SizeOfPredicates, 3 NumberOfNonLiveVariables, 339 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 4452/4560 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 09:25:19,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-13.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 03c1f1efb08e7a9fddcc253b69596fe6be6bf22aca88662794b2f75978c70d66 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:25:21,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:25:21,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 09:25:21,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:25:21,867 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:25:21,898 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:25:21,899 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:25:21,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:25:21,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:25:21,902 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:25:21,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:25:21,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:25:21,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:25:21,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:25:21,907 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:25:21,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:25:21,908 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:25:21,908 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:25:21,908 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:25:21,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:25:21,909 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:25:21,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:25:21,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:25:21,910 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 09:25:21,910 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 09:25:21,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:25:21,911 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 09:25:21,911 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:25:21,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:25:21,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:25:21,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:25:21,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:25:21,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:25:21,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:25:21,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:25:21,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:25:21,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:25:21,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:25:21,916 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 09:25:21,916 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 09:25:21,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:25:21,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:25:21,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:25:21,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:25:21,917 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 09:25:21,917 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 03c1f1efb08e7a9fddcc253b69596fe6be6bf22aca88662794b2f75978c70d66 [2024-10-11 09:25:22,274 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:25:22,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:25:22,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:25:22,304 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:25:22,306 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:25:22,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-13.i [2024-10-11 09:25:23,870 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:25:24,095 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:25:24,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-13.i [2024-10-11 09:25:24,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1ec1043f5/8aecefaf130b4dcc96b31c9874374a19/FLAGd8e4ad419 [2024-10-11 09:25:24,434 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1ec1043f5/8aecefaf130b4dcc96b31c9874374a19 [2024-10-11 09:25:24,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:25:24,437 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:25:24,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:25:24,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:25:24,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:25:24,445 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:24,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d6631ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24, skipping insertion in model container [2024-10-11 09:25:24,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:24,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:25:24,674 WARN L248 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-pr-ci_file-13.i[919,932] [2024-10-11 09:25:24,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:25:24,783 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:25:24,795 WARN L248 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-pr-ci_file-13.i[919,932] [2024-10-11 09:25:24,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:25:24,871 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:25:24,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24 WrapperNode [2024-10-11 09:25:24,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:25:24,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:25:24,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:25:24,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:25:24,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:24,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:24,940 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-10-11 09:25:24,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:25:24,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:25:24,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:25:24,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:25:24,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:24,957 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:24,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:24,985 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]. [2024-10-11 09:25:24,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:24,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:25,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:25,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:25,014 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:25,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:25,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:25:25,031 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:25:25,031 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:25:25,031 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:25:25,032 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (1/1) ... [2024-10-11 09:25:25,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:25:25,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:25:25,064 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:25:25,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:25:25,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:25:25,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 09:25:25,113 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:25:25,114 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:25:25,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:25:25,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:25:25,200 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:25:25,202 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:25:29,223 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 09:25:29,223 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:25:29,299 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:25:29,301 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:25:29,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:25:29 BoogieIcfgContainer [2024-10-11 09:25:29,301 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:25:29,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:25:29,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:25:29,308 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:25:29,308 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:25:24" (1/3) ... [2024-10-11 09:25:29,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d06c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:25:29, skipping insertion in model container [2024-10-11 09:25:29,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:25:24" (2/3) ... [2024-10-11 09:25:29,311 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d06c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:25:29, skipping insertion in model container [2024-10-11 09:25:29,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:25:29" (3/3) ... [2024-10-11 09:25:29,312 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-13.i [2024-10-11 09:25:29,328 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:25:29,329 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:25:29,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:25:29,425 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;@333e0a7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:25:29,426 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:25:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 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) [2024-10-11 09:25:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 09:25:29,446 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:25:29,447 INFO L215 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] [2024-10-11 09:25:29,447 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:25:29,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:25:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash -180665596, now seen corresponding path program 1 times [2024-10-11 09:25:29,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:25:29,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269568539] [2024-10-11 09:25:29,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:29,468 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 [2024-10-11 09:25:29,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:25:29,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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) [2024-10-11 09:25:29,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 09:25:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:29,880 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 09:25:29,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:25:29,943 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2024-10-11 09:25:29,944 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:25:29,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:25:29,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269568539] [2024-10-11 09:25:29,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269568539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:25:29,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:25:29,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:25:29,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644110186] [2024-10-11 09:25:29,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:25:29,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:25:29,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:25:29,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:25:29,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:25:29,981 INFO L87 Difference]: Start difference. First operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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) [2024-10-11 09:25:32,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:25:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:25:32,425 INFO L93 Difference]: Finished difference Result 133 states and 236 transitions. [2024-10-11 09:25:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:25:32,451 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 133 [2024-10-11 09:25:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:25:32,457 INFO L225 Difference]: With dead ends: 133 [2024-10-11 09:25:32,458 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 09:25:32,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:25:32,464 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 09:25:32,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 09:25:32,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 09:25:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-11 09:25:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 43 states have internal predecessors, (57), 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) [2024-10-11 09:25:32,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 97 transitions. [2024-10-11 09:25:32,513 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 97 transitions. Word has length 133 [2024-10-11 09:25:32,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:25:32,514 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 97 transitions. [2024-10-11 09:25:32,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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) [2024-10-11 09:25:32,514 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 97 transitions. [2024-10-11 09:25:32,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 09:25:32,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:25:32,517 INFO L215 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] [2024-10-11 09:25:32,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 09:25:32,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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 [2024-10-11 09:25:32,719 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:25:32,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:25:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1675459800, now seen corresponding path program 1 times [2024-10-11 09:25:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:25:32,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170736394] [2024-10-11 09:25:32,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:32,721 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 [2024-10-11 09:25:32,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:25:32,723 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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) [2024-10-11 09:25:32,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 09:25:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:33,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 09:25:33,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:25:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:25:34,642 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:25:34,642 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:25:34,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170736394] [2024-10-11 09:25:34,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170736394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:25:34,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:25:34,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:25:34,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977518205] [2024-10-11 09:25:34,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:25:34,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 09:25:34,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:25:34,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 09:25:34,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:25:34,649 INFO L87 Difference]: Start difference. First operand 65 states and 97 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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) [2024-10-11 09:25:37,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:25:39,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:25:39,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:25:39,326 INFO L93 Difference]: Finished difference Result 194 states and 290 transitions. [2024-10-11 09:25:39,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 09:25:39,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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 134 [2024-10-11 09:25:39,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:25:39,354 INFO L225 Difference]: With dead ends: 194 [2024-10-11 09:25:39,354 INFO L226 Difference]: Without dead ends: 130 [2024-10-11 09:25:39,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 09:25:39,357 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 72 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:25:39,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 312 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 09:25:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-11 09:25:39,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 103. [2024-10-11 09:25:39,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 60 states have internal predecessors, (74), 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) [2024-10-11 09:25:39,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 154 transitions. [2024-10-11 09:25:39,386 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 154 transitions. Word has length 134 [2024-10-11 09:25:39,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:25:39,387 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 154 transitions. [2024-10-11 09:25:39,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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) [2024-10-11 09:25:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 154 transitions. [2024-10-11 09:25:39,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 09:25:39,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:25:39,389 INFO L215 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] [2024-10-11 09:25:39,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 09:25:39,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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 [2024-10-11 09:25:39,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:25:39,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:25:39,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1331019468, now seen corresponding path program 1 times [2024-10-11 09:25:39,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:25:39,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642000687] [2024-10-11 09:25:39,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:39,592 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 [2024-10-11 09:25:39,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:25:39,596 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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) [2024-10-11 09:25:39,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 09:25:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:39,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:25:39,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:25:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:25:40,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:25:40,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:25:40,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642000687] [2024-10-11 09:25:40,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642000687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:25:40,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:25:40,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:25:40,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527314022] [2024-10-11 09:25:40,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:25:40,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:25:40,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:25:40,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:25:40,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:25:40,037 INFO L87 Difference]: Start difference. First operand 103 states and 154 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2024-10-11 09:25:42,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:25:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:25:42,122 INFO L93 Difference]: Finished difference Result 202 states and 299 transitions. [2024-10-11 09:25:42,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:25:42,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 135 [2024-10-11 09:25:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:25:42,126 INFO L225 Difference]: With dead ends: 202 [2024-10-11 09:25:42,126 INFO L226 Difference]: Without dead ends: 138 [2024-10-11 09:25:42,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:25:42,128 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 39 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 09:25:42,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 208 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 09:25:42,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-11 09:25:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2024-10-11 09:25:42,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 86 states have internal predecessors, (108), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 09:25:42,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 200 transitions. [2024-10-11 09:25:42,153 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 200 transitions. Word has length 135 [2024-10-11 09:25:42,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:25:42,154 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 200 transitions. [2024-10-11 09:25:42,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2024-10-11 09:25:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 200 transitions. [2024-10-11 09:25:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 09:25:42,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:25:42,157 INFO L215 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] [2024-10-11 09:25:42,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 09:25:42,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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 [2024-10-11 09:25:42,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:25:42,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:25:42,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1375599926, now seen corresponding path program 1 times [2024-10-11 09:25:42,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:25:42,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1100372233] [2024-10-11 09:25:42,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:42,360 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 [2024-10-11 09:25:42,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:25:42,363 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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) [2024-10-11 09:25:42,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 09:25:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:42,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 09:25:42,696 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:25:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:25:43,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:25:43,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:25:43,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1100372233] [2024-10-11 09:25:43,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1100372233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:25:43,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:25:43,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:25:43,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168120146] [2024-10-11 09:25:43,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:25:43,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:25:43,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:25:43,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:25:43,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:25:43,361 INFO L87 Difference]: Start difference. First operand 135 states and 200 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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) [2024-10-11 09:25:45,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:25:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:25:45,405 INFO L93 Difference]: Finished difference Result 327 states and 484 transitions. [2024-10-11 09:25:45,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:25:45,406 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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 135 [2024-10-11 09:25:45,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:25:45,414 INFO L225 Difference]: With dead ends: 327 [2024-10-11 09:25:45,414 INFO L226 Difference]: Without dead ends: 231 [2024-10-11 09:25:45,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:25:45,415 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 24 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:25:45,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 265 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 09:25:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-11 09:25:45,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2024-10-11 09:25:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 151 states have (on average 1.2913907284768211) internal successors, (195), 153 states have internal predecessors, (195), 72 states have call successors, (72), 5 states have call predecessors, (72), 5 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-10-11 09:25:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 339 transitions. [2024-10-11 09:25:45,474 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 339 transitions. Word has length 135 [2024-10-11 09:25:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:25:45,474 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 339 transitions. [2024-10-11 09:25:45,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 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) [2024-10-11 09:25:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 339 transitions. [2024-10-11 09:25:45,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 09:25:45,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:25:45,477 INFO L215 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] [2024-10-11 09:25:45,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 09:25:45,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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 [2024-10-11 09:25:45,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:25:45,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:25:45,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1318341624, now seen corresponding path program 1 times [2024-10-11 09:25:45,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:25:45,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1010257283] [2024-10-11 09:25:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:45,680 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 [2024-10-11 09:25:45,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:25:45,683 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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) [2024-10-11 09:25:45,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 09:25:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:45,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 09:25:45,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:25:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:25:46,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 09:25:46,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:25:46,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1010257283] [2024-10-11 09:25:46,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1010257283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:25:46,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:25:46,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 09:25:46,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254260989] [2024-10-11 09:25:46,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:25:46,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 09:25:46,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:25:46,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 09:25:46,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:25:46,142 INFO L87 Difference]: Start difference. First operand 229 states and 339 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2024-10-11 09:25:50,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 09:25:52,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 09:25:54,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-11 09:25:54,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:25:54,831 INFO L93 Difference]: Finished difference Result 549 states and 806 transitions. [2024-10-11 09:25:54,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 09:25:54,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 135 [2024-10-11 09:25:54,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:25:54,841 INFO L225 Difference]: With dead ends: 549 [2024-10-11 09:25:54,843 INFO L226 Difference]: Without dead ends: 359 [2024-10-11 09:25:54,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 09:25:54,846 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 59 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-10-11 09:25:54,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 176 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 8.6s Time] [2024-10-11 09:25:54,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-11 09:25:54,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 355. [2024-10-11 09:25:54,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 226 states have (on average 1.247787610619469) internal successors, (282), 232 states have internal predecessors, (282), 118 states have call successors, (118), 10 states have call predecessors, (118), 10 states have return successors, (118), 112 states have call predecessors, (118), 118 states have call successors, (118) [2024-10-11 09:25:54,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 518 transitions. [2024-10-11 09:25:54,918 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 518 transitions. Word has length 135 [2024-10-11 09:25:54,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:25:54,919 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 518 transitions. [2024-10-11 09:25:54,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2024-10-11 09:25:54,920 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 518 transitions. [2024-10-11 09:25:54,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:25:54,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:25:54,925 INFO L215 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] [2024-10-11 09:25:54,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-11 09:25:55,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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 [2024-10-11 09:25:55,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:25:55,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:25:55,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1966982754, now seen corresponding path program 1 times [2024-10-11 09:25:55,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:25:55,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767507016] [2024-10-11 09:25:55,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:25:55,130 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 [2024-10-11 09:25:55,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:25:55,133 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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) [2024-10-11 09:25:55,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Waiting until timeout for monitored process [2024-10-11 09:25:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:25:55,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:25:55,437 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:25:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-11 09:25:56,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:25:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-11 09:25:56,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:25:56,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767507016] [2024-10-11 09:25:56,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767507016] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-11 09:25:56,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 09:25:56,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-10-11 09:25:56,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545836022] [2024-10-11 09:25:56,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:25:56,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:25:56,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:25:56,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:25:56,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-11 09:25:56,986 INFO L87 Difference]: Start difference. First operand 355 states and 518 transitions. Second operand has 4 states, 4 states have (on average 9.75) 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) [2024-10-11 09:25:59,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:26:01,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:26:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:26:01,244 INFO L93 Difference]: Finished difference Result 797 states and 1156 transitions. [2024-10-11 09:26:01,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:26:01,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) 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 [2024-10-11 09:26:01,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:26:01,249 INFO L225 Difference]: With dead ends: 797 [2024-10-11 09:26:01,249 INFO L226 Difference]: Without dead ends: 485 [2024-10-11 09:26:01,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-11 09:26:01,251 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 32 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:26:01,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 223 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-11 09:26:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-11 09:26:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 371. [2024-10-11 09:26:01,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 242 states have (on average 1.2479338842975207) internal successors, (302), 248 states have internal predecessors, (302), 118 states have call successors, (118), 10 states have call predecessors, (118), 10 states have return successors, (118), 112 states have call predecessors, (118), 118 states have call successors, (118) [2024-10-11 09:26:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 538 transitions. [2024-10-11 09:26:01,292 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 538 transitions. Word has length 136 [2024-10-11 09:26:01,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:26:01,293 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 538 transitions. [2024-10-11 09:26:01,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) 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) [2024-10-11 09:26:01,294 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 538 transitions. [2024-10-11 09:26:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-11 09:26:01,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:26:01,297 INFO L215 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] [2024-10-11 09:26:01,316 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (7)] Ended with exit code 0 [2024-10-11 09:26:01,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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 [2024-10-11 09:26:01,498 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:26:01,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:26:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash 945914400, now seen corresponding path program 1 times [2024-10-11 09:26:01,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:26:01,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382619412] [2024-10-11 09:26:01,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:26:01,499 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 [2024-10-11 09:26:01,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:26:01,501 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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) [2024-10-11 09:26:01,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (8)] Waiting until timeout for monitored process [2024-10-11 09:26:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:01,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 09:26:01,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:26:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 396 proven. 99 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-10-11 09:26:04,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:26:06,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 09:26:06,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382619412] [2024-10-11 09:26:06,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382619412] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:26:06,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [580113843] [2024-10-11 09:26:06,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:26:06,770 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-11 09:26:06,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-11 09:26:06,773 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-11 09:26:06,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-11 09:26:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:08,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 09:26:08,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 09:26:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 382 proven. 81 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-10-11 09:26:09,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 09:26:11,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [580113843] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 09:26:11,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 09:26:11,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 11 [2024-10-11 09:26:11,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135624397] [2024-10-11 09:26:11,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 09:26:11,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 09:26:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 09:26:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 09:26:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2024-10-11 09:26:11,639 INFO L87 Difference]: Start difference. First operand 371 states and 538 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-10-11 09:26:15,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:26:18,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:26:21,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:26:22,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 09:26:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:26:22,525 INFO L93 Difference]: Finished difference Result 755 states and 1059 transitions. [2024-10-11 09:26:22,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 09:26:22,526 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 136 [2024-10-11 09:26:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:26:22,530 INFO L225 Difference]: With dead ends: 755 [2024-10-11 09:26:22,530 INFO L226 Difference]: Without dead ends: 427 [2024-10-11 09:26:22,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=153, Invalid=267, Unknown=0, NotChecked=0, Total=420 [2024-10-11 09:26:22,532 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-10-11 09:26:22,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 359 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-10-11 09:26:22,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2024-10-11 09:26:22,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 415. [2024-10-11 09:26:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 275 states have (on average 1.210909090909091) internal successors, (333), 281 states have internal predecessors, (333), 118 states have call successors, (118), 21 states have call predecessors, (118), 21 states have return successors, (118), 112 states have call predecessors, (118), 118 states have call successors, (118) [2024-10-11 09:26:22,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 569 transitions. [2024-10-11 09:26:22,574 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 569 transitions. Word has length 136 [2024-10-11 09:26:22,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:26:22,574 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 569 transitions. [2024-10-11 09:26:22,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 4 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-10-11 09:26:22,575 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 569 transitions. [2024-10-11 09:26:22,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-11 09:26:22,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:26:22,576 INFO L215 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] [2024-10-11 09:26:22,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (8)] Ended with exit code 0 [2024-10-11 09:26:22,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-10-11 09:26:22,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-10-11 09:26:22,977 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:26:22,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:26:22,978 INFO L85 PathProgramCache]: Analyzing trace with hash 949674128, now seen corresponding path program 1 times [2024-10-11 09:26:22,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 09:26:22,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066088463] [2024-10-11 09:26:22,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:26:22,979 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 [2024-10-11 09:26:22,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 09:26:22,982 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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) [2024-10-11 09:26:22,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (10)] Waiting until timeout for monitored process [2024-10-11 09:26:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:26:23,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 09:26:23,317 INFO L278 TraceCheckSpWp]: Computing forward predicates...