./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.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_fillercode_fillercodestructure_filler-pe-ci_file-75.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 1180eee21db070026d3c306cfee214227bc09cf9af8776df243249842b6f8459 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:13:39,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:13:39,429 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:13:39,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:13:39,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:13:39,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:13:39,471 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:13:39,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:13:39,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:13:39,473 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:13:39,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:13:39,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:13:39,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:13:39,474 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:13:39,475 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:13:39,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:13:39,475 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:13:39,476 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:13:39,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:13:39,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:13:39,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:13:39,478 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:13:39,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:13:39,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:13:39,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:13:39,479 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:13:39,479 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:13:39,480 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:13:39,480 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:13:39,480 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:13:39,480 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:13:39,481 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:13:39,481 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:13:39,483 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:13:39,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:13:39,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:13:39,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:13:39,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:13:39,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:13:39,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:13:39,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:13:39,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:13:39,486 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 -> 1180eee21db070026d3c306cfee214227bc09cf9af8776df243249842b6f8459 [2024-11-08 21:13:39,771 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:13:39,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:13:39,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:13:39,799 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:13:39,800 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:13:39,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i [2024-11-08 21:13:41,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:13:41,412 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:13:41,413 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i [2024-11-08 21:13:41,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66daac38d/c183de1786054d98a2932e12477debc1/FLAG8e1c44019 [2024-11-08 21:13:41,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66daac38d/c183de1786054d98a2932e12477debc1 [2024-11-08 21:13:41,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:13:41,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:13:41,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:13:41,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:13:41,454 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:13:41,456 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:41,457 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc405f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41, skipping insertion in model container [2024-11-08 21:13:41,457 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:41,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:13:41,683 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i[919,932] [2024-11-08 21:13:41,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:13:41,788 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:13:41,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i[919,932] [2024-11-08 21:13:41,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:13:41,870 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:13:41,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41 WrapperNode [2024-11-08 21:13:41,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:13:41,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:13:41,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:13:41,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:13:41,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:41,906 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:41,947 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-11-08 21:13:41,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:13:41,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:13:41,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:13:41,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:13:41,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:41,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:41,968 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:41,991 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-08 21:13:41,992 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:41,992 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:42,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:42,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:42,023 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:42,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:42,029 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:13:42,030 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:13:42,030 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:13:42,030 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:13:42,031 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (1/1) ... [2024-11-08 21:13:42,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:13:42,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:13:42,066 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-08 21:13:42,073 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-08 21:13:42,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:13:42,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:13:42,122 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:13:42,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:13:42,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:13:42,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:13:42,261 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:13:42,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:13:42,703 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 21:13:42,703 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:13:42,719 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:13:42,719 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:13:42,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:13:42 BoogieIcfgContainer [2024-11-08 21:13:42,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:13:42,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:13:42,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:13:42,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:13:42,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:13:41" (1/3) ... [2024-11-08 21:13:42,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:13:42, skipping insertion in model container [2024-11-08 21:13:42,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:41" (2/3) ... [2024-11-08 21:13:42,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c5ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:13:42, skipping insertion in model container [2024-11-08 21:13:42,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:13:42" (3/3) ... [2024-11-08 21:13:42,728 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i [2024-11-08 21:13:42,744 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:13:42,744 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:13:42,798 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:13:42,804 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;@7005f44b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:13:42,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:13:42,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 82 states have internal predecessors, (122), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:13:42,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 21:13:42,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:13:42,824 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:13:42,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:13:42,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:13:42,832 INFO L85 PathProgramCache]: Analyzing trace with hash 617969344, now seen corresponding path program 1 times [2024-11-08 21:13:42,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:13:42,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521296507] [2024-11-08 21:13:42,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:13:42,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:13:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:13:43,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:13:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:13:43,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:13:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:13:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:13:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:13:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:13:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:13:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:13:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:13:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:13:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:13:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:13:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:13:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:13:43,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:13:43,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:13:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:13:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:13:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:13:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:13:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:13:43,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:13:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:13:43,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:13:43,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521296507] [2024-11-08 21:13:43,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521296507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:13:43,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:13:43,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:13:43,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100966300] [2024-11-08 21:13:43,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:13:43,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:13:43,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:13:43,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:13:43,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:13:43,421 INFO L87 Difference]: Start difference. First operand has 108 states, 81 states have (on average 1.5061728395061729) internal successors, (122), 82 states have internal predecessors, (122), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 21:13:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:13:43,460 INFO L93 Difference]: Finished difference Result 209 states and 358 transitions. [2024-11-08 21:13:43,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:13:43,463 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 165 [2024-11-08 21:13:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:13:43,469 INFO L225 Difference]: With dead ends: 209 [2024-11-08 21:13:43,469 INFO L226 Difference]: Without dead ends: 104 [2024-11-08 21:13:43,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-08 21:13:43,477 INFO L432 NwaCegarLoop]: 161 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, 161 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-08 21:13:43,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:13:43,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-08 21:13:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-08 21:13:43,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:13:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 161 transitions. [2024-11-08 21:13:43,541 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 161 transitions. Word has length 165 [2024-11-08 21:13:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:13:43,541 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 161 transitions. [2024-11-08 21:13:43,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 21:13:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 161 transitions. [2024-11-08 21:13:43,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 21:13:43,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:13:43,547 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:13:43,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:13:43,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:13:43,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:13:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash -232949436, now seen corresponding path program 1 times [2024-11-08 21:13:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:13:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459514523] [2024-11-08 21:13:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:13:43,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:13:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:13:43,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:13:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:13:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:13:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:13:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:13:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:13:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:13:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:13:43,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:13:43,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:43,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:13:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:13:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:13:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:13:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:13:44,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:13:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:13:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:13:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:13:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:13:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:13:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:13:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:13:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:13:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:13:44,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:13:44,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459514523] [2024-11-08 21:13:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459514523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:13:44,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:13:44,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:13:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363879738] [2024-11-08 21:13:44,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:13:44,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:13:44,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:13:44,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:13:44,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:13:44,068 INFO L87 Difference]: Start difference. First operand 104 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:13:44,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:13:44,275 INFO L93 Difference]: Finished difference Result 303 states and 472 transitions. [2024-11-08 21:13:44,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:13:44,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2024-11-08 21:13:44,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:13:44,278 INFO L225 Difference]: With dead ends: 303 [2024-11-08 21:13:44,279 INFO L226 Difference]: Without dead ends: 202 [2024-11-08 21:13:44,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-08 21:13:44,282 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 138 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:13:44,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 316 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:13:44,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-08 21:13:44,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 146. [2024-11-08 21:13:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 120 states have (on average 1.5166666666666666) internal successors, (182), 120 states have internal predecessors, (182), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:13:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 230 transitions. [2024-11-08 21:13:44,313 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 230 transitions. Word has length 166 [2024-11-08 21:13:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:13:44,315 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 230 transitions. [2024-11-08 21:13:44,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:13:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 230 transitions. [2024-11-08 21:13:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 21:13:44,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:13:44,322 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:13:44,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:13:44,322 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:13:44,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:13:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2141735695, now seen corresponding path program 1 times [2024-11-08 21:13:44,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:13:44,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979244838] [2024-11-08 21:13:44,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:13:44,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:13:44,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:13:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:13:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:13:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:13:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:13:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:13:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:13:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:13:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:13:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:13:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:13:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:13:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:13:44,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:13:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:13:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:13:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:13:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:13:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:13:44,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:13:44,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:13:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:13:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:13:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:13:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:44,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:13:44,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:13:44,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979244838] [2024-11-08 21:13:44,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979244838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:13:44,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:13:44,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:13:44,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871556976] [2024-11-08 21:13:44,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:13:44,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 21:13:44,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:13:44,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 21:13:44,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:13:44,750 INFO L87 Difference]: Start difference. First operand 146 states and 230 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:13:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:13:45,022 INFO L93 Difference]: Finished difference Result 346 states and 539 transitions. [2024-11-08 21:13:45,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 21:13:45,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-08 21:13:45,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:13:45,028 INFO L225 Difference]: With dead ends: 346 [2024-11-08 21:13:45,028 INFO L226 Difference]: Without dead ends: 203 [2024-11-08 21:13:45,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 21:13:45,030 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 134 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:13:45,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 487 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:13:45,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-08 21:13:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 147. [2024-11-08 21:13:45,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 121 states have (on average 1.512396694214876) internal successors, (183), 121 states have internal predecessors, (183), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:13:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 231 transitions. [2024-11-08 21:13:45,049 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 231 transitions. Word has length 167 [2024-11-08 21:13:45,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:13:45,050 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 231 transitions. [2024-11-08 21:13:45,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:13:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 231 transitions. [2024-11-08 21:13:45,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 21:13:45,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:13:45,053 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:13:45,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:13:45,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:13:45,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:13:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash 476160812, now seen corresponding path program 1 times [2024-11-08 21:13:45,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:13:45,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301401811] [2024-11-08 21:13:45,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:13:45,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:13:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:13:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:13:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:13:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:13:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:13:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:13:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:13:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:13:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:13:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:13:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:13:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:13:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:13:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:13:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:13:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:13:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:13:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:13:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:13:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:13:45,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:13:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:13:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:13:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:13:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:13:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:13:45,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301401811] [2024-11-08 21:13:45,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301401811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:13:45,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:13:45,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:13:45,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445143616] [2024-11-08 21:13:45,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:13:45,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:13:45,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:13:45,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:13:45,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:13:45,328 INFO L87 Difference]: Start difference. First operand 147 states and 231 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:13:45,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:13:45,344 INFO L93 Difference]: Finished difference Result 292 states and 461 transitions. [2024-11-08 21:13:45,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:13:45,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-08 21:13:45,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:13:45,349 INFO L225 Difference]: With dead ends: 292 [2024-11-08 21:13:45,349 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 21:13:45,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 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-08 21:13:45,351 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:13:45,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 314 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:13:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 21:13:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-08 21:13:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 122 states have (on average 1.5081967213114753) internal successors, (184), 122 states have internal predecessors, (184), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:13:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 232 transitions. [2024-11-08 21:13:45,373 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 232 transitions. Word has length 167 [2024-11-08 21:13:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:13:45,374 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 232 transitions. [2024-11-08 21:13:45,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:13:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 232 transitions. [2024-11-08 21:13:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 21:13:45,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:13:45,377 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:13:45,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:13:45,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:13:45,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:13:45,378 INFO L85 PathProgramCache]: Analyzing trace with hash -998919504, now seen corresponding path program 1 times [2024-11-08 21:13:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:13:45,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392608536] [2024-11-08 21:13:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:13:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:13:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:13:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:13:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:13:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:13:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:13:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:13:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:13:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:13:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:13:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:13:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:13:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:13:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:13:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:13:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:13:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:13:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:13:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:13:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:13:45,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:13:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:13:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:13:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:13:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:13:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-08 21:13:45,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:13:45,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392608536] [2024-11-08 21:13:45,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392608536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:13:45,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:13:45,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:13:45,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096182526] [2024-11-08 21:13:45,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:13:45,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:13:45,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:13:45,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:13:45,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:13:45,783 INFO L87 Difference]: Start difference. First operand 148 states and 232 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:13:45,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:13:45,871 INFO L93 Difference]: Finished difference Result 293 states and 461 transitions. [2024-11-08 21:13:45,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:13:45,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 168 [2024-11-08 21:13:45,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:13:45,875 INFO L225 Difference]: With dead ends: 293 [2024-11-08 21:13:45,875 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 21:13:45,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-08 21:13:45,877 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 0 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:13:45,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 276 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:13:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 21:13:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-08 21:13:45,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 122 states have (on average 1.5) internal successors, (183), 122 states have internal predecessors, (183), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:13:45,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 231 transitions. [2024-11-08 21:13:45,895 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 231 transitions. Word has length 168 [2024-11-08 21:13:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:13:45,895 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 231 transitions. [2024-11-08 21:13:45,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-08 21:13:45,896 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 231 transitions. [2024-11-08 21:13:45,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-08 21:13:45,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:13:45,898 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:13:45,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:13:45,899 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:13:45,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:13:45,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1448506411, now seen corresponding path program 1 times [2024-11-08 21:13:45,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:13:45,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688643034] [2024-11-08 21:13:45,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:13:45,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:13:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:13:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:13:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:13:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:13:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:13:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:13:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:13:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:13:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:13:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:13:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:13:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:13:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:13:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:13:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:13:46,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:13:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:13:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:13:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:13:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:13:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:13:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:13:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:13:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:13:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 21:13:46,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:13:46,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688643034] [2024-11-08 21:13:46,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688643034] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:13:46,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356077223] [2024-11-08 21:13:46,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:13:46,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:13:46,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:13:46,303 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-08 21:13:46,305 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-08 21:13:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:46,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 21:13:46,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:13:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-11-08 21:13:46,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:13:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 21:13:46,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356077223] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:13:46,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:13:46,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-08 21:13:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739657875] [2024-11-08 21:13:46,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:13:46,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 21:13:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:13:46,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 21:13:46,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:13:46,945 INFO L87 Difference]: Start difference. First operand 148 states and 231 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-08 21:13:47,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:13:47,667 INFO L93 Difference]: Finished difference Result 309 states and 471 transitions. [2024-11-08 21:13:47,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 21:13:47,667 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 168 [2024-11-08 21:13:47,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:13:47,669 INFO L225 Difference]: With dead ends: 309 [2024-11-08 21:13:47,670 INFO L226 Difference]: Without dead ends: 164 [2024-11-08 21:13:47,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 382 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-08 21:13:47,671 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 320 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:13:47,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 324 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 21:13:47,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-08 21:13:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 109. [2024-11-08 21:13:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:13:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2024-11-08 21:13:47,688 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 168 [2024-11-08 21:13:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:13:47,689 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2024-11-08 21:13:47,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-08 21:13:47,690 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2024-11-08 21:13:47,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-08 21:13:47,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:13:47,691 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:13:47,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 21:13:47,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 21:13:47,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:13:47,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:13:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash 103524621, now seen corresponding path program 1 times [2024-11-08 21:13:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:13:47,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327767850] [2024-11-08 21:13:47,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:13:47,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:13:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:13:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 21:13:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 21:13:48,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 21:13:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-08 21:13:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 21:13:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 21:13:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-08 21:13:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-08 21:13:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 21:13:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 21:13:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 21:13:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 21:13:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 21:13:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 21:13:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:13:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 21:13:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:13:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 21:13:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:13:48,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 21:13:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 21:13:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-08 21:13:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-08 21:13:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:48,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 21:13:48,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:13:48,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327767850] [2024-11-08 21:13:48,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327767850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:13:48,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508749787] [2024-11-08 21:13:48,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:13:48,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:13:48,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:13:48,967 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-08 21:13:48,969 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-08 21:13:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:13:49,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-08 21:13:49,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:13:49,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 533 proven. 24 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2024-11-08 21:13:49,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:13:49,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 45 proven. 24 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-08 21:13:49,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508749787] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:13:49,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:13:49,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 18 [2024-11-08 21:13:49,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499263338] [2024-11-08 21:13:49,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:13:49,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-08 21:13:49,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:13:49,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-08 21:13:49,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2024-11-08 21:13:49,697 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-08 21:13:52,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:13:52,258 INFO L93 Difference]: Finished difference Result 366 states and 509 transitions. [2024-11-08 21:13:52,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-08 21:13:52,259 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 170 [2024-11-08 21:13:52,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:13:52,263 INFO L225 Difference]: With dead ends: 366 [2024-11-08 21:13:52,263 INFO L226 Difference]: Without dead ends: 260 [2024-11-08 21:13:52,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 386 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=594, Invalid=1856, Unknown=0, NotChecked=0, Total=2450 [2024-11-08 21:13:52,265 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 408 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:13:52,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 988 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-08 21:13:52,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-08 21:13:52,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 158. [2024-11-08 21:13:52,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 108 states have (on average 1.2314814814814814) internal successors, (133), 109 states have internal predecessors, (133), 43 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-08 21:13:52,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 219 transitions. [2024-11-08 21:13:52,302 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 219 transitions. Word has length 170 [2024-11-08 21:13:52,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:13:52,305 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 219 transitions. [2024-11-08 21:13:52,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 18 states have internal predecessors, (100), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-08 21:13:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 219 transitions. [2024-11-08 21:13:52,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-08 21:13:52,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:13:52,321 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:13:52,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 21:13:52,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-08 21:13:52,522 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:13:52,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:13:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash -453293162, now seen corresponding path program 1 times [2024-11-08 21:13:52,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:13:52,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819341324] [2024-11-08 21:13:52,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:13:52,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:13:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:13:52,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457879360] [2024-11-08 21:13:52,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:13:52,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:13:52,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:13:52,608 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-08 21:13:52,609 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-08 21:13:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:13:52,794 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:13:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:13:52,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:13:52,945 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:13:52,946 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:13:52,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 21:13:53,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:13:53,152 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:13:53,269 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:13:53,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:13:53 BoogieIcfgContainer [2024-11-08 21:13:53,271 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:13:53,272 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:13:53,272 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:13:53,272 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:13:53,274 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:13:42" (3/4) ... [2024-11-08 21:13:53,276 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:13:53,277 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:13:53,278 INFO L158 Benchmark]: Toolchain (without parser) took 11830.68ms. Allocated memory was 172.0MB in the beginning and 278.9MB in the end (delta: 107.0MB). Free memory was 140.9MB in the beginning and 184.6MB in the end (delta: -43.7MB). Peak memory consumption was 62.3MB. Max. memory is 16.1GB. [2024-11-08 21:13:53,278 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:13:53,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.34ms. Allocated memory is still 172.0MB. Free memory was 140.9MB in the beginning and 124.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 21:13:53,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.13ms. Allocated memory is still 172.0MB. Free memory was 124.2MB in the beginning and 120.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:13:53,279 INFO L158 Benchmark]: Boogie Preprocessor took 80.77ms. Allocated memory is still 172.0MB. Free memory was 120.0MB in the beginning and 116.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 21:13:53,279 INFO L158 Benchmark]: RCFGBuilder took 690.13ms. Allocated memory is still 172.0MB. Free memory was 116.9MB in the beginning and 119.7MB in the end (delta: -2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 21:13:53,280 INFO L158 Benchmark]: TraceAbstraction took 10549.71ms. Allocated memory was 172.0MB in the beginning and 278.9MB in the end (delta: 107.0MB). Free memory was 118.7MB in the beginning and 185.6MB in the end (delta: -67.0MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. [2024-11-08 21:13:53,280 INFO L158 Benchmark]: Witness Printer took 5.64ms. Allocated memory is still 278.9MB. Free memory was 185.6MB in the beginning and 184.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:13:53,282 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 104.9MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.34ms. Allocated memory is still 172.0MB. Free memory was 140.9MB in the beginning and 124.2MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.13ms. Allocated memory is still 172.0MB. Free memory was 124.2MB in the beginning and 120.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.77ms. Allocated memory is still 172.0MB. Free memory was 120.0MB in the beginning and 116.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 690.13ms. Allocated memory is still 172.0MB. Free memory was 116.9MB in the beginning and 119.7MB in the end (delta: -2.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 10549.71ms. Allocated memory was 172.0MB in the beginning and 278.9MB in the end (delta: 107.0MB). Free memory was 118.7MB in the beginning and 185.6MB in the end (delta: -67.0MB). Peak memory consumption was 42.1MB. Max. memory is 16.1GB. * Witness Printer took 5.64ms. Allocated memory is still 278.9MB. Free memory was 185.6MB in the beginning and 184.6MB in the end (delta: 1.0MB). 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 177, overapproximation of bitwiseOr at line 58, overapproximation of someUnaryDOUBLEoperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 177, overapproximation of someBinaryArithmeticFLOAToperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 63.6; [L23] float var_1_4 = 128.75; [L24] float var_1_5 = 25.125; [L25] float var_1_6 = 1000000.75; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] float var_1_15 = 25.75; [L32] double var_1_16 = 0.4; [L33] double var_1_17 = 0.0; [L34] double var_1_18 = 0.0; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 24.8; [L37] signed char var_1_21 = 1; [L38] double var_1_22 = 200.8; [L39] unsigned short int var_1_23 = 40076; [L40] unsigned short int var_1_24 = 8; [L41] unsigned long int var_1_25 = 2; [L42] unsigned char var_1_26 = 0; [L43] signed short int var_1_28 = 64; [L44] float var_1_33 = 10.775; [L45] unsigned long int var_1_41 = 256; [L46] unsigned long int var_1_45 = 64; [L47] double var_1_46 = 31.1; [L48] signed char var_1_47 = 50; [L49] signed char var_1_48 = 16; [L50] double last_1_var_1_22 = 200.8; VAL [isInitial=0, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L181] isInitial = 1 [L182] FCALL initially() [L183] COND TRUE 1 [L184] CALL updateLastVariables() [L174] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_4=515/4, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L184] RET updateLastVariables() [L185] CALL updateVariables() [L133] var_1_4 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L134] RET assume_abort_if_not((var_1_4 >= -461168.6018427382800e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427382800e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_5=201/8, var_1_6=4000003/4, var_1_7=1] [L135] var_1_5 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L136] RET assume_abort_if_not((var_1_5 >= -230584.3009213691390e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 2305843.009213691390e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_6=4000003/4, var_1_7=1] [L137] var_1_6 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L138] RET assume_abort_if_not((var_1_6 >= -230584.3009213691390e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 2305843.009213691390e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L139] var_1_11 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L140] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L141] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L141] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L142] var_1_12 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_12 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L143] RET assume_abort_if_not(var_1_12 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L144] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L144] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L145] var_1_13 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L146] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L147] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L150] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_17=0, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L151] var_1_17 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L152] RET assume_abort_if_not((var_1_17 >= 4611686.018427382800e+12F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_18=0, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L153] var_1_18 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && 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_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L154] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && 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_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_19=2000000000001/2, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L155] var_1_19 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L156] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_20=124/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L157] var_1_20 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L158] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=40076, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L159] var_1_23 = __VERIFIER_nondet_ushort() [L160] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L160] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L161] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=8, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L162] var_1_24 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L163] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L164] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=64, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L165] var_1_28 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_28 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L166] RET assume_abort_if_not(var_1_28 >= -32768) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] CALL assume_abort_if_not(var_1_28 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L167] RET assume_abort_if_not(var_1_28 <= 32767) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] CALL assume_abort_if_not(var_1_28 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L168] RET assume_abort_if_not(var_1_28 != 0) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=16, var_1_7=1] [L169] var_1_48 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_48 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L170] RET assume_abort_if_not(var_1_48 >= -127) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L171] CALL assume_abort_if_not(var_1_48 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L171] RET assume_abort_if_not(var_1_48 <= 126) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=103/4, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_7=1] [L185] RET updateVariables() [L186] CALL step() [L54] COND TRUE ! (var_1_4 < 16.8f) [L55] var_1_15 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=2, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L57] var_1_25 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L58] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L58] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L58] EXPR 4 | var_1_25 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L58] EXPR (((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L58] COND TRUE (((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25 [L59] var_1_7 = ((var_1_11 && var_1_12) && var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L67] COND FALSE !(var_1_25 > var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2/5, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L70] COND TRUE var_1_18 > (var_1_20 + (var_1_19 * var_1_17)) [L71] var_1_16 = var_1_6 VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L76] unsigned long int stepLocal_1 = var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_1=318/5, var_1_21=1, var_1_22=1004/5, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L77] COND FALSE !(var_1_18 < (last_1_var_1_22 * var_1_4)) [L84] var_1_22 = var_1_20 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L86] unsigned char stepLocal_0 = -1 <= var_1_25; VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_0=0, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_1=318/5, var_1_20=3, var_1_21=1, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L87] COND TRUE stepLocal_0 || var_1_7 [L88] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_20=3, var_1_21=1, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L90] COND TRUE (- (var_1_17 + var_1_1)) >= var_1_16 [L91] var_1_21 = ((((-50) < 0 ) ? -(-50) : (-50))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=0, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L93] COND TRUE (var_1_25 % var_1_28) >= var_1_24 [L94] var_1_26 = (var_1_14 || var_1_13) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L98] EXPR var_1_25 ^ (var_1_28 + var_1_25) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=431/40, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_6=2, var_1_7=1] [L98] COND TRUE (var_1_25 ^ (var_1_28 + var_1_25)) <= (((((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) < 0 ) ? -((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))) : ((((var_1_23) < (var_1_23)) ? (var_1_23) : (var_1_23))))) [L99] var_1_33 = (((((((((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) < (var_1_5)) ? (((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) : (var_1_5))) < 0 ) ? -((((((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) < (var_1_5)) ? (((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) : (var_1_5))) : ((((((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) < (var_1_5)) ? (((((var_1_18) < (var_1_4)) ? (var_1_18) : (var_1_4)))) : (var_1_5))))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L107] EXPR var_1_23 & var_1_24 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L107] COND TRUE (var_1_23 & var_1_24) <= var_1_25 [L108] COND FALSE !(var_1_6 <= var_1_6) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=64, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L116] var_1_45 = var_1_23 VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=311/10, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L117] COND FALSE !(var_1_25 != var_1_25) [L120] var_1_46 = ((((4.6) > (((((var_1_6) > (var_1_20)) ? (var_1_6) : (var_1_20))))) ? (4.6) : (((((var_1_6) > (var_1_20)) ? (var_1_6) : (var_1_20)))))) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L122] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_22=1004/5, stepLocal_1=32767, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L186] RET step() [L187] CALL, EXPR property() [L177] EXPR (((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13)))) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L177-L178] return ((((((((-1 <= var_1_25) || var_1_7) ? (var_1_1 == ((float) (var_1_4 + (var_1_5 + var_1_6)))) : 1) && (((((((var_1_25 + var_1_25)) < ((4 | var_1_25))) ? ((var_1_25 + var_1_25)) : ((4 | var_1_25)))) >= var_1_25) ? (var_1_7 == ((unsigned char) ((var_1_11 && var_1_12) && var_1_13))) : ((var_1_6 == var_1_15) ? (var_1_7 == ((unsigned char) var_1_14)) : (var_1_7 == ((unsigned char) var_1_13))))) && ((! (var_1_4 < 16.8f)) ? (var_1_15 == ((float) var_1_6)) : 1)) && ((var_1_25 > var_1_25) ? (var_1_16 == ((double) ((((((var_1_17) < (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_19) - var_1_20))) : ((var_1_18 > (var_1_20 + (var_1_19 * var_1_17))) ? (var_1_16 == ((double) var_1_6)) : (var_1_16 == ((double) var_1_20))))) && (((- (var_1_17 + var_1_1)) >= var_1_16) ? (var_1_21 == ((signed char) ((((-50) < 0 ) ? -(-50) : (-50))))) : 1)) && ((var_1_18 < (last_1_var_1_22 * var_1_4)) ? (((var_1_23 - var_1_24) < var_1_25) ? (var_1_22 == ((double) var_1_5)) : (var_1_22 == ((double) var_1_17))) : (var_1_22 == ((double) var_1_20)))) && (var_1_25 == ((unsigned long int) var_1_23)) ; [L187] RET, EXPR property() [L187] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_22=1004/5, var_1_11=1, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=2, var_1_16=2, var_1_18=0, var_1_20=3, var_1_21=50, var_1_22=3, var_1_23=32767, var_1_24=0, var_1_25=32767, var_1_26=1, var_1_28=-32767, var_1_33=4, var_1_41=256, var_1_45=32767, var_1_46=23/5, var_1_47=50, var_1_48=-127, var_1_4=0, var_1_5=0, var_1_6=2, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 108 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 8, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1018 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1000 mSDsluCounter, 2866 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1656 mSDsCounter, 384 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2495 IncrementalHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 384 mSolverCounterUnsat, 1210 mSDtfsCounter, 2495 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1117 GetRequests, 1043 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=7, InterpolantAutomatonStates: 69, 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, 7 MinimizatonAttempts, 269 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1857 NumberOfCodeBlocks, 1857 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1836 ConstructedInterpolants, 0 QuantifiedInterpolants, 3270 SizeOfPredicates, 2 NumberOfNonLiveVariables, 775 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 12000/12144 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-08 21:13:53,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.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 1180eee21db070026d3c306cfee214227bc09cf9af8776df243249842b6f8459 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:13:55,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:13:55,759 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:13:55,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:13:55,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:13:55,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:13:55,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:13:55,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:13:55,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:13:55,806 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:13:55,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:13:55,809 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:13:55,810 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:13:55,810 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:13:55,810 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:13:55,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:13:55,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:13:55,811 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:13:55,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:13:55,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:13:55,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:13:55,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:13:55,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:13:55,817 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:13:55,818 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:13:55,818 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:13:55,818 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:13:55,819 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:13:55,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:13:55,820 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:13:55,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:13:55,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:13:55,820 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:13:55,821 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:13:55,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:13:55,822 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:13:55,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:13:55,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:13:55,823 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:13:55,823 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:13:55,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:13:55,824 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:13:55,824 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:13:55,824 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:13:55,824 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 -> 1180eee21db070026d3c306cfee214227bc09cf9af8776df243249842b6f8459 [2024-11-08 21:13:56,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:13:56,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:13:56,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:13:56,202 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:13:56,202 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:13:56,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i [2024-11-08 21:13:57,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:13:58,079 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:13:58,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i [2024-11-08 21:13:58,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24c8b6136/af92695f861a4ec288ecb82ccf9fd175/FLAGcce3cd26b [2024-11-08 21:13:58,410 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24c8b6136/af92695f861a4ec288ecb82ccf9fd175 [2024-11-08 21:13:58,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:13:58,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:13:58,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:13:58,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:13:58,420 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:13:58,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebae2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58, skipping insertion in model container [2024-11-08 21:13:58,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:13:58,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i[919,932] [2024-11-08 21:13:58,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:13:58,750 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:13:58,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i[919,932] [2024-11-08 21:13:58,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:13:58,830 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:13:58,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58 WrapperNode [2024-11-08 21:13:58,830 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:13:58,831 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:13:58,831 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:13:58,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:13:58,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,859 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,897 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-08 21:13:58,898 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:13:58,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:13:58,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:13:58,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:13:58,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,946 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-08 21:13:58,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,949 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,971 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:13:58,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:13:58,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:13:58,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:13:58,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (1/1) ... [2024-11-08 21:13:58,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:13:59,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:13:59,026 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-08 21:13:59,032 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-08 21:13:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:13:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:13:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:13:59,075 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:13:59,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:13:59,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:13:59,180 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:13:59,183 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:14:26,493 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-08 21:14:26,494 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:14:26,512 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:14:26,513 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:14:26,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:14:26 BoogieIcfgContainer [2024-11-08 21:14:26,514 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:14:26,517 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:14:26,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:14:26,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:14:26,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:13:58" (1/3) ... [2024-11-08 21:14:26,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c29f983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:14:26, skipping insertion in model container [2024-11-08 21:14:26,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:13:58" (2/3) ... [2024-11-08 21:14:26,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c29f983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:14:26, skipping insertion in model container [2024-11-08 21:14:26,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:14:26" (3/3) ... [2024-11-08 21:14:26,525 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-75.i [2024-11-08 21:14:26,543 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:14:26,544 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:14:26,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:14:26,614 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;@29ece705, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:14:26,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:14:26,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:14:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 21:14:26,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:14:26,632 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:14:26,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:14:26,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:14:26,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2008537169, now seen corresponding path program 1 times [2024-11-08 21:14:26,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:14:26,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088107465] [2024-11-08 21:14:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:14:26,651 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-08 21:14:26,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:14:26,654 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-08 21:14:26,655 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-08 21:14:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:14:27,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:14:27,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:14:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-11-08 21:14:27,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:14:27,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:14:27,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088107465] [2024-11-08 21:14:27,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1088107465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:14:27,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:14:27,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:14:27,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29607818] [2024-11-08 21:14:27,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:14:27,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:14:27,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:14:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:14:27,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:14:27,476 INFO L87 Difference]: Start difference. First operand has 82 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 21:14:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:14:27,513 INFO L93 Difference]: Finished difference Result 157 states and 274 transitions. [2024-11-08 21:14:27,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:14:27,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 159 [2024-11-08 21:14:27,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:14:27,524 INFO L225 Difference]: With dead ends: 157 [2024-11-08 21:14:27,525 INFO L226 Difference]: Without dead ends: 78 [2024-11-08 21:14:27,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 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-08 21:14:27,535 INFO L432 NwaCegarLoop]: 119 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, 119 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-08 21:14:27,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:14:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-08 21:14:27,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-08 21:14:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 21:14:27,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 119 transitions. [2024-11-08 21:14:27,589 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 119 transitions. Word has length 159 [2024-11-08 21:14:27,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:14:27,589 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 119 transitions. [2024-11-08 21:14:27,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-08 21:14:27,590 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 119 transitions. [2024-11-08 21:14:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 21:14:27,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:14:27,595 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:14:27,615 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-08 21:14:27,796 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-08 21:14:27,797 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:14:27,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:14:27,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1503279126, now seen corresponding path program 1 times [2024-11-08 21:14:27,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:14:27,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833206176] [2024-11-08 21:14:27,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:14:27,799 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-08 21:14:27,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:14:27,803 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-08 21:14:27,805 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-08 21:14:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:14:28,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-08 21:14:28,638 INFO L278 TraceCheckSpWp]: Computing forward predicates...