./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a296476deec2f7c2e840b0d6972380f42f5e94ee83b2e16dd9a7f4baa4b77586 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:04:10,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:04:10,662 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:04:10,666 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:04:10,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:04:10,688 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:04:10,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:04:10,689 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:04:10,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:04:10,690 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:04:10,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:04:10,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:04:10,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:04:10,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:04:10,692 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:04:10,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:04:10,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:04:10,694 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:04:10,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:04:10,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:04:10,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:04:10,696 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:04:10,696 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:04:10,696 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:04:10,697 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:04:10,697 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:04:10,697 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:04:10,698 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:04:10,698 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:04:10,698 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:04:10,699 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:04:10,699 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:04:10,699 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:04:10,700 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:04:10,700 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:04:10,700 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:04:10,700 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:04:10,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:04:10,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:04:10,701 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:04:10,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:04:10,702 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:04:10,702 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/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/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 -> a296476deec2f7c2e840b0d6972380f42f5e94ee83b2e16dd9a7f4baa4b77586 [2024-11-16 17:04:11,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:04:11,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:04:11,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:04:11,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:04:11,069 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:04:11,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i [2024-11-16 17:04:12,545 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:04:12,792 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:04:12,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i [2024-11-16 17:04:12,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8563c4139/051993027e264b5fbebb6c216f184170/FLAGe922757be [2024-11-16 17:04:12,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8563c4139/051993027e264b5fbebb6c216f184170 [2024-11-16 17:04:12,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:04:12,832 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:04:12,834 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:04:12,834 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:04:12,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:04:12,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:04:12" (1/1) ... [2024-11-16 17:04:12,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb8ecc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:12, skipping insertion in model container [2024-11-16 17:04:12,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:04:12" (1/1) ... [2024-11-16 17:04:12,877 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:04:13,047 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i[916,929] [2024-11-16 17:04:13,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:04:13,140 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:04:13,154 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i[916,929] [2024-11-16 17:04:13,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:04:13,219 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:04:13,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13 WrapperNode [2024-11-16 17:04:13,220 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:04:13,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:04:13,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:04:13,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:04:13,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (1/1) ... [2024-11-16 17:04:13,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (1/1) ... [2024-11-16 17:04:13,304 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-16 17:04:13,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:04:13,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:04:13,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:04:13,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:04:13,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (1/1) ... [2024-11-16 17:04:13,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (1/1) ... [2024-11-16 17:04:13,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (1/1) ... [2024-11-16 17:04:13,358 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-11-16 17:04:13,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (1/1) ... [2024-11-16 17:04:13,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (1/1) ... [2024-11-16 17:04:13,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (1/1) ... [2024-11-16 17:04:13,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (1/1) ... [2024-11-16 17:04:13,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (1/1) ... [2024-11-16 17:04:13,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (1/1) ... [2024-11-16 17:04:13,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:04:13,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:04:13,399 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:04:13,399 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:04:13,400 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (1/1) ... [2024-11-16 17:04:13,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:04:13,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:04:13,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 17:04:13,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 17:04:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:04:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:04:13,495 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:04:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:04:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:04:13,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:04:13,670 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:04:13,673 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:04:14,099 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-16 17:04:14,099 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:04:14,120 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:04:14,122 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:04:14,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:04:14 BoogieIcfgContainer [2024-11-16 17:04:14,123 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:04:14,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:04:14,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:04:14,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:04:14,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:04:12" (1/3) ... [2024-11-16 17:04:14,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4528c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:04:14, skipping insertion in model container [2024-11-16 17:04:14,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:13" (2/3) ... [2024-11-16 17:04:14,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f4528c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:04:14, skipping insertion in model container [2024-11-16 17:04:14,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:04:14" (3/3) ... [2024-11-16 17:04:14,134 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-34.i [2024-11-16 17:04:14,151 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:04:14,152 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:04:14,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:04:14,235 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;@2b71f010, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:04:14,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:04:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 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-11-16 17:04:14,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 17:04:14,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:04:14,260 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, 1, 1, 1, 1] [2024-11-16 17:04:14,261 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:04:14,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:04:14,267 INFO L85 PathProgramCache]: Analyzing trace with hash -31472457, now seen corresponding path program 1 times [2024-11-16 17:04:14,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:04:14,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323619475] [2024-11-16 17:04:14,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:04:14,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:04:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:04:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:04:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:04:14,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:04:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:04:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:04:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:04:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:04:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 17:04:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 17:04:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 17:04:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 17:04:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 17:04:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 17:04:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 17:04:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 17:04:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 17:04:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 17:04:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 17:04:14,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 17:04:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:14,798 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 17:04:14,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:04:14,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323619475] [2024-11-16 17:04:14,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323619475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:04:14,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:04:14,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:04:14,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089097087] [2024-11-16 17:04:14,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:04:14,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:04:14,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:04:14,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:04:14,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:04:14,840 INFO L87 Difference]: Start difference. First operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 17:04:14,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:04:14,883 INFO L93 Difference]: Finished difference Result 158 states and 265 transitions. [2024-11-16 17:04:14,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:04:14,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 144 [2024-11-16 17:04:14,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:04:14,895 INFO L225 Difference]: With dead ends: 158 [2024-11-16 17:04:14,896 INFO L226 Difference]: Without dead ends: 78 [2024-11-16 17:04:14,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-11-16 17:04:14,906 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:04:14,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:04:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-16 17:04:14,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-16 17:04:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 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-11-16 17:04:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2024-11-16 17:04:14,956 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 144 [2024-11-16 17:04:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:04:14,956 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-16 17:04:14,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-16 17:04:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2024-11-16 17:04:14,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 17:04:14,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:04:14,963 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, 1, 1, 1, 1] [2024-11-16 17:04:14,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:04:14,964 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:04:14,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:04:14,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1379505123, now seen corresponding path program 1 times [2024-11-16 17:04:14,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:04:14,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812310166] [2024-11-16 17:04:14,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:04:14,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:04:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:04:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:04:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:04:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:04:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:04:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:04:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:04:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:04:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 17:04:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 17:04:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 17:04:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 17:04:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 17:04:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 17:04:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 17:04:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 17:04:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 17:04:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 17:04:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 17:04:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 17:04:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 17:04:16,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:04:16,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812310166] [2024-11-16 17:04:16,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812310166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:04:16,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:04:16,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 17:04:16,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102261309] [2024-11-16 17:04:16,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:04:16,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 17:04:16,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:04:16,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 17:04:16,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:04:16,644 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-11-16 17:04:17,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:04:17,331 INFO L93 Difference]: Finished difference Result 355 states and 527 transitions. [2024-11-16 17:04:17,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 17:04:17,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 144 [2024-11-16 17:04:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:04:17,336 INFO L225 Difference]: With dead ends: 355 [2024-11-16 17:04:17,336 INFO L226 Difference]: Without dead ends: 280 [2024-11-16 17:04:17,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-16 17:04:17,339 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 396 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 17:04:17,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 554 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 17:04:17,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-16 17:04:17,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 199. [2024-11-16 17:04:17,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 142 states have (on average 1.3661971830985915) internal successors, (194), 143 states have internal predecessors, (194), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 17:04:17,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 298 transitions. [2024-11-16 17:04:17,380 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 298 transitions. Word has length 144 [2024-11-16 17:04:17,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:04:17,381 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 298 transitions. [2024-11-16 17:04:17,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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-11-16 17:04:17,382 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 298 transitions. [2024-11-16 17:04:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 17:04:17,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:04:17,384 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, 1, 1, 1, 1] [2024-11-16 17:04:17,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:04:17,385 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:04:17,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:04:17,386 INFO L85 PathProgramCache]: Analyzing trace with hash 2103075005, now seen corresponding path program 1 times [2024-11-16 17:04:17,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:04:17,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317886833] [2024-11-16 17:04:17,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:04:17,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:04:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:04:18,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:04:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:04:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:04:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:04:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:04:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:04:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:04:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 17:04:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 17:04:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 17:04:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 17:04:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 17:04:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 17:04:18,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 17:04:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 17:04:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 17:04:18,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 17:04:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 17:04:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 17:04:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 17:04:18,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:04:18,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317886833] [2024-11-16 17:04:18,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317886833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:04:18,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:04:18,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 17:04:18,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638777961] [2024-11-16 17:04:18,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:04:18,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 17:04:18,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:04:18,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 17:04:18,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 17:04:18,670 INFO L87 Difference]: Start difference. First operand 199 states and 298 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-11-16 17:04:19,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:04:19,329 INFO L93 Difference]: Finished difference Result 387 states and 567 transitions. [2024-11-16 17:04:19,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 17:04:19,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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 144 [2024-11-16 17:04:19,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:04:19,333 INFO L225 Difference]: With dead ends: 387 [2024-11-16 17:04:19,334 INFO L226 Difference]: Without dead ends: 280 [2024-11-16 17:04:19,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-16 17:04:19,336 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 389 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 17:04:19,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 621 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 17:04:19,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-16 17:04:19,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 200. [2024-11-16 17:04:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 143 states have (on average 1.3636363636363635) internal successors, (195), 144 states have internal predecessors, (195), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-16 17:04:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 299 transitions. [2024-11-16 17:04:19,398 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 299 transitions. Word has length 144 [2024-11-16 17:04:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:04:19,398 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 299 transitions. [2024-11-16 17:04:19,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 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-11-16 17:04:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 299 transitions. [2024-11-16 17:04:19,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 17:04:19,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:04:19,401 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, 1, 1, 1, 1] [2024-11-16 17:04:19,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:04:19,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:04:19,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:04:19,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1304388610, now seen corresponding path program 1 times [2024-11-16 17:04:19,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:04:19,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424931575] [2024-11-16 17:04:19,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:04:19,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:04:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:19,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:04:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:19,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:04:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:19,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:04:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:19,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:04:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:19,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:04:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:19,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:04:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:19,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:04:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:19,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:04:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:19,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 17:04:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:19,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 17:04:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:19,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 17:04:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:19,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 17:04:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:20,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 17:04:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:20,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 17:04:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:20,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 17:04:20,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:20,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 17:04:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:20,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 17:04:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:20,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 17:04:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:20,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 17:04:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 17:04:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 17:04:20,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:04:20,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424931575] [2024-11-16 17:04:20,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424931575] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:04:20,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011811121] [2024-11-16 17:04:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:04:20,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:04:20,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:04:20,079 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:04:20,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 17:04:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:20,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 17:04:20,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:04:20,596 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 410 proven. 33 refuted. 0 times theorem prover too weak. 317 trivial. 0 not checked. [2024-11-16 17:04:20,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:04:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 75 proven. 36 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-16 17:04:21,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011811121] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:04:21,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 17:04:21,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-11-16 17:04:21,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004436221] [2024-11-16 17:04:21,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 17:04:21,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-16 17:04:21,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:04:21,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-16 17:04:21,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2024-11-16 17:04:21,025 INFO L87 Difference]: Start difference. First operand 200 states and 299 transitions. Second operand has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 5 states have call successors, (47), 3 states have call predecessors, (47), 7 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2024-11-16 17:04:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:04:23,496 INFO L93 Difference]: Finished difference Result 846 states and 1225 transitions. [2024-11-16 17:04:23,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-11-16 17:04:23,497 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 5 states have call successors, (47), 3 states have call predecessors, (47), 7 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) Word has length 144 [2024-11-16 17:04:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:04:23,507 INFO L225 Difference]: With dead ends: 846 [2024-11-16 17:04:23,508 INFO L226 Difference]: Without dead ends: 711 [2024-11-16 17:04:23,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 331 SyntacticMatches, 2 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2565 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1427, Invalid=5545, Unknown=0, NotChecked=0, Total=6972 [2024-11-16 17:04:23,514 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 2079 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2092 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 1291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:04:23,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2092 Valid, 655 Invalid, 1291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 17:04:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-16 17:04:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 346. [2024-11-16 17:04:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 229 states have (on average 1.240174672489083) internal successors, (284), 230 states have internal predecessors, (284), 100 states have call successors, (100), 16 states have call predecessors, (100), 16 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-16 17:04:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 484 transitions. [2024-11-16 17:04:23,589 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 484 transitions. Word has length 144 [2024-11-16 17:04:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:04:23,592 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 484 transitions. [2024-11-16 17:04:23,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.666666666666667) internal successors, (102), 18 states have internal predecessors, (102), 5 states have call successors, (47), 3 states have call predecessors, (47), 7 states have return successors, (48), 5 states have call predecessors, (48), 5 states have call successors, (48) [2024-11-16 17:04:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 484 transitions. [2024-11-16 17:04:23,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 17:04:23,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:04:23,596 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, 1, 1, 1, 1, 1] [2024-11-16 17:04:23,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 17:04:23,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:04:23,801 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:04:23,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:04:23,802 INFO L85 PathProgramCache]: Analyzing trace with hash -133966361, now seen corresponding path program 1 times [2024-11-16 17:04:23,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:04:23,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966932988] [2024-11-16 17:04:23,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:04:23,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:04:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:04:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:04:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:04:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:04:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:04:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:04:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:04:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:04:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 17:04:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 17:04:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 17:04:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 17:04:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 17:04:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 17:04:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 17:04:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 17:04:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 17:04:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 17:04:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 17:04:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 17:04:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 17:04:24,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:04:24,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966932988] [2024-11-16 17:04:24,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966932988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:04:24,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766786791] [2024-11-16 17:04:24,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:04:24,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:04:24,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:04:24,216 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:04:24,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 17:04:24,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:24,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 17:04:24,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:04:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 189 proven. 6 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-16 17:04:24,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:04:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 17:04:24,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766786791] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:04:24,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 17:04:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-16 17:04:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364132903] [2024-11-16 17:04:24,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 17:04:24,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 17:04:24,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:04:24,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 17:04:24,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-16 17:04:24,607 INFO L87 Difference]: Start difference. First operand 346 states and 484 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 17:04:25,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:04:25,065 INFO L93 Difference]: Finished difference Result 556 states and 769 transitions. [2024-11-16 17:04:25,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 17:04:25,067 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2024-11-16 17:04:25,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:04:25,070 INFO L225 Difference]: With dead ends: 556 [2024-11-16 17:04:25,070 INFO L226 Difference]: Without dead ends: 264 [2024-11-16 17:04:25,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 326 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2024-11-16 17:04:25,072 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 195 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 17:04:25,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 614 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 17:04:25,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-16 17:04:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 240. [2024-11-16 17:04:25,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 164 states have (on average 1.2378048780487805) internal successors, (203), 164 states have internal predecessors, (203), 60 states have call successors, (60), 15 states have call predecessors, (60), 15 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 17:04:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 323 transitions. [2024-11-16 17:04:25,104 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 323 transitions. Word has length 145 [2024-11-16 17:04:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:04:25,105 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 323 transitions. [2024-11-16 17:04:25,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (22), 2 states have call predecessors, (22), 4 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-16 17:04:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 323 transitions. [2024-11-16 17:04:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 17:04:25,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:04:25,107 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, 1, 1, 1, 1, 1] [2024-11-16 17:04:25,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 17:04:25,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:04:25,308 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:04:25,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:04:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash -639524986, now seen corresponding path program 1 times [2024-11-16 17:04:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:04:25,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649914046] [2024-11-16 17:04:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:04:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:04:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:04:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:04:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:04:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:04:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:04:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:04:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:04:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:04:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 17:04:25,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 17:04:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 17:04:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 17:04:25,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 17:04:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 17:04:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 17:04:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:25,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 17:04:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:26,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 17:04:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:26,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 17:04:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:26,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 17:04:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:26,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 17:04:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 17:04:26,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:04:26,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649914046] [2024-11-16 17:04:26,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649914046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:04:26,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371695992] [2024-11-16 17:04:26,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:04:26,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:04:26,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:04:26,029 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:04:26,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 17:04:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:26,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 17:04:26,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:04:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 440 proven. 33 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-11-16 17:04:26,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:04:27,616 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 90 proven. 21 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2024-11-16 17:04:27,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371695992] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:04:27,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 17:04:27,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 14, 12] total 31 [2024-11-16 17:04:27,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654957220] [2024-11-16 17:04:27,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 17:04:27,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-16 17:04:27,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:04:27,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-16 17:04:27,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=750, Unknown=0, NotChecked=0, Total=930 [2024-11-16 17:04:27,621 INFO L87 Difference]: Start difference. First operand 240 states and 323 transitions. Second operand has 31 states, 31 states have (on average 4.193548387096774) internal successors, (130), 31 states have internal predecessors, (130), 8 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (46), 8 states have call predecessors, (46), 8 states have call successors, (46) [2024-11-16 17:04:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:04:29,952 INFO L93 Difference]: Finished difference Result 648 states and 854 transitions. [2024-11-16 17:04:29,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-11-16 17:04:29,953 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 4.193548387096774) internal successors, (130), 31 states have internal predecessors, (130), 8 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (46), 8 states have call predecessors, (46), 8 states have call successors, (46) Word has length 145 [2024-11-16 17:04:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:04:29,955 INFO L225 Difference]: With dead ends: 648 [2024-11-16 17:04:29,956 INFO L226 Difference]: Without dead ends: 473 [2024-11-16 17:04:29,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2409 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1371, Invalid=6461, Unknown=0, NotChecked=0, Total=7832 [2024-11-16 17:04:29,960 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1498 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 1256 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 2044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 1256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:04:29,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 1230 Invalid, 2044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 1256 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 17:04:29,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-16 17:04:30,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 260. [2024-11-16 17:04:30,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 178 states have (on average 1.1741573033707866) internal successors, (209), 178 states have internal predecessors, (209), 60 states have call successors, (60), 21 states have call predecessors, (60), 21 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 17:04:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 329 transitions. [2024-11-16 17:04:30,005 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 329 transitions. Word has length 145 [2024-11-16 17:04:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:04:30,005 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 329 transitions. [2024-11-16 17:04:30,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.193548387096774) internal successors, (130), 31 states have internal predecessors, (130), 8 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (46), 8 states have call predecessors, (46), 8 states have call successors, (46) [2024-11-16 17:04:30,006 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 329 transitions. [2024-11-16 17:04:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 17:04:30,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:04:30,007 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, 1, 1, 1, 1, 1] [2024-11-16 17:04:30,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 17:04:30,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:04:30,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:04:30,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:04:30,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1451912154, now seen corresponding path program 1 times [2024-11-16 17:04:30,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:04:30,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358985068] [2024-11-16 17:04:30,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:04:30,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:04:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:04:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:04:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:04:30,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:04:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:04:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:04:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:04:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 17:04:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 17:04:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 17:04:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 17:04:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 17:04:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 17:04:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 17:04:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 17:04:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 17:04:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 17:04:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 17:04:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 17:04:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 17:04:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:04:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-16 17:04:30,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:04:30,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358985068] [2024-11-16 17:04:30,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358985068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:04:30,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:04:30,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 17:04:30,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56248839] [2024-11-16 17:04:30,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:04:30,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:04:30,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:04:30,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:04:30,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:04:30,593 INFO L87 Difference]: Start difference. First operand 260 states and 329 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 17:04:30,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:04:30,701 INFO L93 Difference]: Finished difference Result 447 states and 568 transitions. [2024-11-16 17:04:30,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:04:30,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-16 17:04:30,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:04:30,704 INFO L225 Difference]: With dead ends: 447 [2024-11-16 17:04:30,704 INFO L226 Difference]: Without dead ends: 260 [2024-11-16 17:04:30,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:04:30,706 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 88 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:04:30,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 254 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:04:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-16 17:04:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-11-16 17:04:30,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 178 states have (on average 1.1629213483146068) internal successors, (207), 178 states have internal predecessors, (207), 60 states have call successors, (60), 21 states have call predecessors, (60), 21 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 17:04:30,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 327 transitions. [2024-11-16 17:04:30,736 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 327 transitions. Word has length 145 [2024-11-16 17:04:30,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:04:30,737 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 327 transitions. [2024-11-16 17:04:30,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-16 17:04:30,737 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 327 transitions. [2024-11-16 17:04:30,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 17:04:30,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:04:30,739 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, 1, 1, 1, 1, 1] [2024-11-16 17:04:30,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 17:04:30,739 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:04:30,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:04:30,740 INFO L85 PathProgramCache]: Analyzing trace with hash -564408473, now seen corresponding path program 1 times [2024-11-16 17:04:30,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:04:30,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467106910] [2024-11-16 17:04:30,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:04:30,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:04:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:04:30,813 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:04:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:04:30,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:04:30,945 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:04:30,947 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:04:30,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 17:04:30,953 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:04:31,074 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:04:31,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:04:31 BoogieIcfgContainer [2024-11-16 17:04:31,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:04:31,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:04:31,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:04:31,079 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:04:31,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:04:14" (3/4) ... [2024-11-16 17:04:31,082 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:04:31,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:04:31,083 INFO L158 Benchmark]: Toolchain (without parser) took 18251.08ms. Allocated memory was 165.7MB in the beginning and 364.9MB in the end (delta: 199.2MB). Free memory was 90.5MB in the beginning and 195.7MB in the end (delta: -105.2MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2024-11-16 17:04:31,083 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 165.7MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:04:31,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.86ms. Allocated memory is still 165.7MB. Free memory was 90.3MB in the beginning and 72.6MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 17:04:31,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.38ms. Allocated memory is still 165.7MB. Free memory was 72.6MB in the beginning and 136.6MB in the end (delta: -63.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2024-11-16 17:04:31,084 INFO L158 Benchmark]: Boogie Preprocessor took 91.73ms. Allocated memory is still 165.7MB. Free memory was 136.6MB in the beginning and 131.3MB in the end (delta: 5.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 17:04:31,084 INFO L158 Benchmark]: IcfgBuilder took 725.29ms. Allocated memory is still 165.7MB. Free memory was 131.3MB in the beginning and 114.4MB in the end (delta: 16.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 17:04:31,085 INFO L158 Benchmark]: TraceAbstraction took 16951.87ms. Allocated memory was 165.7MB in the beginning and 364.9MB in the end (delta: 199.2MB). Free memory was 113.5MB in the beginning and 195.7MB in the end (delta: -82.2MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. [2024-11-16 17:04:31,085 INFO L158 Benchmark]: Witness Printer took 5.04ms. Allocated memory is still 364.9MB. Free memory is still 195.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:04:31,086 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.74ms. Allocated memory is still 165.7MB. Free memory is still 135.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 386.86ms. Allocated memory is still 165.7MB. Free memory was 90.3MB in the beginning and 72.6MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.38ms. Allocated memory is still 165.7MB. Free memory was 72.6MB in the beginning and 136.6MB in the end (delta: -63.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.73ms. Allocated memory is still 165.7MB. Free memory was 136.6MB in the beginning and 131.3MB in the end (delta: 5.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 725.29ms. Allocated memory is still 165.7MB. Free memory was 131.3MB in the beginning and 114.4MB in the end (delta: 16.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16951.87ms. Allocated memory was 165.7MB in the beginning and 364.9MB in the end (delta: 199.2MB). Free memory was 113.5MB in the beginning and 195.7MB in the end (delta: -82.2MB). Peak memory consumption was 120.0MB. Max. memory is 16.1GB. * Witness Printer took 5.04ms. Allocated memory is still 364.9MB. Free memory is still 195.7MB. 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 someBinaryFLOATComparisonOperation at line 185, overapproximation of someUnaryDOUBLEoperation at line 76, overapproximation of someBinaryArithmeticDOUBLEoperation at line 85, overapproximation of someBinaryDOUBLEComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 64; [L23] unsigned char var_1_3 = 200; [L24] unsigned char var_1_4 = 16; [L25] unsigned char var_1_5 = 0; [L26] double var_1_7 = 31.75; [L27] double var_1_8 = 64.75; [L28] double var_1_9 = 1.625; [L29] double var_1_10 = 0.0; [L30] double var_1_11 = 15.75; [L31] double var_1_12 = 199.6; [L32] double var_1_13 = 31.625; [L33] float var_1_14 = 2.575; [L34] float var_1_15 = 0.0; [L35] double var_1_16 = 64.8; [L36] double var_1_18 = 8.01; [L37] double var_1_19 = 1000000.5; [L38] unsigned char var_1_22 = 1; [L39] unsigned char var_1_23 = 1; [L40] unsigned char var_1_24 = 1; [L41] unsigned char var_1_25 = 0; [L42] double var_1_26 = 49.31; [L43] signed long int var_1_28 = 1; [L44] unsigned char var_1_29 = 1; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 1; [L47] unsigned short int last_1_var_1_1 = 64; [L48] unsigned char last_1_var_1_22 = 1; [L49] signed long int last_1_var_1_28 = 1; [L50] unsigned char last_1_var_1_29 = 1; [L51] unsigned char last_1_var_1_31 = 1; VAL [isInitial=0, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=200, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] CALL updateLastVariables() [L178] last_1_var_1_1 = var_1_1 [L179] last_1_var_1_22 = var_1_22 [L180] last_1_var_1_28 = var_1_28 [L181] last_1_var_1_29 = var_1_29 [L182] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=200, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L192] RET updateLastVariables() [L193] CALL updateVariables() [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L144] RET assume_abort_if_not(var_1_3 >= 191) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L145] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L145] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=16, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L146] var_1_4 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L147] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L148] CALL assume_abort_if_not(var_1_4 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L148] RET assume_abort_if_not(var_1_4 <= 64) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=0, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L149] var_1_5 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L150] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L151] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L151] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_8=259/4, var_1_9=13/8] [L152] var_1_8 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L153] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_10=0, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L154] var_1_10 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_10 >= 4611686.018427382800e+12F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L155] RET assume_abort_if_not((var_1_10 >= 4611686.018427382800e+12F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=63/4, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L156] var_1_11 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L157] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_12=998/5, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L158] var_1_12 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L159] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_15=0, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L160] var_1_15 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L161] RET assume_abort_if_not((var_1_15 >= 4611686.018427382800e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_18=801/100, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L162] var_1_18 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L163] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L164] var_1_23 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L165] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L166] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L166] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L167] var_1_24 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L168] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L169] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L169] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=0, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L170] var_1_25 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L171] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L172] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L172] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L173] var_1_30 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L174] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L175] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L175] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L193] RET updateVariables() [L194] CALL step() [L55] COND FALSE !(var_1_8 <= (((((- var_1_12)) < ((var_1_11 - 99999.75))) ? ((- var_1_12)) : ((var_1_11 - 99999.75))))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L62] signed long int stepLocal_7 = 100; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L63] COND TRUE ! (var_1_10 <= 16.8) [L64] var_1_29 = (var_1_23 && ((var_1_24 || last_1_var_1_22) || var_1_30)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L74] unsigned char stepLocal_1 = var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_1=-192, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=127/4, var_1_9=13/8] [L75] COND TRUE stepLocal_1 >= var_1_28 [L76] var_1_7 = ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L78] unsigned char stepLocal_4 = var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_4=-192, stepLocal_7=100, var_1_13=253/8, var_1_14=103/40, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L79] COND TRUE stepLocal_4 <= ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) [L80] var_1_14 = ((((var_1_12) < ((var_1_10 - (var_1_15 - var_1_11)))) ? (var_1_12) : ((var_1_10 - (var_1_15 - var_1_11))))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=324/5, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L84] COND TRUE (- var_1_7) == var_1_10 [L85] var_1_16 = (((((var_1_18 - var_1_15)) > (var_1_11)) ? ((var_1_18 - var_1_15)) : (var_1_11))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=1, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L87] var_1_31 = var_1_25 [L88] signed long int stepLocal_0 = var_1_28; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L89] COND TRUE \read(var_1_29) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_0=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=64, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L90] COND TRUE ((var_1_3 - var_1_4) - var_1_5) <= stepLocal_0 [L91] var_1_1 = var_1_3 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L94] unsigned char stepLocal_6 = var_1_31; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_6=-256, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=1, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L95] COND FALSE !(var_1_31 && stepLocal_6) [L98] var_1_22 = (! (var_1_24 && (! var_1_25))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L100] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=13/8] [L105] COND TRUE var_1_12 == var_1_8 [L106] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L111] unsigned char stepLocal_3 = var_1_3; [L112] unsigned char stepLocal_2 = var_1_10 != var_1_9; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_2=0, stepLocal_3=191, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=253/8, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L113] COND FALSE !(stepLocal_2 && var_1_29) [L124] var_1_13 = var_1_12 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L126] unsigned char stepLocal_5 = var_1_22; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_5=0, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L127] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_5=0, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L134] COND FALSE !(stepLocal_5 || var_1_22) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=4931/100, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L138] COND TRUE var_1_23 || (((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) < var_1_1) [L139] var_1_26 = 25.5 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, stepLocal_3=191, stepLocal_7=100, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L194] RET step() [L195] CALL, EXPR property() [L185-L186] return (((((((((((var_1_29 ? ((((var_1_3 - var_1_4) - var_1_5) <= var_1_28) ? (var_1_1 == ((unsigned short int) var_1_3)) : 1) : 1) && ((var_1_4 >= var_1_28) ? (var_1_7 == ((double) ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) : 1)) && (var_1_22 ? ((var_1_1 >= var_1_5) ? (var_1_9 == ((double) ((((((var_1_10 - var_1_11) - var_1_12)) < (var_1_8)) ? (((var_1_10 - var_1_11) - var_1_12)) : (var_1_8))))) : 1) : ((var_1_12 == var_1_8) ? (var_1_9 == ((double) var_1_11)) : (var_1_9 == ((double) var_1_12))))) && (((var_1_10 != var_1_9) && var_1_29) ? ((var_1_11 >= (127.5 / var_1_10)) ? ((var_1_3 >= var_1_28) ? (var_1_13 == ((double) var_1_10)) : (var_1_13 == ((double) 9.9999999999996E12))) : (var_1_13 == ((double) var_1_11))) : (var_1_13 == ((double) var_1_12)))) && ((var_1_4 <= ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) ? (var_1_14 == ((float) ((((var_1_12) < ((var_1_10 - (var_1_15 - var_1_11)))) ? (var_1_12) : ((var_1_10 - (var_1_15 - var_1_11))))))) : (var_1_14 == ((float) var_1_15)))) && (((- var_1_7) == var_1_10) ? (var_1_16 == ((double) (((((var_1_18 - var_1_15)) > (var_1_11)) ? ((var_1_18 - var_1_15)) : (var_1_11))))) : 1)) && (var_1_22 ? ((var_1_10 >= (var_1_8 * var_1_13)) ? (var_1_19 == ((double) (var_1_18 - (var_1_15 - var_1_11)))) : (var_1_19 == ((double) ((((((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) < (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))))))) : ((var_1_22 || var_1_22) ? (var_1_19 == ((double) var_1_12)) : 1))) && ((var_1_31 && var_1_31) ? (var_1_22 == ((unsigned char) ((var_1_29 || var_1_23) && var_1_24))) : (var_1_22 == ((unsigned char) (! (var_1_24 && (! var_1_25))))))) && ((var_1_23 || (((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) < var_1_1)) ? (var_1_26 == ((double) 25.5)) : 1)) && ((var_1_8 <= (((((- var_1_12)) < ((var_1_11 - 99999.75))) ? ((- var_1_12)) : ((var_1_11 - 99999.75))))) ? ((last_1_var_1_29 && last_1_var_1_31) ? (var_1_28 == ((signed long int) last_1_var_1_1)) : (var_1_28 == ((signed long int) last_1_var_1_1))) : 1)) && ((! (var_1_10 <= 16.8)) ? (var_1_29 == ((unsigned char) (var_1_23 && ((var_1_24 || last_1_var_1_22) || var_1_30)))) : (((last_1_var_1_28 * (- 2)) <= 100) ? (last_1_var_1_22 ? (var_1_29 == ((unsigned char) 0)) : (var_1_29 == ((unsigned char) (var_1_23 && var_1_24)))) : 1))) && (var_1_31 == ((unsigned char) var_1_25)) ; VAL [\result=0, isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_22=1, last_1_var_1_28=1, last_1_var_1_29=1, last_1_var_1_31=1, var_1_11=1000006, var_1_12=1000007, var_1_13=1000007, var_1_14=1000007, var_1_16=1000006, var_1_19=2000001/2, var_1_1=191, var_1_22=0, var_1_23=1, var_1_24=1, var_1_25=-256, var_1_26=51/2, var_1_28=1, var_1_29=1, var_1_30=1, var_1_31=-256, var_1_3=191, var_1_4=-192, var_1_5=127, var_1_7=1000005, var_1_8=1000005, var_1_9=1000006] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4692 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4645 mSDsluCounter, 4046 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3132 mSDsCounter, 1931 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2704 IncrementalHoareTripleChecker+Invalid, 4635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1931 mSolverCounterUnsat, 914 mSDtfsCounter, 2704 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1396 GetRequests, 1172 SyntacticMatches, 3 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5137 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=346occurred in iteration=4, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 763 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1590 NumberOfCodeBlocks, 1590 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1866 ConstructedInterpolants, 0 QuantifiedInterpolants, 6761 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1070 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 9703/9880 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-11-16 17:04:31,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a296476deec2f7c2e840b0d6972380f42f5e94ee83b2e16dd9a7f4baa4b77586 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:04:33,475 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:04:33,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:04:33,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:04:33,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:04:33,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:04:33,601 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:04:33,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:04:33,603 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:04:33,604 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:04:33,604 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:04:33,604 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:04:33,605 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:04:33,605 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:04:33,607 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:04:33,607 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:04:33,608 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:04:33,608 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:04:33,608 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:04:33,608 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:04:33,609 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:04:33,610 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:04:33,610 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:04:33,617 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:04:33,617 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:04:33,617 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:04:33,617 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:04:33,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:04:33,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:04:33,618 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:04:33,619 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:04:33,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:04:33,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:04:33,619 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:04:33,619 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:04:33,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:04:33,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:04:33,624 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:04:33,625 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:04:33,625 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:04:33,625 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:04:33,625 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:04:33,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:04:33,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:04:33,626 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/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/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 -> a296476deec2f7c2e840b0d6972380f42f5e94ee83b2e16dd9a7f4baa4b77586 [2024-11-16 17:04:33,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:04:33,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:04:33,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:04:33,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:04:33,986 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:04:33,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i [2024-11-16 17:04:35,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:04:35,826 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:04:35,827 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i [2024-11-16 17:04:35,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7d8aa85/469028bb2af44c21908d5f3abd951a47/FLAG9dd70a9fa [2024-11-16 17:04:36,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da7d8aa85/469028bb2af44c21908d5f3abd951a47 [2024-11-16 17:04:36,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:04:36,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:04:36,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:04:36,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:04:36,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:04:36,191 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a885448 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36, skipping insertion in model container [2024-11-16 17:04:36,192 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,223 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:04:36,407 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i[916,929] [2024-11-16 17:04:36,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:04:36,524 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:04:36,539 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-34.i[916,929] [2024-11-16 17:04:36,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:04:36,633 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:04:36,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36 WrapperNode [2024-11-16 17:04:36,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:04:36,635 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:04:36,635 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:04:36,635 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:04:36,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,700 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-16 17:04:36,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:04:36,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:04:36,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:04:36,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:04:36,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,755 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-11-16 17:04:36,756 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,756 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,772 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,785 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,793 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:04:36,794 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:04:36,795 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:04:36,795 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:04:36,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (1/1) ... [2024-11-16 17:04:36,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:04:36,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:04:36,828 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 17:04:36,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 17:04:36,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:04:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:04:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:04:36,882 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:04:36,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:04:36,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:04:36,979 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:04:36,982 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:05:02,484 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-16 17:05:02,484 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:05:02,502 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:05:02,502 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:05:02,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:05:02 BoogieIcfgContainer [2024-11-16 17:05:02,503 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:05:02,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:05:02,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:05:02,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:05:02,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:04:36" (1/3) ... [2024-11-16 17:05:02,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3700dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:05:02, skipping insertion in model container [2024-11-16 17:05:02,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:04:36" (2/3) ... [2024-11-16 17:05:02,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f3700dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:05:02, skipping insertion in model container [2024-11-16 17:05:02,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:05:02" (3/3) ... [2024-11-16 17:05:02,522 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-34.i [2024-11-16 17:05:02,540 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:05:02,540 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:05:02,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:05:02,635 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;@22d576e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:05:02,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:05:02,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 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-11-16 17:05:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 17:05:02,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:05:02,658 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, 1, 1, 1, 1] [2024-11-16 17:05:02,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:05:02,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:05:02,665 INFO L85 PathProgramCache]: Analyzing trace with hash -31472457, now seen corresponding path program 1 times [2024-11-16 17:05:02,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:05:02,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [892330569] [2024-11-16 17:05:02,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:05:02,683 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-11-16 17:05:02,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:05:02,686 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:05:02,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 17:05:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:05:04,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 17:05:04,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:05:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-16 17:05:04,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:05:04,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:05:04,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [892330569] [2024-11-16 17:05:04,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [892330569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:05:04,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:05:04,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:05:04,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930617447] [2024-11-16 17:05:04,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:05:04,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:05:04,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:05:04,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:05:04,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:05:04,198 INFO L87 Difference]: Start difference. First operand has 83 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 61 states have internal predecessors, (86), 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 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-11-16 17:05:04,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:05:04,241 INFO L93 Difference]: Finished difference Result 158 states and 265 transitions. [2024-11-16 17:05:04,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:05:04,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 144 [2024-11-16 17:05:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:05:04,253 INFO L225 Difference]: With dead ends: 158 [2024-11-16 17:05:04,254 INFO L226 Difference]: Without dead ends: 78 [2024-11-16 17:05:04,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 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-11-16 17:05:04,266 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:05:04,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:05:04,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-16 17:05:04,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-16 17:05:04,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 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-11-16 17:05:04,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 118 transitions. [2024-11-16 17:05:04,325 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 118 transitions. Word has length 144 [2024-11-16 17:05:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:05:04,325 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 118 transitions. [2024-11-16 17:05:04,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-11-16 17:05:04,326 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 118 transitions. [2024-11-16 17:05:04,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 17:05:04,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:05:04,334 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, 1, 1, 1, 1] [2024-11-16 17:05:04,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 17:05:04,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:05:04,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:05:04,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:05:04,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1379505123, now seen corresponding path program 1 times [2024-11-16 17:05:04,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:05:04,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730193056] [2024-11-16 17:05:04,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:05:04,538 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-11-16 17:05:04,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:05:04,541 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:05:04,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 17:05:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:05:06,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 17:05:06,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:05:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 379 proven. 21 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2024-11-16 17:05:13,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:05:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-16 17:05:19,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:05:19,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730193056] [2024-11-16 17:05:19,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730193056] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:05:19,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 17:05:19,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2024-11-16 17:05:19,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322996090] [2024-11-16 17:05:19,299 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 17:05:19,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 17:05:19,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:05:19,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 17:05:19,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-16 17:05:19,307 INFO L87 Difference]: Start difference. First operand 78 states and 118 transitions. Second operand has 14 states, 14 states have (on average 6.285714285714286) internal successors, (88), 14 states have internal predecessors, (88), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-16 17:05:30,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []