./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.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 71c7df1fae20fc80c584d7fcd9c77a1cbb9d81b2af2b3bc6d67d6058472b2f60 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:11:39,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:11:40,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 10:11:40,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:11:40,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:11:40,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:11:40,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:11:40,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:11:40,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:11:40,103 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:11:40,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:11:40,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:11:40,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:11:40,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:11:40,107 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:11:40,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:11:40,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:11:40,108 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:11:40,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 10:11:40,108 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:11:40,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:11:40,109 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:11:40,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:11:40,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:11:40,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:11:40,109 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:11:40,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:11:40,109 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:11:40,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:11:40,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:11:40,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:11:40,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:11:40,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:11:40,112 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:11:40,112 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:11:40,112 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:11:40,113 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 10:11:40,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 10:11:40,113 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:11:40,113 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:11:40,113 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:11:40,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:11:40,116 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 -> 71c7df1fae20fc80c584d7fcd9c77a1cbb9d81b2af2b3bc6d67d6058472b2f60 [2024-10-24 10:11:40,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:11:40,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:11:40,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:11:40,345 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:11:40,345 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:11:40,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i [2024-10-24 10:11:41,837 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:11:41,986 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:11:41,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i [2024-10-24 10:11:42,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a4e0bd2/cf9dea8e08604c1dbf641ba14389d63c/FLAG530b89f7f [2024-10-24 10:11:42,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74a4e0bd2/cf9dea8e08604c1dbf641ba14389d63c [2024-10-24 10:11:42,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:11:42,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:11:42,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:11:42,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:11:42,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:11:42,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:42,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78570f8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42, skipping insertion in model container [2024-10-24 10:11:42,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:42,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:11:42,659 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i[916,929] [2024-10-24 10:11:42,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:11:42,810 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:11:42,823 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i[916,929] [2024-10-24 10:11:42,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:11:42,874 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:11:42,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42 WrapperNode [2024-10-24 10:11:42,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:11:42,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:11:42,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:11:42,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:11:42,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:42,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:42,945 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-10-24 10:11:42,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:11:42,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:11:42,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:11:42,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:11:42,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:42,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:42,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:42,992 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:11:42,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:42,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:43,004 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:43,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:43,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:43,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:43,023 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:11:43,024 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:11:43,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:11:43,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:11:43,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (1/1) ... [2024-10-24 10:11:43,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:11:43,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:11:43,057 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-10-24 10:11:43,062 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-10-24 10:11:43,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:11:43,103 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:11:43,104 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:11:43,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 10:11:43,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:11:43,104 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:11:43,181 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:11:43,182 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:11:43,652 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-24 10:11:43,653 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:11:43,699 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:11:43,700 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:11:43,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:11:43 BoogieIcfgContainer [2024-10-24 10:11:43,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:11:43,703 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:11:43,703 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:11:43,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:11:43,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:11:42" (1/3) ... [2024-10-24 10:11:43,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8951ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:11:43, skipping insertion in model container [2024-10-24 10:11:43,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:11:42" (2/3) ... [2024-10-24 10:11:43,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8951ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:11:43, skipping insertion in model container [2024-10-24 10:11:43,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:11:43" (3/3) ... [2024-10-24 10:11:43,709 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-53.i [2024-10-24 10:11:43,724 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:11:43,724 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:11:43,789 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:11:43,796 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;@d392ceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:11:43,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:11:43,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 10:11:43,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 10:11:43,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:11:43,818 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:11:43,818 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:11:43,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:11:43,823 INFO L85 PathProgramCache]: Analyzing trace with hash 697475533, now seen corresponding path program 1 times [2024-10-24 10:11:43,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:11:43,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307036976] [2024-10-24 10:11:43,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:11:43,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:11:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:11:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:11:44,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:11:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:11:44,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:11:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:11:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:11:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:11:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:11:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:11:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:11:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:11:44,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:11:44,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:11:44,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:11:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:11:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:11:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 10:11:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:11:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:11:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:11:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:11:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 10:11:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:11:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 10:11:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 10:11:44,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:11:44,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307036976] [2024-10-24 10:11:44,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307036976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:11:44,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:11:44,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:11:44,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756648548] [2024-10-24 10:11:44,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:11:44,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:11:44,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:11:44,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:11:44,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:11:44,338 INFO L87 Difference]: Start difference. First operand has 89 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 10:11:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:11:44,383 INFO L93 Difference]: Finished difference Result 175 states and 307 transitions. [2024-10-24 10:11:44,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:11:44,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 165 [2024-10-24 10:11:44,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:11:44,392 INFO L225 Difference]: With dead ends: 175 [2024-10-24 10:11:44,392 INFO L226 Difference]: Without dead ends: 87 [2024-10-24 10:11:44,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:11:44,400 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:11:44,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:11:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-24 10:11:44,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-24 10:11:44,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.45) internal successors, (87), 60 states have internal predecessors, (87), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 10:11:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 137 transitions. [2024-10-24 10:11:44,438 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 137 transitions. Word has length 165 [2024-10-24 10:11:44,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:11:44,439 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 137 transitions. [2024-10-24 10:11:44,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 10:11:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 137 transitions. [2024-10-24 10:11:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 10:11:44,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:11:44,444 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:11:44,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 10:11:44,444 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:11:44,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:11:44,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1965709895, now seen corresponding path program 1 times [2024-10-24 10:11:44,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:11:44,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959516663] [2024-10-24 10:11:44,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:11:44,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:11:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:11:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:11:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:11:45,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:11:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:11:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:11:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:11:45,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:11:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:11:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:11:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:11:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:11:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:11:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:11:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:11:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:11:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:11:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 10:11:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:11:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:11:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:11:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:11:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 10:11:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:11:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 10:11:45,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:45,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 10:11:45,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:11:45,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959516663] [2024-10-24 10:11:45,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959516663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:11:45,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:11:45,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:11:45,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706686274] [2024-10-24 10:11:45,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:11:45,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:11:45,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:11:45,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:11:45,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:11:45,182 INFO L87 Difference]: Start difference. First operand 87 states and 137 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:11:45,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:11:45,260 INFO L93 Difference]: Finished difference Result 219 states and 342 transitions. [2024-10-24 10:11:45,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:11:45,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 165 [2024-10-24 10:11:45,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:11:45,263 INFO L225 Difference]: With dead ends: 219 [2024-10-24 10:11:45,266 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 10:11:45,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:11:45,267 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 60 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:11:45,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 384 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 10:11:45,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 10:11:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2024-10-24 10:11:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 95 states have (on average 1.4736842105263157) internal successors, (140), 96 states have internal predecessors, (140), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 10:11:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 202 transitions. [2024-10-24 10:11:45,291 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 202 transitions. Word has length 165 [2024-10-24 10:11:45,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:11:45,292 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 202 transitions. [2024-10-24 10:11:45,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:11:45,293 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 202 transitions. [2024-10-24 10:11:45,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-24 10:11:45,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:11:45,295 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:11:45,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 10:11:45,295 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:11:45,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:11:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2022968197, now seen corresponding path program 1 times [2024-10-24 10:11:45,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:11:45,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190176924] [2024-10-24 10:11:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:11:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:11:45,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:11:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:11:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:11:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:11:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:11:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:11:51,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:11:51,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:11:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:11:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:11:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:11:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:11:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:11:51,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:11:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:11:51,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:11:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:11:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 10:11:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:11:51,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:11:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:11:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:11:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 10:11:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:11:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 10:11:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 10:11:51,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:11:51,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190176924] [2024-10-24 10:11:51,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190176924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:11:51,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:11:51,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 10:11:51,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987582949] [2024-10-24 10:11:51,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:11:51,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 10:11:51,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:11:51,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 10:11:51,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2024-10-24 10:11:51,723 INFO L87 Difference]: Start difference. First operand 129 states and 202 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-24 10:11:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:11:56,505 INFO L93 Difference]: Finished difference Result 585 states and 911 transitions. [2024-10-24 10:11:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 10:11:56,506 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 165 [2024-10-24 10:11:56,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:11:56,510 INFO L225 Difference]: With dead ends: 585 [2024-10-24 10:11:56,510 INFO L226 Difference]: Without dead ends: 457 [2024-10-24 10:11:56,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=227, Invalid=765, Unknown=0, NotChecked=0, Total=992 [2024-10-24 10:11:56,512 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 1005 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1005 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:11:56,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1005 Valid, 778 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-24 10:11:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2024-10-24 10:11:56,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 232. [2024-10-24 10:11:56,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 171 states have (on average 1.4795321637426901) internal successors, (253), 172 states have internal predecessors, (253), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 10:11:56,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 365 transitions. [2024-10-24 10:11:56,531 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 365 transitions. Word has length 165 [2024-10-24 10:11:56,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:11:56,531 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 365 transitions. [2024-10-24 10:11:56,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 17 states have internal predecessors, (43), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-10-24 10:11:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 365 transitions. [2024-10-24 10:11:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 10:11:56,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:11:56,534 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:11:56,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 10:11:56,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:11:56,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:11:56,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1220494448, now seen corresponding path program 1 times [2024-10-24 10:11:56,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:11:56,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604292499] [2024-10-24 10:11:56,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:11:56,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:11:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:11:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:11:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:11:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:11:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:11:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:11:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:11:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:11:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:11:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:11:56,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:11:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:11:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:11:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:11:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:11:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:56,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:11:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:57,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:11:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:57,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 10:11:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:57,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:11:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:11:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:57,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:11:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:57,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:11:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:57,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 10:11:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:57,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:11:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:57,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 10:11:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 10:11:57,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:11:57,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604292499] [2024-10-24 10:11:57,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604292499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:11:57,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:11:57,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 10:11:57,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941910638] [2024-10-24 10:11:57,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:11:57,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:11:57,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:11:57,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:11:57,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:11:57,026 INFO L87 Difference]: Start difference. First operand 232 states and 365 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:11:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:11:57,409 INFO L93 Difference]: Finished difference Result 628 states and 982 transitions. [2024-10-24 10:11:57,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 10:11:57,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2024-10-24 10:11:57,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:11:57,413 INFO L225 Difference]: With dead ends: 628 [2024-10-24 10:11:57,414 INFO L226 Difference]: Without dead ends: 500 [2024-10-24 10:11:57,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-24 10:11:57,418 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 313 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 10:11:57,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 1059 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 10:11:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2024-10-24 10:11:57,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 264. [2024-10-24 10:11:57,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 203 states have (on average 1.5073891625615763) internal successors, (306), 204 states have internal predecessors, (306), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 10:11:57,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 418 transitions. [2024-10-24 10:11:57,457 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 418 transitions. Word has length 166 [2024-10-24 10:11:57,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:11:57,457 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 418 transitions. [2024-10-24 10:11:57,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:11:57,458 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 418 transitions. [2024-10-24 10:11:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 10:11:57,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:11:57,461 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:11:57,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 10:11:57,461 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:11:57,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:11:57,462 INFO L85 PathProgramCache]: Analyzing trace with hash 519429870, now seen corresponding path program 1 times [2024-10-24 10:11:57,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:11:57,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345998329] [2024-10-24 10:11:57,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:11:57,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:11:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:11:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:11:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:11:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:11:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:11:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:11:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:11:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:11:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:11:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:11:59,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:11:59,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:11:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:11:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:11:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:11:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:11:59,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:11:59,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 10:11:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:11:59,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:11:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:11:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:11:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 10:11:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:11:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 10:11:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:11:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 10:11:59,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:11:59,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345998329] [2024-10-24 10:11:59,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345998329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:11:59,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:11:59,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 10:11:59,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689199008] [2024-10-24 10:11:59,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:11:59,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 10:11:59,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:11:59,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 10:11:59,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:11:59,426 INFO L87 Difference]: Start difference. First operand 264 states and 418 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:12:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:12:00,599 INFO L93 Difference]: Finished difference Result 683 states and 1079 transitions. [2024-10-24 10:12:00,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 10:12:00,607 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2024-10-24 10:12:00,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:12:00,609 INFO L225 Difference]: With dead ends: 683 [2024-10-24 10:12:00,609 INFO L226 Difference]: Without dead ends: 555 [2024-10-24 10:12:00,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-24 10:12:00,615 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 246 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:12:00,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 572 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 10:12:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-10-24 10:12:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 297. [2024-10-24 10:12:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 236 states have (on average 1.5338983050847457) internal successors, (362), 237 states have internal predecessors, (362), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-24 10:12:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 474 transitions. [2024-10-24 10:12:00,646 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 474 transitions. Word has length 166 [2024-10-24 10:12:00,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:12:00,650 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 474 transitions. [2024-10-24 10:12:00,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:12:00,650 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 474 transitions. [2024-10-24 10:12:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 10:12:00,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:12:00,651 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:12:00,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 10:12:00,651 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:12:00,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:12:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash 402845998, now seen corresponding path program 1 times [2024-10-24 10:12:00,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:12:00,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518187292] [2024-10-24 10:12:00,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:12:00,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:12:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:12:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:12:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:12:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:12:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:12:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:12:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:12:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:12:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:12:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:12:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:12:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:12:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:12:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:12:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:12:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:12:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:12:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 10:12:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:12:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:12:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:12:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:12:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 10:12:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:12:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 10:12:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 10:12:00,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:12:00,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518187292] [2024-10-24 10:12:00,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518187292] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:12:00,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:12:00,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:12:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003944702] [2024-10-24 10:12:00,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:12:00,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:12:00,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:12:00,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:12:00,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:12:00,945 INFO L87 Difference]: Start difference. First operand 297 states and 474 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:12:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:12:01,076 INFO L93 Difference]: Finished difference Result 690 states and 1092 transitions. [2024-10-24 10:12:01,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 10:12:01,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2024-10-24 10:12:01,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:12:01,079 INFO L225 Difference]: With dead ends: 690 [2024-10-24 10:12:01,080 INFO L226 Difference]: Without dead ends: 518 [2024-10-24 10:12:01,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 10:12:01,081 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 125 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:12:01,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 399 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:12:01,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-10-24 10:12:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 412. [2024-10-24 10:12:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 340 states have (on average 1.5176470588235293) internal successors, (516), 343 states have internal predecessors, (516), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 10:12:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 644 transitions. [2024-10-24 10:12:01,101 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 644 transitions. Word has length 166 [2024-10-24 10:12:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:12:01,102 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 644 transitions. [2024-10-24 10:12:01,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:12:01,103 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 644 transitions. [2024-10-24 10:12:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-24 10:12:01,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:12:01,105 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:12:01,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 10:12:01,105 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:12:01,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:12:01,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1162119254, now seen corresponding path program 1 times [2024-10-24 10:12:01,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:12:01,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093637241] [2024-10-24 10:12:01,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:12:01,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:12:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:12:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:12:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:12:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:12:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:12:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:12:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:12:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:12:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:12:02,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:12:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:12:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:12:02,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:12:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:12:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:12:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:12:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:12:02,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 10:12:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:12:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:12:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:12:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:12:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 10:12:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:12:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 10:12:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 10:12:02,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:12:02,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093637241] [2024-10-24 10:12:02,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093637241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:12:02,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:12:02,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 10:12:02,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551044654] [2024-10-24 10:12:02,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:12:02,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 10:12:02,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:12:02,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 10:12:02,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-24 10:12:02,651 INFO L87 Difference]: Start difference. First operand 412 states and 644 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:12:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:12:03,118 INFO L93 Difference]: Finished difference Result 958 states and 1498 transitions. [2024-10-24 10:12:03,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 10:12:03,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 166 [2024-10-24 10:12:03,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:12:03,123 INFO L225 Difference]: With dead ends: 958 [2024-10-24 10:12:03,123 INFO L226 Difference]: Without dead ends: 718 [2024-10-24 10:12:03,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 10:12:03,124 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 191 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:12:03,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 301 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 10:12:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-10-24 10:12:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 422. [2024-10-24 10:12:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 350 states have (on average 1.52) internal successors, (532), 353 states have internal predecessors, (532), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 10:12:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 660 transitions. [2024-10-24 10:12:03,144 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 660 transitions. Word has length 166 [2024-10-24 10:12:03,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:12:03,144 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 660 transitions. [2024-10-24 10:12:03,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:12:03,145 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 660 transitions. [2024-10-24 10:12:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 10:12:03,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:12:03,148 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:12:03,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 10:12:03,148 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:12:03,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:12:03,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2083017098, now seen corresponding path program 1 times [2024-10-24 10:12:03,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:12:03,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507734534] [2024-10-24 10:12:03,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:12:03,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:12:03,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:12:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:12:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:12:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:12:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:12:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:12:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:12:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:12:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:12:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:12:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:12:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:12:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:12:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:12:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:12:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:12:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:12:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 10:12:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:12:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:12:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:12:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:12:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 10:12:03,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:12:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 10:12:03,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-24 10:12:03,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:12:03,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507734534] [2024-10-24 10:12:03,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507734534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 10:12:03,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282833558] [2024-10-24 10:12:03,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:12:03,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:12:03,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:12:03,672 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-10-24 10:12:03,672 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-10-24 10:12:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:03,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 10:12:03,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:12:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 78 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-10-24 10:12:04,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:12:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-10-24 10:12:04,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282833558] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:12:04,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 10:12:04,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 17 [2024-10-24 10:12:04,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104898095] [2024-10-24 10:12:04,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 10:12:04,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 10:12:04,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:12:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 10:12:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2024-10-24 10:12:04,263 INFO L87 Difference]: Start difference. First operand 422 states and 660 transitions. Second operand has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-10-24 10:12:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:12:05,970 INFO L93 Difference]: Finished difference Result 2033 states and 3089 transitions. [2024-10-24 10:12:05,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-24 10:12:05,970 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) Word has length 167 [2024-10-24 10:12:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:12:05,977 INFO L225 Difference]: With dead ends: 2033 [2024-10-24 10:12:05,977 INFO L226 Difference]: Without dead ends: 1720 [2024-10-24 10:12:05,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 379 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=664, Invalid=3118, Unknown=0, NotChecked=0, Total=3782 [2024-10-24 10:12:05,979 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1671 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 10:12:05,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 991 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 10:12:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1720 states. [2024-10-24 10:12:06,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1720 to 564. [2024-10-24 10:12:06,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 487 states have (on average 1.4640657084188913) internal successors, (713), 490 states have internal predecessors, (713), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 10:12:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 841 transitions. [2024-10-24 10:12:06,028 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 841 transitions. Word has length 167 [2024-10-24 10:12:06,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:12:06,028 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 841 transitions. [2024-10-24 10:12:06,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.470588235294118) internal successors, (110), 17 states have internal predecessors, (110), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-10-24 10:12:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 841 transitions. [2024-10-24 10:12:06,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 10:12:06,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:12:06,034 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:12:06,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 10:12:06,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:12:06,235 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:12:06,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:12:06,236 INFO L85 PathProgramCache]: Analyzing trace with hash -457884, now seen corresponding path program 1 times [2024-10-24 10:12:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:12:06,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338284220] [2024-10-24 10:12:06,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:12:06,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:12:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:12:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:12:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:12:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:12:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:12:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:12:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:12:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:12:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:12:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:12:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:12:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:12:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:12:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:12:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:12:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:12:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:12:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 10:12:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:12:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:12:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:12:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:12:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 10:12:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:12:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 10:12:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:06,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 10:12:06,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:12:06,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338284220] [2024-10-24 10:12:06,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338284220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:12:06,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:12:06,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 10:12:06,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914804808] [2024-10-24 10:12:06,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:12:06,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 10:12:06,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:12:06,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 10:12:06,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 10:12:06,487 INFO L87 Difference]: Start difference. First operand 564 states and 841 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:12:06,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:12:06,582 INFO L93 Difference]: Finished difference Result 999 states and 1496 transitions. [2024-10-24 10:12:06,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 10:12:06,583 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-10-24 10:12:06,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:12:06,586 INFO L225 Difference]: With dead ends: 999 [2024-10-24 10:12:06,587 INFO L226 Difference]: Without dead ends: 578 [2024-10-24 10:12:06,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 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-10-24 10:12:06,588 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 55 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 10:12:06,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 270 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 10:12:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2024-10-24 10:12:06,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 572. [2024-10-24 10:12:06,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 495 states have (on average 1.4565656565656566) internal successors, (721), 498 states have internal predecessors, (721), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 10:12:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 849 transitions. [2024-10-24 10:12:06,608 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 849 transitions. Word has length 167 [2024-10-24 10:12:06,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:12:06,609 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 849 transitions. [2024-10-24 10:12:06,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:12:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 849 transitions. [2024-10-24 10:12:06,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-24 10:12:06,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:12:06,611 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:12:06,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 10:12:06,611 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:12:06,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:12:06,612 INFO L85 PathProgramCache]: Analyzing trace with hash -397083587, now seen corresponding path program 1 times [2024-10-24 10:12:06,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:12:06,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139779481] [2024-10-24 10:12:06,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:12:06,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:12:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 10:12:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 10:12:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 10:12:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 10:12:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 10:12:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 10:12:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 10:12:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 10:12:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 10:12:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 10:12:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 10:12:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 10:12:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 10:12:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 10:12:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 10:12:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 10:12:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 10:12:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 10:12:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 10:12:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 10:12:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 10:12:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 10:12:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 10:12:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 10:12:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 10:12:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-10-24 10:12:08,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:12:08,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139779481] [2024-10-24 10:12:08,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139779481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:12:08,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:12:08,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 10:12:08,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433961918] [2024-10-24 10:12:08,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:12:08,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 10:12:08,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:12:08,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 10:12:08,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-24 10:12:08,116 INFO L87 Difference]: Start difference. First operand 572 states and 849 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:12:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:12:08,889 INFO L93 Difference]: Finished difference Result 1386 states and 2050 transitions. [2024-10-24 10:12:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 10:12:08,889 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 167 [2024-10-24 10:12:08,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:12:08,893 INFO L225 Difference]: With dead ends: 1386 [2024-10-24 10:12:08,893 INFO L226 Difference]: Without dead ends: 965 [2024-10-24 10:12:08,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-10-24 10:12:08,894 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 387 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 10:12:08,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 430 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 10:12:08,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2024-10-24 10:12:08,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 558. [2024-10-24 10:12:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 481 states have (on average 1.4532224532224531) internal successors, (699), 484 states have internal predecessors, (699), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-24 10:12:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 827 transitions. [2024-10-24 10:12:08,915 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 827 transitions. Word has length 167 [2024-10-24 10:12:08,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:12:08,915 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 827 transitions. [2024-10-24 10:12:08,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-10-24 10:12:08,915 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 827 transitions. [2024-10-24 10:12:08,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 10:12:08,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:12:08,918 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:12:08,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 10:12:08,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:12:08,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:12:08,919 INFO L85 PathProgramCache]: Analyzing trace with hash 291696307, now seen corresponding path program 1 times [2024-10-24 10:12:08,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:12:08,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484299573] [2024-10-24 10:12:08,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:12:08,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:12:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 10:12:09,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [738155938] [2024-10-24 10:12:09,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:12:09,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:12:09,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:12:09,071 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-10-24 10:12:09,073 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-10-24 10:12:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:09,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-24 10:12:09,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:12:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 500 proven. 258 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-10-24 10:12:11,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 10:12:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 54 proven. 153 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-10-24 10:12:13,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 10:12:13,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484299573] [2024-10-24 10:12:13,596 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 10:12:13,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738155938] [2024-10-24 10:12:13,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738155938] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 10:12:13,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 10:12:13,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 39 [2024-10-24 10:12:13,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74916306] [2024-10-24 10:12:13,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 10:12:13,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-24 10:12:13,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 10:12:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-24 10:12:13,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1177, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 10:12:13,599 INFO L87 Difference]: Start difference. First operand 558 states and 827 transitions. Second operand has 39 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 37 states have internal predecessors, (108), 10 states have call successors, (50), 6 states have call predecessors, (50), 10 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) [2024-10-24 10:12:36,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:12:36,092 INFO L93 Difference]: Finished difference Result 3197 states and 4537 transitions. [2024-10-24 10:12:36,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-10-24 10:12:36,093 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 37 states have internal predecessors, (108), 10 states have call successors, (50), 6 states have call predecessors, (50), 10 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) Word has length 168 [2024-10-24 10:12:36,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:12:36,110 INFO L225 Difference]: With dead ends: 3197 [2024-10-24 10:12:36,110 INFO L226 Difference]: Without dead ends: 2731 [2024-10-24 10:12:36,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7293 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=4660, Invalid=16802, Unknown=0, NotChecked=0, Total=21462 [2024-10-24 10:12:36,123 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 2768 mSDsluCounter, 1443 mSDsCounter, 0 mSdLazyCounter, 3331 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2771 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 3908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 3331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-10-24 10:12:36,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2771 Valid, 1645 Invalid, 3908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 3331 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-10-24 10:12:36,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2731 states. [2024-10-24 10:12:36,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2731 to 1113. [2024-10-24 10:12:36,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 988 states have (on average 1.438259109311741) internal successors, (1421), 992 states have internal predecessors, (1421), 91 states have call successors, (91), 33 states have call predecessors, (91), 33 states have return successors, (91), 87 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-24 10:12:36,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1603 transitions. [2024-10-24 10:12:36,242 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1603 transitions. Word has length 168 [2024-10-24 10:12:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:12:36,242 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1603 transitions. [2024-10-24 10:12:36,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.8421052631578947) internal successors, (108), 37 states have internal predecessors, (108), 10 states have call successors, (50), 6 states have call predecessors, (50), 10 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) [2024-10-24 10:12:36,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1603 transitions. [2024-10-24 10:12:36,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-24 10:12:36,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:12:36,251 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:12:36,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 10:12:36,451 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,SelfDestructingSolverStorable10 [2024-10-24 10:12:36,452 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:12:36,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:12:36,452 INFO L85 PathProgramCache]: Analyzing trace with hash 583889909, now seen corresponding path program 1 times [2024-10-24 10:12:36,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 10:12:36,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496461634] [2024-10-24 10:12:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:12:36,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 10:12:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 10:12:36,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75357794] [2024-10-24 10:12:36,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:12:36,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:12:36,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:12:36,614 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-10-24 10:12:36,619 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-10-24 10:12:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:12:36,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 10:12:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 10:12:36,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 10:12:36,929 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 10:12:36,929 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 10:12:36,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 10:12:37,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 10:12:37,135 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:12:37,271 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 10:12:37,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:12:37 BoogieIcfgContainer [2024-10-24 10:12:37,273 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 10:12:37,274 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 10:12:37,274 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 10:12:37,274 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 10:12:37,275 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:11:43" (3/4) ... [2024-10-24 10:12:37,276 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 10:12:37,277 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 10:12:37,277 INFO L158 Benchmark]: Toolchain (without parser) took 54882.69ms. Allocated memory was 184.5MB in the beginning and 771.8MB in the end (delta: 587.2MB). Free memory was 114.6MB in the beginning and 714.4MB in the end (delta: -599.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:12:37,277 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 184.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:12:37,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 482.54ms. Allocated memory is still 184.5MB. Free memory was 114.4MB in the beginning and 148.5MB in the end (delta: -34.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 10:12:37,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.14ms. Allocated memory is still 184.5MB. Free memory was 148.5MB in the beginning and 140.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-24 10:12:37,278 INFO L158 Benchmark]: Boogie Preprocessor took 76.00ms. Allocated memory is still 184.5MB. Free memory was 140.1MB in the beginning and 123.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 10:12:37,278 INFO L158 Benchmark]: RCFGBuilder took 676.71ms. Allocated memory is still 184.5MB. Free memory was 123.3MB in the beginning and 77.2MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-24 10:12:37,279 INFO L158 Benchmark]: TraceAbstraction took 53569.38ms. Allocated memory was 184.5MB in the beginning and 771.8MB in the end (delta: 587.2MB). Free memory was 76.9MB in the beginning and 714.4MB in the end (delta: -637.5MB). Peak memory consumption was 391.1MB. Max. memory is 16.1GB. [2024-10-24 10:12:37,279 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 771.8MB. Free memory is still 714.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 10:12:37,280 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.13ms. Allocated memory is still 184.5MB. Free memory is still 141.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 482.54ms. Allocated memory is still 184.5MB. Free memory was 114.4MB in the beginning and 148.5MB in the end (delta: -34.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.14ms. Allocated memory is still 184.5MB. Free memory was 148.5MB in the beginning and 140.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.00ms. Allocated memory is still 184.5MB. Free memory was 140.1MB in the beginning and 123.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 676.71ms. Allocated memory is still 184.5MB. Free memory was 123.3MB in the beginning and 77.2MB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * TraceAbstraction took 53569.38ms. Allocated memory was 184.5MB in the beginning and 771.8MB in the end (delta: 587.2MB). Free memory was 76.9MB in the beginning and 714.4MB in the end (delta: -637.5MB). Peak memory consumption was 391.1MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 771.8MB. Free memory is still 714.4MB. 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 193, overapproximation of someUnaryDOUBLEoperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryArithmeticFLOAToperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -100; [L23] unsigned char var_1_2 = 200; [L24] unsigned char var_1_3 = 100; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_7 = 16; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 0; [L33] unsigned short int var_1_17 = 256; [L34] signed short int var_1_19 = -100; [L35] signed short int var_1_20 = 32; [L36] unsigned char var_1_21 = 1; [L37] signed short int var_1_23 = -256; [L38] float var_1_24 = -0.5; [L39] float var_1_25 = 255.8; [L40] float var_1_26 = 31.2; [L41] float var_1_27 = 0.5; [L42] unsigned char var_1_28 = 32; [L43] unsigned char var_1_29 = 64; [L44] unsigned short int var_1_30 = 16; [L45] double var_1_31 = 255.9; [L46] unsigned short int var_1_33 = 39141; [L47] unsigned short int var_1_34 = 52589; [L48] signed long int last_1_var_1_1 = -100; [L49] unsigned char last_1_var_1_7 = 16; [L50] unsigned short int last_1_var_1_17 = 256; [L51] signed short int last_1_var_1_19 = -100; [L52] signed short int last_1_var_1_20 = 32; [L53] signed short int last_1_var_1_23 = -256; [L54] unsigned char last_1_var_1_28 = 32; [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_7 = var_1_7 [L186] last_1_var_1_17 = var_1_17 [L187] last_1_var_1_19 = var_1_19 [L188] last_1_var_1_20 = var_1_20 [L189] last_1_var_1_23 = var_1_23 [L190] last_1_var_1_28 = var_1_28 [L200] RET updateLastVariables() [L201] CALL updateVariables() [L143] var_1_2 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L144] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L146] var_1_3 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_3 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=8, var_1_7=16, var_1_9=0] [L147] RET assume_abort_if_not(var_1_3 >= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=8, var_1_7=16, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=8, var_1_7=16, var_1_9=0] [L148] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=8, var_1_7=16, var_1_9=0] [L149] var_1_4 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_7=16, var_1_9=0] [L150] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_7=16, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L151] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L152] var_1_12 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L158] var_1_15 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L159] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L160] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L161] var_1_16 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L162] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L163] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L164] var_1_25 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L165] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L166] var_1_26 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L167] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L168] var_1_27 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L169] RET assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L171] RET assume_abort_if_not(var_1_29 >= 64) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L172] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L173] var_1_31 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L174] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L175] CALL assume_abort_if_not(var_1_31 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L175] RET assume_abort_if_not(var_1_31 != 0.0F) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L176] var_1_33 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L177] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L178] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L178] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=52589, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L179] var_1_34 = __VERIFIER_nondet_ushort() [L180] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L180] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L181] CALL assume_abort_if_not(var_1_34 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L181] RET assume_abort_if_not(var_1_34 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L201] RET updateVariables() [L202] CALL step() [L58] COND FALSE !((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) [L67] var_1_1 = var_1_2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L69] unsigned char stepLocal_3 = var_1_4; [L70] signed long int stepLocal_2 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_2=256, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L71] COND FALSE !(stepLocal_2 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) [L78] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L80] unsigned char stepLocal_1 = last_1_var_1_28 < (var_1_3 - var_1_4); [L81] signed long int stepLocal_0 = last_1_var_1_28; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, stepLocal_1=1, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L82] COND TRUE stepLocal_1 || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=16, var_1_9=0] [L83] COND TRUE stepLocal_0 >= var_1_4 [L84] var_1_7 = 2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L91] var_1_24 = (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27)))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L92] COND TRUE ! var_1_12 [L93] var_1_28 = ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=16, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L97] COND TRUE (var_1_24 / var_1_31) > var_1_24 [L98] var_1_30 = (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L100] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L100] COND FALSE !(var_1_1 != (var_1_4 ^ var_1_1)) [L109] unsigned char stepLocal_6 = var_1_9; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_6=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L110] COND TRUE stepLocal_6 || (var_1_28 >= last_1_var_1_20) [L111] var_1_20 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=-256, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L115] unsigned char stepLocal_8 = var_1_28 > var_1_7; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_8=1, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=-256, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L116] COND TRUE stepLocal_8 || var_1_14 [L117] var_1_23 = (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L121] var_1_19 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28))) [L122] unsigned char stepLocal_7 = ((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_7=1, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L123] COND FALSE !(stepLocal_7 && var_1_13) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L128] signed short int stepLocal_5 = var_1_23; [L129] unsigned char stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, stepLocal_5=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L130] COND FALSE !((var_1_28 / (2571661009u - var_1_2)) != stepLocal_5) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L135] COND TRUE \read(var_1_21) [L136] var_1_17 = var_1_7 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L193-L194] return (((((((((((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1)) && ((last_1_var_1_17 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) ? ((var_1_4 >= last_1_var_1_19) ? (var_1_14 == ((unsigned char) var_1_12)) : (var_1_14 == ((unsigned char) (var_1_15 && var_1_16)))) : (var_1_14 == ((unsigned char) var_1_15)))) && (((var_1_28 / (2571661009u - var_1_2)) != var_1_23) ? ((var_1_12 && var_1_21) ? (var_1_17 == ((unsigned short int) 2)) : 1) : (var_1_21 ? (var_1_17 == ((unsigned short int) var_1_7)) : (var_1_17 == ((unsigned short int) var_1_2))))) && (var_1_19 == ((signed short int) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28)))))) && ((var_1_9 || (var_1_28 >= last_1_var_1_20)) ? (var_1_20 == ((signed short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4))) : (var_1_20 == ((signed short int) (var_1_4 - (((((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) < 0 ) ? -((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) : ((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3)))))))))) && (((((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0) && var_1_13) ? (var_1_14 ? (var_1_21 == ((unsigned char) var_1_16)) : 1) : 1)) && (((var_1_28 > var_1_7) || var_1_14) ? (var_1_23 == ((signed short int) (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))))) : (var_1_23 == ((signed short int) (var_1_2 - var_1_28))))) && (var_1_24 == ((float) (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27))))))) && ((! var_1_12) ? (var_1_28 == ((unsigned char) ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4))) : (var_1_28 == ((unsigned char) ((((((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) > (var_1_3)) ? (((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) : (var_1_3))))))) && (((var_1_24 / var_1_31) > var_1_24) ? (var_1_30 == ((unsigned short int) (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4))) : 1) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=-255, var_1_15=-255, var_1_16=-255, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=127, var_1_29=64, var_1_2=127, var_1_30=32767, var_1_33=32767, var_1_34=98303, var_1_3=63, var_1_4=0, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.4s, OverallIterations: 12, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 32.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6836 SdHoareTripleChecker+Valid, 14.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6821 mSDsluCounter, 6963 SdHoareTripleChecker+Invalid, 12.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5416 mSDsCounter, 1224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7319 IncrementalHoareTripleChecker+Invalid, 8543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1224 mSolverCounterUnsat, 1547 mSDtfsCounter, 7319 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1473 GetRequests, 1194 SyntacticMatches, 2 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8592 ImplicationChecksByTransitivity, 21.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1113occurred in iteration=11, InterpolantAutomatonStates: 237, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 4312 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 2499 NumberOfCodeBlocks, 2499 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2316 ConstructedInterpolants, 0 QuantifiedInterpolants, 21081 SizeOfPredicates, 14 NumberOfNonLiveVariables, 818 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 14 InterpolantComputations, 9 PerfectInterpolantSequences, 16203/16800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 10:12:37,500 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-24 10:12:37,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.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 71c7df1fae20fc80c584d7fcd9c77a1cbb9d81b2af2b3bc6d67d6058472b2f60 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 10:12:39,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 10:12:39,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 10:12:39,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 10:12:39,636 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 10:12:39,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 10:12:39,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 10:12:39,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 10:12:39,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 10:12:39,661 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 10:12:39,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 10:12:39,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 10:12:39,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 10:12:39,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 10:12:39,663 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 10:12:39,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 10:12:39,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 10:12:39,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 10:12:39,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 10:12:39,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 10:12:39,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 10:12:39,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 10:12:39,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 10:12:39,669 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 10:12:39,669 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 10:12:39,669 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 10:12:39,669 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 10:12:39,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 10:12:39,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 10:12:39,670 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 10:12:39,670 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 10:12:39,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 10:12:39,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 10:12:39,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 10:12:39,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:12:39,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 10:12:39,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 10:12:39,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 10:12:39,671 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 10:12:39,671 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 10:12:39,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 10:12:39,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 10:12:39,675 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 10:12:39,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 10:12:39,675 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 10:12:39,675 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 -> 71c7df1fae20fc80c584d7fcd9c77a1cbb9d81b2af2b3bc6d67d6058472b2f60 [2024-10-24 10:12:39,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 10:12:39,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 10:12:39,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 10:12:39,967 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 10:12:39,971 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 10:12:39,972 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i [2024-10-24 10:12:41,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 10:12:41,715 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 10:12:41,716 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i [2024-10-24 10:12:41,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21cd3985b/e283c8f1eb3d4332af969e30467a8524/FLAG5e03dec31 [2024-10-24 10:12:42,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21cd3985b/e283c8f1eb3d4332af969e30467a8524 [2024-10-24 10:12:42,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 10:12:42,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 10:12:42,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 10:12:42,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 10:12:42,053 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 10:12:42,054 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,055 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d38c996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42, skipping insertion in model container [2024-10-24 10:12:42,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,077 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 10:12:42,217 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i[916,929] [2024-10-24 10:12:42,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:12:42,313 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 10:12:42,325 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-53.i[916,929] [2024-10-24 10:12:42,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 10:12:42,401 INFO L204 MainTranslator]: Completed translation [2024-10-24 10:12:42,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42 WrapperNode [2024-10-24 10:12:42,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 10:12:42,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 10:12:42,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 10:12:42,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 10:12:42,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,460 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-10-24 10:12:42,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 10:12:42,464 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 10:12:42,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 10:12:42,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 10:12:42,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,497 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 10:12:42,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,513 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,529 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,535 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 10:12:42,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 10:12:42,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 10:12:42,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 10:12:42,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (1/1) ... [2024-10-24 10:12:42,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 10:12:42,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 10:12:42,573 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-10-24 10:12:42,577 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-10-24 10:12:42,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 10:12:42,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 10:12:42,620 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 10:12:42,620 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 10:12:42,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 10:12:42,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 10:12:42,698 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 10:12:42,700 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 10:12:56,250 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-24 10:12:56,250 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 10:12:56,302 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 10:12:56,304 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 10:12:56,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:12:56 BoogieIcfgContainer [2024-10-24 10:12:56,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 10:12:56,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 10:12:56,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 10:12:56,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 10:12:56,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:12:42" (1/3) ... [2024-10-24 10:12:56,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a987152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:12:56, skipping insertion in model container [2024-10-24 10:12:56,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:12:42" (2/3) ... [2024-10-24 10:12:56,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a987152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:12:56, skipping insertion in model container [2024-10-24 10:12:56,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:12:56" (3/3) ... [2024-10-24 10:12:56,315 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-53.i [2024-10-24 10:12:56,327 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 10:12:56,327 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 10:12:56,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 10:12:56,399 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;@4c8a3ce3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 10:12:56,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 10:12:56,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 10:12:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 10:12:56,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:12:56,416 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:12:56,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:12:56,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:12:56,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1696320479, now seen corresponding path program 1 times [2024-10-24 10:12:56,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:12:56,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461060450] [2024-10-24 10:12:56,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:12:56,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:12:56,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:12:56,440 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-10-24 10:12:56,441 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-10-24 10:12:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:12:57,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 10:12:57,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:12:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 624 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2024-10-24 10:12:57,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 10:12:57,263 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 10:12:57,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461060450] [2024-10-24 10:12:57,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461060450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 10:12:57,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 10:12:57,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 10:12:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335716389] [2024-10-24 10:12:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 10:12:57,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 10:12:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 10:12:57,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 10:12:57,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:12:57,290 INFO L87 Difference]: Start difference. First operand has 78 states, 50 states have (on average 1.48) internal successors, (74), 51 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 10:13:01,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.55s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 10:13:01,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 10:13:01,919 INFO L93 Difference]: Finished difference Result 153 states and 271 transitions. [2024-10-24 10:13:02,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 10:13:02,080 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2024-10-24 10:13:02,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 10:13:02,092 INFO L225 Difference]: With dead ends: 153 [2024-10-24 10:13:02,092 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 10:13:02,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 10:13:02,101 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-24 10:13:02,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-24 10:13:02,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 10:13:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-24 10:13:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 10:13:02,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. [2024-10-24 10:13:02,157 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 119 transitions. Word has length 162 [2024-10-24 10:13:02,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 10:13:02,162 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 119 transitions. [2024-10-24 10:13:02,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-24 10:13:02,163 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 119 transitions. [2024-10-24 10:13:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-24 10:13:02,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 10:13:02,172 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 10:13:02,201 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-10-24 10:13:02,374 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-10-24 10:13:02,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 10:13:02,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 10:13:02,375 INFO L85 PathProgramCache]: Analyzing trace with hash 744087015, now seen corresponding path program 1 times [2024-10-24 10:13:02,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 10:13:02,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981222617] [2024-10-24 10:13:02,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 10:13:02,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 10:13:02,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 10:13:02,392 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-10-24 10:13:02,393 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-10-24 10:13:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 10:13:03,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 10:13:03,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 10:13:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 514 proven. 51 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-10-24 10:13:08,110 INFO L311 TraceCheckSpWp]: Computing backward predicates...