./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_codestructure_dependencies_file-47.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_codestructure_dependencies_file-47.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 a1d88446f30bc8217cd056fccb3507f2be3889c22289753db879810e36a789f9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:18:12,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:18:12,548 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:18:12,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:18:12,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:18:12,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:18:12,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:18:12,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:18:12,577 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:18:12,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:18:12,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:18:12,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:18:12,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:18:12,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:18:12,579 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:18:12,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:18:12,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:18:12,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:18:12,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:18:12,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:18:12,581 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:18:12,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:18:12,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:18:12,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:18:12,582 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:18:12,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:18:12,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:18:12,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:18:12,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:18:12,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:18:12,584 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:18:12,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:18:12,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:18:12,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:18:12,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:18:12,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:18:12,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:18:12,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:18:12,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:18:12,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:18:12,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:18:12,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:18:12,587 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 -> a1d88446f30bc8217cd056fccb3507f2be3889c22289753db879810e36a789f9 [2024-10-14 07:18:12,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:18:12,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:18:12,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:18:12,837 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:18:12,838 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:18:12,839 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-47.i [2024-10-14 07:18:14,203 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:18:14,396 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:18:14,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-47.i [2024-10-14 07:18:14,407 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ecd88452/62688bf6367843f7bc8c4e18bfb7b946/FLAG27aeab112 [2024-10-14 07:18:14,768 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ecd88452/62688bf6367843f7bc8c4e18bfb7b946 [2024-10-14 07:18:14,770 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:18:14,772 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:18:14,772 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:18:14,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:18:14,781 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:18:14,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:18:14" (1/1) ... [2024-10-14 07:18:14,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe6630e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:14, skipping insertion in model container [2024-10-14 07:18:14,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:18:14" (1/1) ... [2024-10-14 07:18:14,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:18:14,941 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_codestructure_dependencies_file-47.i[919,932] [2024-10-14 07:18:15,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:18:15,046 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:18:15,057 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_codestructure_dependencies_file-47.i[919,932] [2024-10-14 07:18:15,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:18:15,097 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:18:15,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15 WrapperNode [2024-10-14 07:18:15,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:18:15,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:18:15,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:18:15,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:18:15,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (1/1) ... [2024-10-14 07:18:15,114 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (1/1) ... [2024-10-14 07:18:15,160 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 200 [2024-10-14 07:18:15,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:18:15,161 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:18:15,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:18:15,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:18:15,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (1/1) ... [2024-10-14 07:18:15,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (1/1) ... [2024-10-14 07:18:15,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (1/1) ... [2024-10-14 07:18:15,194 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-14 07:18:15,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (1/1) ... [2024-10-14 07:18:15,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (1/1) ... [2024-10-14 07:18:15,208 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (1/1) ... [2024-10-14 07:18:15,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (1/1) ... [2024-10-14 07:18:15,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (1/1) ... [2024-10-14 07:18:15,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (1/1) ... [2024-10-14 07:18:15,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:18:15,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:18:15,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:18:15,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:18:15,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (1/1) ... [2024-10-14 07:18:15,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:18:15,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:18:15,262 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-14 07:18:15,265 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-14 07:18:15,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:18:15,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:18:15,314 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:18:15,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:18:15,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:18:15,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:18:15,384 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:18:15,386 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:18:15,755 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 07:18:15,755 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:18:15,777 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:18:15,778 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:18:15,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:18:15 BoogieIcfgContainer [2024-10-14 07:18:15,778 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:18:15,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:18:15,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:18:15,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:18:15,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:18:14" (1/3) ... [2024-10-14 07:18:15,786 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c32bb71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:18:15, skipping insertion in model container [2024-10-14 07:18:15,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:18:15" (2/3) ... [2024-10-14 07:18:15,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c32bb71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:18:15, skipping insertion in model container [2024-10-14 07:18:15,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:18:15" (3/3) ... [2024-10-14 07:18:15,790 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-47.i [2024-10-14 07:18:15,804 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:18:15,805 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:18:15,846 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:18:15,852 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;@4e77e98c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:18:15,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:18:15,855 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 57 states have internal predecessors, (87), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 07:18:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 07:18:15,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:18:15,866 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:18:15,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:18:15,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:18:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -750128791, now seen corresponding path program 1 times [2024-10-14 07:18:15,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:18:15,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782717054] [2024-10-14 07:18:15,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:18:15,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:18:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:18:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:18:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:18:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:18:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:18:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:18:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:18:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:18:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:18:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:18:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:18:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:18:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:18:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:18:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:18:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:18:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:18:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:18:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:18:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:18:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:18:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 07:18:16,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:18:16,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782717054] [2024-10-14 07:18:16,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782717054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:18:16,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:18:16,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:18:16,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7488844] [2024-10-14 07:18:16,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:18:16,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:18:16,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:18:16,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:18:16,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:18:16,328 INFO L87 Difference]: Start difference. First operand has 80 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 57 states have internal predecessors, (87), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 07:18:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:18:16,363 INFO L93 Difference]: Finished difference Result 157 states and 277 transitions. [2024-10-14 07:18:16,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:18:16,366 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 133 [2024-10-14 07:18:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:18:16,372 INFO L225 Difference]: With dead ends: 157 [2024-10-14 07:18:16,372 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 07:18:16,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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-14 07:18:16,377 INFO L432 NwaCegarLoop]: 117 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, 117 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-14 07:18:16,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:18:16,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 07:18:16,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 07:18:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-14 07:18:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2024-10-14 07:18:16,420 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 133 [2024-10-14 07:18:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:18:16,420 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2024-10-14 07:18:16,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-10-14 07:18:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2024-10-14 07:18:16,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 07:18:16,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:18:16,429 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:18:16,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:18:16,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:18:16,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:18:16,431 INFO L85 PathProgramCache]: Analyzing trace with hash -17595744, now seen corresponding path program 1 times [2024-10-14 07:18:16,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:18:16,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747224822] [2024-10-14 07:18:16,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:18:16,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:18:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:18:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:18:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:18:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:18:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:18:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:18:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:18:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:18:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:18:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:18:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:18:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:18:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:18:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:18:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:18:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:18:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:18:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:18:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:18:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:18:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:18:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,072 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 07:18:17,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:18:17,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747224822] [2024-10-14 07:18:17,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747224822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:18:17,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:18:17,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 07:18:17,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127587658] [2024-10-14 07:18:17,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:18:17,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:18:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:18:17,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:18:17,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:18:17,078 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 07:18:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:18:17,409 INFO L93 Difference]: Finished difference Result 340 states and 520 transitions. [2024-10-14 07:18:17,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:18:17,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 134 [2024-10-14 07:18:17,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:18:17,415 INFO L225 Difference]: With dead ends: 340 [2024-10-14 07:18:17,417 INFO L226 Difference]: Without dead ends: 263 [2024-10-14 07:18:17,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:18:17,418 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 283 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:18:17,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 482 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 07:18:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-10-14 07:18:17,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 162. [2024-10-14 07:18:17,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 117 states have internal predecessors, (166), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 07:18:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 250 transitions. [2024-10-14 07:18:17,456 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 250 transitions. Word has length 134 [2024-10-14 07:18:17,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:18:17,457 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 250 transitions. [2024-10-14 07:18:17,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 07:18:17,457 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 250 transitions. [2024-10-14 07:18:17,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 07:18:17,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:18:17,461 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:18:17,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:18:17,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:18:17,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:18:17,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1297459422, now seen corresponding path program 1 times [2024-10-14 07:18:17,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:18:17,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844268328] [2024-10-14 07:18:17,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:18:17,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:18:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:18:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:18:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:18:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:18:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:18:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:18:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:18:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:18:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:18:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:18:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:18:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:18:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:18:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:18:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:18:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:18:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:18:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:18:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:18:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:18:17,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:18:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 07:18:17,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:18:17,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844268328] [2024-10-14 07:18:17,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844268328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:18:17,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:18:17,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:18:17,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219222901] [2024-10-14 07:18:17,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:18:17,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:18:17,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:18:17,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:18:17,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:18:17,708 INFO L87 Difference]: Start difference. First operand 162 states and 250 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 07:18:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:18:17,806 INFO L93 Difference]: Finished difference Result 484 states and 748 transitions. [2024-10-14 07:18:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:18:17,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 134 [2024-10-14 07:18:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:18:17,813 INFO L225 Difference]: With dead ends: 484 [2024-10-14 07:18:17,813 INFO L226 Difference]: Without dead ends: 323 [2024-10-14 07:18:17,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:18:17,815 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 104 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:18:17,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 292 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:18:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-10-14 07:18:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 219. [2024-10-14 07:18:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.396551724137931) internal successors, (243), 174 states have internal predecessors, (243), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 07:18:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 327 transitions. [2024-10-14 07:18:17,854 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 327 transitions. Word has length 134 [2024-10-14 07:18:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:18:17,855 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 327 transitions. [2024-10-14 07:18:17,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 07:18:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 327 transitions. [2024-10-14 07:18:17,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 07:18:17,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:18:17,860 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:18:17,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:18:17,860 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:18:17,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:18:17,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1072208255, now seen corresponding path program 1 times [2024-10-14 07:18:17,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:18:17,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649839980] [2024-10-14 07:18:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:18:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:18:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:18:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:18:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:18:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:18:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:18:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:18:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:18:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:18:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:18:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:18:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:18:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:18:17,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:18:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:18:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:18:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:18:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:18:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:18:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:18:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:18:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:18:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:17,964 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 07:18:17,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:18:17,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649839980] [2024-10-14 07:18:17,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649839980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:18:17,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:18:17,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:18:17,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705031894] [2024-10-14 07:18:17,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:18:17,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:18:17,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:18:17,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:18:17,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:18:17,966 INFO L87 Difference]: Start difference. First operand 219 states and 327 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 07:18:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:18:18,022 INFO L93 Difference]: Finished difference Result 575 states and 859 transitions. [2024-10-14 07:18:18,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:18:18,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-10-14 07:18:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:18:18,025 INFO L225 Difference]: With dead ends: 575 [2024-10-14 07:18:18,027 INFO L226 Difference]: Without dead ends: 357 [2024-10-14 07:18:18,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:18:18,031 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 104 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:18:18,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 260 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:18:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-14 07:18:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 211. [2024-10-14 07:18:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 166 states have (on average 1.3674698795180722) internal successors, (227), 166 states have internal predecessors, (227), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 07:18:18,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2024-10-14 07:18:18,054 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 135 [2024-10-14 07:18:18,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:18:18,054 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2024-10-14 07:18:18,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 07:18:18,055 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2024-10-14 07:18:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-14 07:18:18,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:18:18,059 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:18:18,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:18:18,059 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:18:18,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:18:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 485402241, now seen corresponding path program 1 times [2024-10-14 07:18:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:18:18,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907161471] [2024-10-14 07:18:18,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:18:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:18:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:18:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:18:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:18:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:18:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:18:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:18:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:18:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:18:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:18:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:18:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:18:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:18:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:18:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:18:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:18:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:18:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:18:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:18:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:18:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:18:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:18:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 07:18:18,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:18:18,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907161471] [2024-10-14 07:18:18,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907161471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:18:18,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:18:18,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:18:18,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817043315] [2024-10-14 07:18:18,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:18:18,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:18:18,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:18:18,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:18:18,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:18:18,205 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 07:18:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:18:18,281 INFO L93 Difference]: Finished difference Result 550 states and 816 transitions. [2024-10-14 07:18:18,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:18:18,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 135 [2024-10-14 07:18:18,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:18:18,284 INFO L225 Difference]: With dead ends: 550 [2024-10-14 07:18:18,284 INFO L226 Difference]: Without dead ends: 340 [2024-10-14 07:18:18,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:18:18,285 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 103 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:18:18,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 237 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:18:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-14 07:18:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 184. [2024-10-14 07:18:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 139 states have (on average 1.3093525179856116) internal successors, (182), 139 states have internal predecessors, (182), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 07:18:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 266 transitions. [2024-10-14 07:18:18,304 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 266 transitions. Word has length 135 [2024-10-14 07:18:18,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:18:18,305 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 266 transitions. [2024-10-14 07:18:18,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 07:18:18,305 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 266 transitions. [2024-10-14 07:18:18,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 07:18:18,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:18:18,306 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:18:18,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:18:18,307 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:18:18,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:18:18,307 INFO L85 PathProgramCache]: Analyzing trace with hash 824968831, now seen corresponding path program 1 times [2024-10-14 07:18:18,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:18:18,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457565561] [2024-10-14 07:18:18,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:18:18,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:18:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:18:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:18:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:18:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:18:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:18:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:18:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:18:18,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:18:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:18:18,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:18:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:18:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:18:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:18:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:18:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:18:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:18:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:18:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:18:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:18:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:18:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:18:18,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:18,662 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 07:18:18,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:18:18,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457565561] [2024-10-14 07:18:18,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457565561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:18:18,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:18:18,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:18:18,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435893640] [2024-10-14 07:18:18,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:18:18,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:18:18,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:18:18,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:18:18,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:18:18,665 INFO L87 Difference]: Start difference. First operand 184 states and 266 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 07:18:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:18:18,838 INFO L93 Difference]: Finished difference Result 393 states and 566 transitions. [2024-10-14 07:18:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:18:18,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 136 [2024-10-14 07:18:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:18:18,840 INFO L225 Difference]: With dead ends: 393 [2024-10-14 07:18:18,840 INFO L226 Difference]: Without dead ends: 210 [2024-10-14 07:18:18,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-14 07:18:18,841 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 79 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:18:18,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 317 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:18:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-10-14 07:18:18,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 150. [2024-10-14 07:18:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-14 07:18:18,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 220 transitions. [2024-10-14 07:18:18,873 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 220 transitions. Word has length 136 [2024-10-14 07:18:18,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:18:18,873 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 220 transitions. [2024-10-14 07:18:18,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 07:18:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 220 transitions. [2024-10-14 07:18:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 07:18:18,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:18:18,875 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:18:18,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 07:18:18,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:18:18,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:18:18,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1056082201, now seen corresponding path program 1 times [2024-10-14 07:18:18,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:18:18,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811255203] [2024-10-14 07:18:18,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:18:18,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:18:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:18:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:18:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:18:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:18:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:18:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:18:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:18:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:18:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:18:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:18:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:18:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:18:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:18:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 07:18:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 07:18:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 07:18:19,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 07:18:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 07:18:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 07:18:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 07:18:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 07:18:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 63 proven. 51 refuted. 0 times theorem prover too weak. 726 trivial. 0 not checked. [2024-10-14 07:18:19,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:18:19,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811255203] [2024-10-14 07:18:19,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811255203] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:18:19,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513461930] [2024-10-14 07:18:19,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:18:19,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:18:19,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:18:19,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:18:19,643 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-14 07:18:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:18:19,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 07:18:19,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:18:20,896 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 309 proven. 90 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2024-10-14 07:18:20,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:18:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 114 proven. 57 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2024-10-14 07:18:42,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513461930] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:18:42,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 07:18:42,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 12] total 32 [2024-10-14 07:18:42,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229359640] [2024-10-14 07:18:42,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 07:18:42,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-14 07:18:42,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:18:42,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-14 07:18:42,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=737, Unknown=0, NotChecked=0, Total=992 [2024-10-14 07:18:42,461 INFO L87 Difference]: Start difference. First operand 150 states and 220 transitions. Second operand has 32 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 28 states have internal predecessors, (112), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) [2024-10-14 07:19:00,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:19:34,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 07:19:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:19:34,771 INFO L93 Difference]: Finished difference Result 674 states and 923 transitions. [2024-10-14 07:19:34,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-14 07:19:34,772 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 28 states have internal predecessors, (112), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) Word has length 137 [2024-10-14 07:19:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:19:34,777 INFO L225 Difference]: With dead ends: 674 [2024-10-14 07:19:34,777 INFO L226 Difference]: Without dead ends: 568 [2024-10-14 07:19:34,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2819 ImplicationChecksByTransitivity, 61.5s TimeCoverageRelationStatistics Valid=1881, Invalid=6675, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 07:19:34,781 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 1403 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 533 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1407 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 2205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2024-10-14 07:19:34,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1407 Valid, 967 Invalid, 2205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 1670 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2024-10-14 07:19:34,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2024-10-14 07:19:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 438. [2024-10-14 07:19:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 332 states have (on average 1.2439759036144578) internal successors, (413), 335 states have internal predecessors, (413), 88 states have call successors, (88), 17 states have call predecessors, (88), 17 states have return successors, (88), 85 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-14 07:19:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 589 transitions. [2024-10-14 07:19:34,843 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 589 transitions. Word has length 137 [2024-10-14 07:19:34,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:19:34,843 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 589 transitions. [2024-10-14 07:19:34,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 28 states have internal predecessors, (112), 9 states have call successors, (63), 5 states have call predecessors, (63), 11 states have return successors, (63), 12 states have call predecessors, (63), 9 states have call successors, (63) [2024-10-14 07:19:34,844 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 589 transitions. [2024-10-14 07:19:34,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 07:19:34,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:19:34,845 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:19:34,867 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-14 07:19:35,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:19:35,046 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:19:35,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:19:35,047 INFO L85 PathProgramCache]: Analyzing trace with hash -419619450, now seen corresponding path program 1 times [2024-10-14 07:19:35,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:19:35,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527820945] [2024-10-14 07:19:35,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:19:35,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:19:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:19:35,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1671855940] [2024-10-14 07:19:35,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:19:35,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:19:35,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:19:35,145 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-14 07:19:35,151 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-14 07:19:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:19:35,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 07:19:35,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:19:36,138 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 168 proven. 54 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2024-10-14 07:19:36,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:19:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-10-14 07:19:36,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:19:36,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527820945] [2024-10-14 07:19:36,463 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 07:19:36,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671855940] [2024-10-14 07:19:36,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671855940] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-14 07:19:36,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 07:19:36,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-10-14 07:19:36,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88647575] [2024-10-14 07:19:36,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:19:36,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 07:19:36,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:19:36,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 07:19:36,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-14 07:19:36,465 INFO L87 Difference]: Start difference. First operand 438 states and 589 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 07:19:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:19:36,752 INFO L93 Difference]: Finished difference Result 1045 states and 1391 transitions. [2024-10-14 07:19:36,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 07:19:36,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2024-10-14 07:19:36,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:19:36,757 INFO L225 Difference]: With dead ends: 1045 [2024-10-14 07:19:36,757 INFO L226 Difference]: Without dead ends: 670 [2024-10-14 07:19:36,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-14 07:19:36,759 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 54 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:19:36,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 389 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:19:36,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-14 07:19:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 493. [2024-10-14 07:19:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 384 states have (on average 1.25) internal successors, (480), 388 states have internal predecessors, (480), 90 states have call successors, (90), 18 states have call predecessors, (90), 18 states have return successors, (90), 86 states have call predecessors, (90), 90 states have call successors, (90) [2024-10-14 07:19:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 660 transitions. [2024-10-14 07:19:36,809 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 660 transitions. Word has length 139 [2024-10-14 07:19:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:19:36,809 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 660 transitions. [2024-10-14 07:19:36,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-10-14 07:19:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 660 transitions. [2024-10-14 07:19:36,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-14 07:19:36,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:19:36,811 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 07:19:36,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 07:19:37,015 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,SelfDestructingSolverStorable7 [2024-10-14 07:19:37,016 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:19:37,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:19:37,016 INFO L85 PathProgramCache]: Analyzing trace with hash -362361148, now seen corresponding path program 1 times [2024-10-14 07:19:37,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:19:37,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329592353] [2024-10-14 07:19:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:19:37,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:19:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:19:37,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943529018] [2024-10-14 07:19:37,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:19:37,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:19:37,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:19:37,063 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-14 07:19:37,065 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-14 07:19:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:19:37,425 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:19:37,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:19:37,558 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:19:37,559 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:19:37,560 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:19:37,569 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-14 07:19:37,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:19:37,765 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:19:37,857 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:19:37,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:19:37 BoogieIcfgContainer [2024-10-14 07:19:37,859 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:19:37,860 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:19:37,860 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:19:37,860 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:19:37,860 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:18:15" (3/4) ... [2024-10-14 07:19:37,862 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:19:37,863 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:19:37,863 INFO L158 Benchmark]: Toolchain (without parser) took 83091.90ms. Allocated memory was 153.1MB in the beginning and 237.0MB in the end (delta: 83.9MB). Free memory was 124.0MB in the beginning and 178.0MB in the end (delta: -54.0MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-10-14 07:19:37,864 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:19:37,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.42ms. Allocated memory is still 153.1MB. Free memory was 123.0MB in the beginning and 108.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 07:19:37,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.91ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 103.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:19:37,864 INFO L158 Benchmark]: Boogie Preprocessor took 65.58ms. Allocated memory is still 153.1MB. Free memory was 103.2MB in the beginning and 96.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 07:19:37,864 INFO L158 Benchmark]: RCFGBuilder took 551.14ms. Allocated memory is still 153.1MB. Free memory was 96.9MB in the beginning and 67.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-14 07:19:37,865 INFO L158 Benchmark]: TraceAbstraction took 82077.36ms. Allocated memory was 153.1MB in the beginning and 237.0MB in the end (delta: 83.9MB). Free memory was 67.4MB in the beginning and 179.0MB in the end (delta: -111.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:19:37,865 INFO L158 Benchmark]: Witness Printer took 3.27ms. Allocated memory is still 237.0MB. Free memory was 179.0MB in the beginning and 178.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:19:37,866 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.19ms. Allocated memory is still 113.2MB. Free memory is still 70.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.42ms. Allocated memory is still 153.1MB. Free memory was 123.0MB in the beginning and 108.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.91ms. Allocated memory is still 153.1MB. Free memory was 108.4MB in the beginning and 103.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.58ms. Allocated memory is still 153.1MB. Free memory was 103.2MB in the beginning and 96.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 551.14ms. Allocated memory is still 153.1MB. Free memory was 96.9MB in the beginning and 67.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 82077.36ms. Allocated memory was 153.1MB in the beginning and 237.0MB in the end (delta: 83.9MB). Free memory was 67.4MB in the beginning and 179.0MB in the end (delta: -111.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.27ms. Allocated memory is still 237.0MB. Free memory was 179.0MB in the beginning and 178.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryFLOATComparisonOperation at line 130, overapproximation of bitwiseOr at line 84. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 8; [L23] double var_1_3 = 0.875; [L24] unsigned short int var_1_4 = 49926; [L25] unsigned short int var_1_5 = 500; [L26] unsigned short int var_1_6 = 10; [L27] unsigned char var_1_8 = 64; [L28] unsigned short int var_1_9 = 5; [L29] unsigned char var_1_11 = 10; [L30] float var_1_12 = 0.19999999999999996; [L31] float var_1_13 = 9.2; [L32] float var_1_14 = 5.8; [L33] float var_1_15 = 31.25; [L34] unsigned char var_1_16 = 1; [L35] unsigned char var_1_17 = 0; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned short int var_1_20 = 256; [L39] unsigned short int var_1_21 = 23544; [L40] unsigned long int var_1_22 = 64; [L41] unsigned char last_1_var_1_8 = 64; [L42] unsigned char last_1_var_1_19 = 1; [L43] unsigned short int last_1_var_1_20 = 256; [L44] unsigned long int last_1_var_1_22 = 64; [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L124] last_1_var_1_8 = var_1_8 [L125] last_1_var_1_19 = var_1_19 [L126] last_1_var_1_20 = var_1_20 [L127] last_1_var_1_22 = var_1_22 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L89] var_1_3 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L90] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L91] CALL assume_abort_if_not(var_1_3 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L91] RET assume_abort_if_not(var_1_3 != 0.0F) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=49926, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L92] var_1_4 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_4 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L93] RET assume_abort_if_not(var_1_4 >= 49150) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L94] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L94] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=500, var_1_6=10, var_1_8=64, var_1_9=5] [L95] var_1_5 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_6=10, var_1_8=64, var_1_9=5] [L96] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_6=10, var_1_8=64, var_1_9=5] [L97] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L97] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=10, var_1_8=64, var_1_9=5] [L98] var_1_6 = __VERIFIER_nondet_ushort() [L99] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_8=64, var_1_9=5] [L99] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_8=64, var_1_9=5] [L100] CALL assume_abort_if_not(var_1_6 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=5] [L100] RET assume_abort_if_not(var_1_6 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=5] [L101] var_1_9 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64] [L102] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64] [L103] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L103] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=10, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L104] var_1_11 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L105] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_13=46/5, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L107] var_1_13 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L108] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_14=29/5, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L109] var_1_14 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L110] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_15=125/4, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L111] var_1_15 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L112] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L113] var_1_17 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L114] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L115] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L116] var_1_18 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L117] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=23544, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L119] var_1_21 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_21 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L120] RET assume_abort_if_not(var_1_21 >= 16383) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_21 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_21 <= 32767) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L138] RET updateVariables() [L139] CALL step() [L48] COND TRUE (last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22) [L49] var_1_16 = (last_1_var_1_19 || var_1_17) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L53] COND FALSE !(var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L58] COND TRUE var_1_8 <= var_1_4 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=256, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L59] COND TRUE \read(var_1_16) [L60] var_1_20 = (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L67] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L68] COND FALSE !((var_1_8 * var_1_8) < var_1_11) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=8, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L74] COND FALSE !(var_1_12 >= (1.3 / var_1_3)) [L77] var_1_1 = ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4))) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=64, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L79] COND TRUE \read(var_1_16) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=64, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L80] COND TRUE (var_1_1 < 64) || var_1_16 [L81] var_1_19 = var_1_17 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=64, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L84] EXPR 2 ^ var_1_20 VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=64, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L84] EXPR (((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20)) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=64, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L84] COND FALSE !(var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=64, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L130-L131] return (((((((var_1_12 >= (1.3 / var_1_3)) ? (var_1_1 == ((unsigned short int) ((var_1_4 - var_1_8) - var_1_8))) : (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_4)) ? (var_1_8) : (var_1_4)))))) && ((var_1_5 >= (32796 - ((((var_1_6) < (var_1_9)) ? (var_1_6) : (var_1_9))))) ? (last_1_var_1_19 ? (var_1_8 == ((unsigned char) var_1_11)) : 1) : 1)) && (var_1_16 ? (((var_1_8 * var_1_8) < var_1_11) ? (var_1_12 == ((float) ((((((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) > (var_1_15)) ? (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))) : (var_1_15))))) : 1) : (var_1_12 == ((float) var_1_14)))) && (((last_1_var_1_8 + last_1_var_1_20) > (((((last_1_var_1_8) < 0 ) ? -(last_1_var_1_8) : (last_1_var_1_8))) + last_1_var_1_22)) ? (var_1_16 == ((unsigned char) (last_1_var_1_19 || var_1_17))) : (var_1_16 == ((unsigned char) var_1_18)))) && (var_1_16 ? (((var_1_1 < 64) || var_1_16) ? (var_1_19 == ((unsigned char) var_1_17)) : 1) : 1)) && ((var_1_8 <= var_1_4) ? (var_1_16 ? (var_1_20 == ((unsigned short int) (var_1_4 - ((((var_1_21 - var_1_8) < 0 ) ? -(var_1_21 - var_1_8) : (var_1_21 - var_1_8)))))) : (var_1_20 == ((unsigned short int) 16))) : (var_1_20 == ((unsigned short int) (var_1_4 - var_1_8))))) && ((var_1_1 >= (((((var_1_4 * var_1_8)) > ((2 ^ var_1_20))) ? ((var_1_4 * var_1_8)) : ((2 ^ var_1_20))))) ? (var_1_22 == ((unsigned long int) var_1_1)) : 1) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=64, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_19=1, last_1_var_1_20=256, last_1_var_1_22=64, last_1_var_1_8=64, var_1_11=0, var_1_12=4999999999999999/25000000000000000, var_1_16=1, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=64, var_1_20=16447, var_1_21=32767, var_1_22=64, var_1_4=180222, var_1_5=0, var_1_6=0, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 81.9s, OverallIterations: 9, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 53.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 2134 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2130 mSDsluCounter, 3061 SdHoareTripleChecker+Invalid, 11.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1962 mSDsCounter, 801 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1986 IncrementalHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 801 mSolverCounterUnsat, 1099 mSDtfsCounter, 1986 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 982 GetRequests, 868 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2858 ImplicationChecksByTransitivity, 61.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=493occurred in iteration=8, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 874 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 1637 NumberOfCodeBlocks, 1637 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1485 ConstructedInterpolants, 0 QuantifiedInterpolants, 7710 SizeOfPredicates, 10 NumberOfNonLiveVariables, 634 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 8988/9240 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-14 07:19:37,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_codestructure_dependencies_file-47.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 a1d88446f30bc8217cd056fccb3507f2be3889c22289753db879810e36a789f9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:19:39,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:19:39,832 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:19:39,835 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:19:39,836 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:19:39,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:19:39,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:19:39,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:19:39,859 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:19:39,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:19:39,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:19:39,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:19:39,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:19:39,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:19:39,861 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:19:39,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:19:39,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:19:39,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:19:39,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:19:39,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:19:39,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:19:39,863 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:19:39,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:19:39,863 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:19:39,863 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:19:39,863 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:19:39,864 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:19:39,864 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:19:39,864 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:19:39,864 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:19:39,865 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:19:39,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:19:39,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:19:39,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:19:39,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:19:39,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:19:39,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:19:39,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:19:39,866 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:19:39,866 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:19:39,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:19:39,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:19:39,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:19:39,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:19:39,867 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:19:39,867 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 -> a1d88446f30bc8217cd056fccb3507f2be3889c22289753db879810e36a789f9 [2024-10-14 07:19:40,129 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:19:40,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:19:40,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:19:40,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:19:40,153 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:19:40,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-47.i [2024-10-14 07:19:41,399 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:19:41,588 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:19:41,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-47.i [2024-10-14 07:19:41,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795988c20/842ba64898ae47f7bb03a90102164093/FLAG30f37f5ca [2024-10-14 07:19:41,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/795988c20/842ba64898ae47f7bb03a90102164093 [2024-10-14 07:19:41,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:19:41,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:19:41,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:19:41,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:19:41,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:19:41,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:41,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@849a5b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41, skipping insertion in model container [2024-10-14 07:19:41,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:41,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:19:41,820 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_codestructure_dependencies_file-47.i[919,932] [2024-10-14 07:19:41,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:19:41,906 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:19:41,916 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_codestructure_dependencies_file-47.i[919,932] [2024-10-14 07:19:41,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:19:41,968 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:19:41,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41 WrapperNode [2024-10-14 07:19:41,969 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:19:41,970 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:19:41,970 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:19:41,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:19:41,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:41,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:42,008 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-10-14 07:19:42,009 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:19:42,009 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:19:42,009 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:19:42,010 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:19:42,018 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:42,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:42,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:42,034 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-14 07:19:42,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:42,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:42,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:42,055 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:42,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:42,058 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:42,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:19:42,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:19:42,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:19:42,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:19:42,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:19:41" (1/1) ... [2024-10-14 07:19:42,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:19:42,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:19:42,101 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-14 07:19:42,103 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-14 07:19:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:19:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:19:42,141 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:19:42,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:19:42,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:19:42,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:19:42,212 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:19:42,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation