./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-98.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 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:31:09,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:31:09,543 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 00:31:09,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:31:09,549 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:31:09,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:31:09,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:31:09,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:31:09,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:31:09,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:31:09,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:31:09,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:31:09,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:31:09,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:31:09,581 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:31:09,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:31:09,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:31:09,583 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:31:09,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 00:31:09,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:31:09,584 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:31:09,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:31:09,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:31:09,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:31:09,585 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:31:09,585 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:31:09,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:31:09,586 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:31:09,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:31:09,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:31:09,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:31:09,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:31:09,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:31:09,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:31:09,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:31:09,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:31:09,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 00:31:09,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 00:31:09,589 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:31:09,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:31:09,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:31:09,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:31:09,590 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 -> 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d [2024-11-09 00:31:09,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:31:09,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:31:09,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:31:09,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:31:09,858 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:31:09,860 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-98.i [2024-11-09 00:31:11,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:31:11,480 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:31:11,481 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i [2024-11-09 00:31:11,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c21da805/0ff048a2e2f94a04983faf95e528438f/FLAGcb1108240 [2024-11-09 00:31:11,506 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c21da805/0ff048a2e2f94a04983faf95e528438f [2024-11-09 00:31:11,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:31:11,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:31:11,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:11,511 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:31:11,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:31:11,515 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,516 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626378eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11, skipping insertion in model container [2024-11-09 00:31:11,516 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,544 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:31:11,694 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-98.i[916,929] [2024-11-09 00:31:11,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:11,771 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:31:11,782 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-98.i[916,929] [2024-11-09 00:31:11,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:31:11,850 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:31:11,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11 WrapperNode [2024-11-09 00:31:11,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:31:11,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:11,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:31:11,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:31:11,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,905 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-09 00:31:11,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:31:11,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:31:11,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:31:11,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:31:11,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,919 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,932 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-09 00:31:11,933 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:31:11,965 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:31:11,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:31:11,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:31:11,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (1/1) ... [2024-11-09 00:31:11,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:31:11,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:11,998 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-09 00:31:12,005 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-09 00:31:12,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:31:12,063 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:31:12,063 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:31:12,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 00:31:12,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:31:12,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:31:12,187 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:31:12,189 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:31:12,559 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 00:31:12,559 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:31:12,572 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:31:12,572 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:31:12,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:12 BoogieIcfgContainer [2024-11-09 00:31:12,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:31:12,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:31:12,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:31:12,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:31:12,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:31:11" (1/3) ... [2024-11-09 00:31:12,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ce9014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:31:12, skipping insertion in model container [2024-11-09 00:31:12,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:31:11" (2/3) ... [2024-11-09 00:31:12,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ce9014 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:31:12, skipping insertion in model container [2024-11-09 00:31:12,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:12" (3/3) ... [2024-11-09 00:31:12,582 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-98.i [2024-11-09 00:31:12,597 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:31:12,598 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:31:12,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:31:12,663 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;@53bf21e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:31:12,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:31:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 00:31:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:31:12,679 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:12,680 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:31:12,680 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:12,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:12,685 INFO L85 PathProgramCache]: Analyzing trace with hash 2036502826, now seen corresponding path program 1 times [2024-11-09 00:31:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:12,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597320071] [2024-11-09 00:31:12,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:12,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:12,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:31:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:12,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:31:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:31:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:31:13,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:31:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:31:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:31:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:31:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:31:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:31:13,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:31:13,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:31:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:31:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:31:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:31:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:31:13,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:31:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:31:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:31:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:31:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:31:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:31:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:31:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:31:13,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:31:13,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597320071] [2024-11-09 00:31:13,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597320071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:31:13,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:31:13,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:31:13,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092925394] [2024-11-09 00:31:13,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:31:13,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:31:13,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:31:13,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:31:13,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:31:13,139 INFO L87 Difference]: Start difference. First operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:31:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:13,170 INFO L93 Difference]: Finished difference Result 147 states and 255 transitions. [2024-11-09 00:31:13,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:31:13,172 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2024-11-09 00:31:13,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:13,180 INFO L225 Difference]: With dead ends: 147 [2024-11-09 00:31:13,180 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 00:31:13,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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-09 00:31:13,192 INFO L432 NwaCegarLoop]: 112 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, 112 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-09 00:31:13,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:31:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 00:31:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-09 00:31:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 00:31:13,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2024-11-09 00:31:13,238 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 152 [2024-11-09 00:31:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:13,238 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2024-11-09 00:31:13,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:31:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2024-11-09 00:31:13,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:31:13,243 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:13,244 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:31:13,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 00:31:13,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:13,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:13,245 INFO L85 PathProgramCache]: Analyzing trace with hash -317854024, now seen corresponding path program 1 times [2024-11-09 00:31:13,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:13,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543924333] [2024-11-09 00:31:13,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:31:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:31:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:31:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:31:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:31:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:31:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:31:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:31:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:31:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:31:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:31:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:31:13,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:31:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:31:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:31:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:31:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:31:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:31:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:31:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:31:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:31:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:31:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:31:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:13,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:31:13,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:31:13,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543924333] [2024-11-09 00:31:13,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543924333] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:31:13,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:31:13,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 00:31:13,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770413197] [2024-11-09 00:31:13,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:31:13,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 00:31:13,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:31:13,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 00:31:13,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:31:13,582 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:31:13,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:13,658 INFO L93 Difference]: Finished difference Result 211 states and 326 transitions. [2024-11-09 00:31:13,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 00:31:13,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2024-11-09 00:31:13,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:13,661 INFO L225 Difference]: With dead ends: 211 [2024-11-09 00:31:13,661 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 00:31:13,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 00:31:13,664 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 97 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 00:31:13,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 290 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:31:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 00:31:13,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2024-11-09 00:31:13,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 00:31:13,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 213 transitions. [2024-11-09 00:31:13,689 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 213 transitions. Word has length 152 [2024-11-09 00:31:13,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:13,689 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 213 transitions. [2024-11-09 00:31:13,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-09 00:31:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 213 transitions. [2024-11-09 00:31:13,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:31:13,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:13,693 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:31:13,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 00:31:13,693 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:13,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:13,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1457153338, now seen corresponding path program 1 times [2024-11-09 00:31:13,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:13,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943028925] [2024-11-09 00:31:13,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:13,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:31:14,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:31:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:31:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:31:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:31:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:31:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:31:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:31:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:31:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:31:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:31:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:31:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:31:14,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:31:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:31:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:31:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:31:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:31:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:31:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:31:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:31:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:31:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:31:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-09 00:31:14,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:31:14,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943028925] [2024-11-09 00:31:14,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943028925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:31:14,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:31:14,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 00:31:14,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196220106] [2024-11-09 00:31:14,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:31:14,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 00:31:14,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:31:14,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 00:31:14,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 00:31:14,881 INFO L87 Difference]: Start difference. First operand 139 states and 213 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:31:15,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:15,159 INFO L93 Difference]: Finished difference Result 377 states and 575 transitions. [2024-11-09 00:31:15,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 00:31:15,160 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2024-11-09 00:31:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:15,163 INFO L225 Difference]: With dead ends: 377 [2024-11-09 00:31:15,163 INFO L226 Difference]: Without dead ends: 241 [2024-11-09 00:31:15,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 00:31:15,165 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 166 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 00:31:15,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 390 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 00:31:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-09 00:31:15,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 211. [2024-11-09 00:31:15,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 137 states have (on average 1.3503649635036497) internal successors, (185), 137 states have internal predecessors, (185), 69 states have call successors, (69), 4 states have call predecessors, (69), 4 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-09 00:31:15,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 323 transitions. [2024-11-09 00:31:15,199 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 323 transitions. Word has length 152 [2024-11-09 00:31:15,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:15,203 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 323 transitions. [2024-11-09 00:31:15,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:31:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 323 transitions. [2024-11-09 00:31:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:31:15,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:15,206 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:31:15,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 00:31:15,206 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:15,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:15,206 INFO L85 PathProgramCache]: Analyzing trace with hash -131194564, now seen corresponding path program 1 times [2024-11-09 00:31:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:15,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610688196] [2024-11-09 00:31:15,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:15,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:31:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:31:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:31:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:31:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:31:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:31:15,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:31:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:31:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:31:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:31:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:31:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:31:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:31:15,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:31:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:31:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:31:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:31:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:31:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:31:15,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:31:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:31:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:31:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:31:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:31:15,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:31:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610688196] [2024-11-09 00:31:15,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610688196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:31:15,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121569046] [2024-11-09 00:31:15,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:15,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:15,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:15,632 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-09 00:31:15,633 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-09 00:31:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:15,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 00:31:15,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:31:15,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-09 00:31:15,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:31:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:31:16,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121569046] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:31:16,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:31:16,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-09 00:31:16,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129891151] [2024-11-09 00:31:16,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:31:16,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:31:16,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:31:16,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:31:16,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:31:16,164 INFO L87 Difference]: Start difference. First operand 211 states and 323 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-09 00:31:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:16,367 INFO L93 Difference]: Finished difference Result 445 states and 666 transitions. [2024-11-09 00:31:16,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 00:31:16,369 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 152 [2024-11-09 00:31:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:16,376 INFO L225 Difference]: With dead ends: 445 [2024-11-09 00:31:16,376 INFO L226 Difference]: Without dead ends: 237 [2024-11-09 00:31:16,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-09 00:31:16,378 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 168 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 00:31:16,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 197 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 00:31:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-09 00:31:16,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 223. [2024-11-09 00:31:16,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 146 states have internal predecessors, (189), 69 states have call successors, (69), 7 states have call predecessors, (69), 7 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-09 00:31:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 327 transitions. [2024-11-09 00:31:16,409 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 327 transitions. Word has length 152 [2024-11-09 00:31:16,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:16,409 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 327 transitions. [2024-11-09 00:31:16,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-09 00:31:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 327 transitions. [2024-11-09 00:31:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 00:31:16,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:16,412 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:31:16,443 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-09 00:31:16,613 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-09 00:31:16,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:16,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:16,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1925501331, now seen corresponding path program 1 times [2024-11-09 00:31:16,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:16,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281094713] [2024-11-09 00:31:16,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:16,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:16,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:31:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:31:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:31:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:31:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:31:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:31:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:31:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:31:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:31:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:31:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:31:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:31:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:31:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:31:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:31:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:31:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:31:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:31:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:31:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:31:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:31:17,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:31:17,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:31:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:31:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:31:17,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281094713] [2024-11-09 00:31:17,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281094713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:31:17,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928117848] [2024-11-09 00:31:17,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:17,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:17,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:17,157 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-09 00:31:17,158 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-09 00:31:17,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:17,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 00:31:17,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:31:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 372 proven. 51 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-09 00:31:17,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:31:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 15 proven. 51 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:31:18,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928117848] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:31:18,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 00:31:18,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 17 [2024-11-09 00:31:18,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031838115] [2024-11-09 00:31:18,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 00:31:18,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 00:31:18,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:31:18,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 00:31:18,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-11-09 00:31:18,074 INFO L87 Difference]: Start difference. First operand 223 states and 327 transitions. Second operand has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-09 00:31:18,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:31:18,856 INFO L93 Difference]: Finished difference Result 674 states and 982 transitions. [2024-11-09 00:31:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 00:31:18,861 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) Word has length 153 [2024-11-09 00:31:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:31:18,864 INFO L225 Difference]: With dead ends: 674 [2024-11-09 00:31:18,866 INFO L226 Difference]: Without dead ends: 454 [2024-11-09 00:31:18,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2024-11-09 00:31:18,868 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 231 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 00:31:18,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 748 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 00:31:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-09 00:31:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 280. [2024-11-09 00:31:18,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 176 states have (on average 1.2443181818181819) internal successors, (219), 176 states have internal predecessors, (219), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-09 00:31:18,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 403 transitions. [2024-11-09 00:31:18,914 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 403 transitions. Word has length 153 [2024-11-09 00:31:18,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:31:18,914 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 403 transitions. [2024-11-09 00:31:18,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 17 states have internal predecessors, (98), 6 states have call successors, (69), 3 states have call predecessors, (69), 6 states have return successors, (69), 6 states have call predecessors, (69), 6 states have call successors, (69) [2024-11-09 00:31:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 403 transitions. [2024-11-09 00:31:18,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 00:31:18,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:31:18,916 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:31:18,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 00:31:19,120 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-09 00:31:19,121 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:31:19,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:31:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash 375321259, now seen corresponding path program 1 times [2024-11-09 00:31:19,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:31:19,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868197941] [2024-11-09 00:31:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:31:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 00:31:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-09 00:31:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-09 00:31:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-09 00:31:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-09 00:31:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 00:31:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 00:31:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-09 00:31:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-09 00:31:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 00:31:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 00:31:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 00:31:28,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 00:31:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 00:31:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 00:31:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 00:31:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 00:31:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 00:31:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 00:31:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 00:31:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 00:31:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 00:31:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 00:31:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 129 proven. 51 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-11-09 00:31:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 00:31:28,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868197941] [2024-11-09 00:31:28,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868197941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:31:28,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714377099] [2024-11-09 00:31:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:31:28,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:31:28,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:31:28,410 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-09 00:31:28,411 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-09 00:31:28,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:31:28,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 00:31:28,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:31:30,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 563 proven. 156 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2024-11-09 00:31:30,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:31:48,558 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-09 00:32:01,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714377099] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 00:32:01,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:32:01,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 40 [2024-11-09 00:32:01,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671241846] [2024-11-09 00:32:01,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:32:01,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-09 00:32:01,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 00:32:01,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-09 00:32:01,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=2154, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 00:32:01,980 INFO L87 Difference]: Start difference. First operand 280 states and 403 transitions. Second operand has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 36 states have internal predecessors, (101), 13 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 13 states have call predecessors, (46), 13 states have call successors, (46) [2024-11-09 00:32:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:17,201 INFO L93 Difference]: Finished difference Result 1443 states and 1945 transitions. [2024-11-09 00:32:17,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2024-11-09 00:32:17,205 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 36 states have internal predecessors, (101), 13 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 13 states have call predecessors, (46), 13 states have call successors, (46) Word has length 153 [2024-11-09 00:32:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:17,214 INFO L225 Difference]: With dead ends: 1443 [2024-11-09 00:32:17,216 INFO L226 Difference]: Without dead ends: 1299 [2024-11-09 00:32:17,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12620 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=5111, Invalid=32331, Unknown=0, NotChecked=0, Total=37442 [2024-11-09 00:32:17,224 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 2611 mSDsluCounter, 1787 mSDsCounter, 0 mSdLazyCounter, 3671 mSolverCounterSat, 669 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2615 SdHoareTripleChecker+Valid, 1908 SdHoareTripleChecker+Invalid, 4340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 669 IncrementalHoareTripleChecker+Valid, 3671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-09 00:32:17,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2615 Valid, 1908 Invalid, 4340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [669 Valid, 3671 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-09 00:32:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2024-11-09 00:32:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 556. [2024-11-09 00:32:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 368 states have (on average 1.190217391304348) internal successors, (438), 368 states have internal predecessors, (438), 138 states have call successors, (138), 49 states have call predecessors, (138), 49 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2024-11-09 00:32:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 714 transitions. [2024-11-09 00:32:17,293 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 714 transitions. Word has length 153 [2024-11-09 00:32:17,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:17,293 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 714 transitions. [2024-11-09 00:32:17,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.72972972972973) internal successors, (101), 36 states have internal predecessors, (101), 13 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (46), 13 states have call predecessors, (46), 13 states have call successors, (46) [2024-11-09 00:32:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 714 transitions. [2024-11-09 00:32:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 00:32:17,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:17,295 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:32:17,310 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-09 00:32:17,499 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-09 00:32:17,500 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:17,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1055379629, now seen corresponding path program 1 times [2024-11-09 00:32:17,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 00:32:17,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696755679] [2024-11-09 00:32:17,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 00:32:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 00:32:17,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206377036] [2024-11-09 00:32:17,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:17,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:32:17,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:32:17,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 00:32:17,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 00:32:17,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:32:17,752 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 00:32:17,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 00:32:17,916 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 00:32:17,916 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 00:32:17,917 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 00:32:17,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 00:32:18,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 00:32:18,123 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-09 00:32:18,229 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 00:32:18,232 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:32:18 BoogieIcfgContainer [2024-11-09 00:32:18,233 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 00:32:18,233 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 00:32:18,233 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 00:32:18,234 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 00:32:18,234 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:31:12" (3/4) ... [2024-11-09 00:32:18,236 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 00:32:18,237 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 00:32:18,237 INFO L158 Benchmark]: Toolchain (without parser) took 66728.28ms. Allocated memory was 222.3MB in the beginning and 654.3MB in the end (delta: 432.0MB). Free memory was 152.6MB in the beginning and 415.5MB in the end (delta: -262.9MB). Peak memory consumption was 170.1MB. Max. memory is 16.1GB. [2024-11-09 00:32:18,238 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 111.1MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:18,238 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.64ms. Allocated memory is still 222.3MB. Free memory was 152.4MB in the beginning and 135.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 00:32:18,238 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.29ms. Allocated memory is still 222.3MB. Free memory was 135.3MB in the beginning and 132.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 00:32:18,238 INFO L158 Benchmark]: Boogie Preprocessor took 57.75ms. Allocated memory is still 222.3MB. Free memory was 132.3MB in the beginning and 128.4MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 00:32:18,238 INFO L158 Benchmark]: RCFGBuilder took 607.73ms. Allocated memory is still 222.3MB. Free memory was 128.4MB in the beginning and 174.0MB in the end (delta: -45.6MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-11-09 00:32:18,239 INFO L158 Benchmark]: TraceAbstraction took 65657.65ms. Allocated memory was 222.3MB in the beginning and 654.3MB in the end (delta: 432.0MB). Free memory was 174.0MB in the beginning and 415.5MB in the end (delta: -241.5MB). Peak memory consumption was 192.3MB. Max. memory is 16.1GB. [2024-11-09 00:32:18,239 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 654.3MB. Free memory is still 415.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 00:32:18,241 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.18ms. Allocated memory is still 111.1MB. Free memory is still 71.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.64ms. Allocated memory is still 222.3MB. Free memory was 152.4MB in the beginning and 135.3MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.29ms. Allocated memory is still 222.3MB. Free memory was 135.3MB in the beginning and 132.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.75ms. Allocated memory is still 222.3MB. Free memory was 132.3MB in the beginning and 128.4MB in the end (delta: 4.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 607.73ms. Allocated memory is still 222.3MB. Free memory was 128.4MB in the beginning and 174.0MB in the end (delta: -45.6MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 65657.65ms. Allocated memory was 222.3MB in the beginning and 654.3MB in the end (delta: 432.0MB). Free memory was 174.0MB in the beginning and 415.5MB in the end (delta: -241.5MB). Peak memory consumption was 192.3MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 654.3MB. Free memory is still 415.5MB. 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 172, overapproximation of someBinaryArithmeticFLOAToperation at line 74. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -2; [L23] unsigned long int var_1_4 = 128; [L24] signed char var_1_5 = 100; [L25] signed char var_1_6 = 5; [L26] signed char var_1_7 = 25; [L27] signed long int var_1_8 = 0; [L28] signed long int var_1_9 = 100; [L29] signed char var_1_10 = 10; [L30] unsigned char var_1_11 = 1; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 63.5; [L34] float var_1_16 = 0.0; [L35] float var_1_17 = 8.16; [L36] float var_1_18 = 4.625; [L37] float var_1_19 = 1000000.2; [L38] float var_1_20 = 5.2; [L39] signed char var_1_21 = 8; [L40] signed long int var_1_22 = 64; [L41] signed char var_1_24 = 10; [L42] float var_1_25 = 0.0; [L43] float var_1_26 = 128.55; [L44] signed char var_1_27 = 16; [L45] unsigned long int var_1_28 = 256; [L46] signed short int var_1_29 = -128; [L47] signed char last_1_var_1_10 = 10; [L48] signed long int last_1_var_1_22 = 64; [L49] unsigned long int last_1_var_1_28 = 256; VAL [isInitial=0, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L176] isInitial = 1 [L177] FCALL initially() [L178] COND TRUE 1 [L179] CALL updateLastVariables() [L167] last_1_var_1_10 = var_1_10 [L168] last_1_var_1_22 = var_1_22 [L169] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L179] RET updateLastVariables() [L180] CALL updateVariables() [L128] var_1_4 = __VERIFIER_nondet_ulong() [L129] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L129] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L130] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L130] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L131] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L131] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=100, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L132] var_1_5 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_5 >= 62) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L133] RET assume_abort_if_not(var_1_5 >= 62) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L134] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L134] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=5, var_1_7=25, var_1_8=0, var_1_9=100] [L135] var_1_6 = __VERIFIER_nondet_char() [L136] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L136] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L137] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L137] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=25, var_1_8=0, var_1_9=100] [L138] var_1_7 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100] [L139] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100] [L140] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100] [L140] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=100] [L141] var_1_9 = __VERIFIER_nondet_long() [L142] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L142] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L143] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L143] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=0, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L144] var_1_12 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L145] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L146] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L146] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L147] var_1_14 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L148] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L149] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L149] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_16=0, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L150] var_1_16 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L151] RET assume_abort_if_not((var_1_16 >= 4611686.018427382800e+12F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_17=204/25, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L152] var_1_17 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L153] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_18=37/8, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L154] var_1_18 = __VERIFIER_nondet_float() [L155] 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_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L155] 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_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_19=5000001/5, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L156] var_1_19 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L157] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 9223372.036854765600e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_25=0, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L158] var_1_25 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_25 >= 4611686.018427387900e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L159] RET assume_abort_if_not((var_1_25 >= 4611686.018427387900e+12F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854776000e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_26=2571/20, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L160] var_1_26 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L161] RET assume_abort_if_not((var_1_26 >= 0.0F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427387900e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=16, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L162] var_1_27 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L163] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L164] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L164] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L180] RET updateVariables() [L181] CALL step() [L53] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=8, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L56] COND FALSE !(last_1_var_1_10 >= (var_1_6 + last_1_var_1_22)) [L59] var_1_21 = var_1_7 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L62] COND FALSE !(last_1_var_1_28 <= ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=1, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L65] COND TRUE \read(var_1_12) [L66] var_1_11 = (((var_1_20 + 31.75f) <= 4.2f) && var_1_14) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L68] signed char stepLocal_0 = var_1_7; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_0=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=49] [L69] COND TRUE stepLocal_0 != var_1_4 [L70] var_1_8 = ((var_1_7 + ((((var_1_6) > (var_1_5)) ? (var_1_6) : (var_1_5)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_15=127/2, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L74] var_1_15 = ((((((var_1_16 - var_1_17)) > (var_1_18)) ? ((var_1_16 - var_1_17)) : (var_1_18))) - var_1_19) [L75] unsigned char stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=10, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L76] COND TRUE var_1_17 > (((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))) - (var_1_25 - var_1_26)) [L77] var_1_24 = (32 - (var_1_6 + var_1_27)) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=256, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L89] COND FALSE !(\read(var_1_11)) [L98] var_1_28 = ((((var_1_7) > (var_1_6)) ? (var_1_7) : (var_1_6))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L100] signed long int stepLocal_1 = var_1_24 + (var_1_5 - var_1_7); VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_1=61, stepLocal_3=0, var_1_10=10, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L101] COND FALSE !(var_1_6 >= stepLocal_1) [L104] var_1_10 = var_1_7 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L106] unsigned char stepLocal_2 = var_1_11; VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=64, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L107] COND FALSE !(stepLocal_2 && var_1_11) [L110] var_1_22 = ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L112] COND FALSE !(10u <= ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=-128, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L117] COND FALSE !((var_1_8 > var_1_22) && (var_1_19 < (var_1_15 / var_1_16))) [L124] var_1_29 = var_1_27 VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=32, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L181] RET step() [L182] CALL, EXPR property() [L172-L173] return (((((((((((10u <= ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) ? ((((((16u) < (var_1_22)) ? (16u) : (var_1_22))) >= (var_1_8 % var_1_4)) ? (var_1_1 == ((signed char) ((var_1_5 - var_1_6) - var_1_7))) : 1) : 1) && ((var_1_7 != var_1_4) ? (var_1_8 == ((signed long int) ((var_1_7 + ((((var_1_6) > (var_1_5)) ? (var_1_6) : (var_1_5)))) - var_1_9))) : (var_1_8 == ((signed long int) var_1_21)))) && ((var_1_6 >= (var_1_24 + (var_1_5 - var_1_7))) ? (var_1_10 == ((signed char) (var_1_7 - var_1_6))) : (var_1_10 == ((signed char) var_1_7)))) && (var_1_12 ? (var_1_11 == ((unsigned char) (((var_1_20 + 31.75f) <= 4.2f) && var_1_14))) : 1)) && (var_1_15 == ((float) ((((((var_1_16 - var_1_17)) > (var_1_18)) ? ((var_1_16 - var_1_17)) : (var_1_18))) - var_1_19)))) && ((last_1_var_1_28 <= ((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))) ? (var_1_20 == ((float) ((((var_1_17) < (var_1_16)) ? (var_1_17) : (var_1_16))))) : 1)) && (var_1_14 ? (var_1_21 == ((signed char) ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) : ((last_1_var_1_10 >= (var_1_6 + last_1_var_1_22)) ? (var_1_21 == ((signed char) var_1_6)) : (var_1_21 == ((signed char) var_1_7))))) && ((var_1_11 && var_1_11) ? (var_1_22 == ((signed long int) (((((var_1_6 + var_1_10) + var_1_21) < 0 ) ? -((var_1_6 + var_1_10) + var_1_21) : ((var_1_6 + var_1_10) + var_1_21))))) : (var_1_22 == ((signed long int) ((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))))))) && ((var_1_17 > (((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))) - (var_1_25 - var_1_26))) ? (var_1_24 == ((signed char) (32 - (var_1_6 + var_1_27)))) : ((var_1_11 && (var_1_11 && var_1_14)) ? (var_1_24 == ((signed char) (var_1_6 + var_1_27))) : ((var_1_15 >= var_1_18) ? (var_1_24 == ((signed char) var_1_6)) : (var_1_24 == ((signed char) var_1_27)))))) && (var_1_11 ? ((! (var_1_20 >= var_1_16)) ? (var_1_28 == ((unsigned long int) (var_1_27 + var_1_5))) : (((- var_1_26) < (- (var_1_15 + var_1_17))) ? (var_1_28 == ((unsigned long int) ((((var_1_7) > (var_1_27)) ? (var_1_7) : (var_1_27))))) : 1)) : (var_1_28 == ((unsigned long int) ((((var_1_7) > (var_1_6)) ? (var_1_7) : (var_1_6))))))) && (((var_1_8 > var_1_22) && (var_1_19 < (var_1_15 / var_1_16))) ? ((var_1_27 != (var_1_7 - var_1_6)) ? (var_1_29 == ((signed short int) (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))) - ((10000 - var_1_5) + var_1_27)))) : (var_1_29 == ((signed short int) var_1_10))) : (var_1_29 == ((signed short int) var_1_27))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=32, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L182] RET, EXPR property() [L182] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=32, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=10, last_1_var_1_22=64, last_1_var_1_28=256, var_1_10=0, var_1_11=0, var_1_12=1, var_1_14=0, var_1_1=-2, var_1_20=26/5, var_1_21=0, var_1_22=1, var_1_24=-1, var_1_27=32, var_1_28=1, var_1_29=32, var_1_4=5517, var_1_5=62, var_1_6=1, var_1_7=0, var_1_8=13, var_1_9=49] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 65.5s, OverallIterations: 7, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3312 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3273 mSDsluCounter, 3645 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2959 mSDsCounter, 952 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4735 IncrementalHoareTripleChecker+Invalid, 5687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 952 mSolverCounterUnsat, 686 mSDtfsCounter, 4735 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1301 GetRequests, 1068 SyntacticMatches, 1 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12733 ImplicationChecksByTransitivity, 24.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=556occurred in iteration=6, InterpolantAutomatonStates: 200, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 963 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 45.7s InterpolantComputationTime, 1678 NumberOfCodeBlocks, 1678 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1666 ConstructedInterpolants, 0 QuantifiedInterpolants, 9061 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1093 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 10700/11132 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-09 00:32:18,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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-98.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 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 00:32:20,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 00:32:20,415 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 00:32:20,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 00:32:20,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 00:32:20,454 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 00:32:20,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 00:32:20,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 00:32:20,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 00:32:20,460 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 00:32:20,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 00:32:20,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 00:32:20,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 00:32:20,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 00:32:20,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 00:32:20,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 00:32:20,464 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 00:32:20,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 00:32:20,466 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 00:32:20,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 00:32:20,467 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 00:32:20,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 00:32:20,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 00:32:20,468 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 00:32:20,468 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 00:32:20,468 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 00:32:20,468 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 00:32:20,468 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 00:32:20,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 00:32:20,469 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 00:32:20,469 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 00:32:20,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 00:32:20,470 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 00:32:20,470 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 00:32:20,470 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:32:20,470 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 00:32:20,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 00:32:20,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 00:32:20,477 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 00:32:20,478 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 00:32:20,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 00:32:20,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 00:32:20,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 00:32:20,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 00:32:20,478 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 -> 3e656310ec67c2d05ae017a9135a80fcd37a9ab722f93d5597cf89a898d3876d [2024-11-09 00:32:20,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 00:32:20,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 00:32:20,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 00:32:20,775 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 00:32:20,775 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 00:32:20,776 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-98.i [2024-11-09 00:32:22,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 00:32:22,453 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 00:32:22,458 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-98.i [2024-11-09 00:32:22,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d9a6bba/6452d37ff41e45768b35d76ec4c469d6/FLAGc5575074c [2024-11-09 00:32:22,483 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9d9a6bba/6452d37ff41e45768b35d76ec4c469d6 [2024-11-09 00:32:22,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 00:32:22,486 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 00:32:22,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 00:32:22,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 00:32:22,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 00:32:22,494 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cc1398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22, skipping insertion in model container [2024-11-09 00:32:22,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 00:32:22,671 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-98.i[916,929] [2024-11-09 00:32:22,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:32:22,789 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 00:32:22,803 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-98.i[916,929] [2024-11-09 00:32:22,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 00:32:22,861 INFO L204 MainTranslator]: Completed translation [2024-11-09 00:32:22,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22 WrapperNode [2024-11-09 00:32:22,861 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 00:32:22,862 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 00:32:22,862 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 00:32:22,862 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 00:32:22,868 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,920 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 174 [2024-11-09 00:32:22,920 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 00:32:22,921 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 00:32:22,921 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 00:32:22,921 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 00:32:22,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,942 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,961 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-09 00:32:22,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,973 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,986 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 00:32:22,987 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 00:32:22,987 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 00:32:22,987 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 00:32:22,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (1/1) ... [2024-11-09 00:32:22,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 00:32:23,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 00:32:23,033 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-09 00:32:23,050 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-09 00:32:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 00:32:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 00:32:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 00:32:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 00:32:23,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 00:32:23,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 00:32:23,164 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 00:32:23,166 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 00:32:30,606 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-09 00:32:30,606 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 00:32:30,617 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 00:32:30,618 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 00:32:30,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:30 BoogieIcfgContainer [2024-11-09 00:32:30,618 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 00:32:30,620 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 00:32:30,620 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 00:32:30,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 00:32:30,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:32:22" (1/3) ... [2024-11-09 00:32:30,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58256851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:30, skipping insertion in model container [2024-11-09 00:32:30,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:32:22" (2/3) ... [2024-11-09 00:32:30,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58256851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:32:30, skipping insertion in model container [2024-11-09 00:32:30,623 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:32:30" (3/3) ... [2024-11-09 00:32:30,625 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-98.i [2024-11-09 00:32:30,638 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 00:32:30,638 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 00:32:30,692 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 00:32:30,698 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;@17e2f083, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 00:32:30,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 00:32:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 00:32:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:32:30,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:30,716 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:32:30,716 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:30,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2036502826, now seen corresponding path program 1 times [2024-11-09 00:32:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:32:30,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689013445] [2024-11-09 00:32:30,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:30,733 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-09 00:32:30,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:32:30,736 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-09 00:32:30,737 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-09 00:32:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:31,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 00:32:31,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:32:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-09 00:32:31,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 00:32:31,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:32:31,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689013445] [2024-11-09 00:32:31,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689013445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 00:32:31,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 00:32:31,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 00:32:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835297722] [2024-11-09 00:32:31,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 00:32:31,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 00:32:31,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:32:31,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 00:32:31,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 00:32:31,391 INFO L87 Difference]: Start difference. First operand has 77 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 52 states have internal predecessors, (73), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:32:31,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 00:32:31,424 INFO L93 Difference]: Finished difference Result 147 states and 255 transitions. [2024-11-09 00:32:31,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 00:32:31,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2024-11-09 00:32:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 00:32:31,436 INFO L225 Difference]: With dead ends: 147 [2024-11-09 00:32:31,436 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 00:32:31,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 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-09 00:32:31,444 INFO L432 NwaCegarLoop]: 112 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, 112 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-09 00:32:31,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 00:32:31,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 00:32:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-09 00:32:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-09 00:32:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2024-11-09 00:32:31,484 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 152 [2024-11-09 00:32:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 00:32:31,485 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2024-11-09 00:32:31,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-09 00:32:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2024-11-09 00:32:31,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-09 00:32:31,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 00:32:31,490 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:32:31,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 00:32:31,690 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-09 00:32:31,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 00:32:31,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 00:32:31,692 INFO L85 PathProgramCache]: Analyzing trace with hash -317854024, now seen corresponding path program 1 times [2024-11-09 00:32:31,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 00:32:31,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034644795] [2024-11-09 00:32:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 00:32:31,693 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-09 00:32:31,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 00:32:31,701 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-09 00:32:31,702 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-09 00:32:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 00:32:32,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 00:32:32,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 00:32:32,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 498 proven. 24 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-09 00:32:32,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 00:32:33,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 42 proven. 24 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-09 00:32:33,739 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 00:32:33,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034644795] [2024-11-09 00:32:33,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1034644795] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 00:32:33,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 00:32:33,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-09 00:32:33,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323376431] [2024-11-09 00:32:33,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 00:32:33,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 00:32:33,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 00:32:33,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 00:32:33,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-09 00:32:33,744 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32)