./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_steplocals_file-16.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_steplocals_file-16.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 da982387660185d291ba506664c590935ec691dede2a6c22408e1c80bc2337b3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:37:49,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:37:49,830 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:37:49,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:37:49,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:37:49,868 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:37:49,869 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:37:49,870 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:37:49,871 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:37:49,872 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:37:49,872 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:37:49,872 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:37:49,873 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:37:49,873 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:37:49,874 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:37:49,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:37:49,874 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:37:49,875 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:37:49,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:37:49,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:37:49,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:37:49,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:37:49,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:37:49,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:37:49,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:37:49,878 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:37:49,878 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:37:49,878 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:37:49,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:37:49,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:37:49,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:37:49,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:37:49,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:37:49,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:37:49,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:37:49,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:37:49,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:37:49,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:37:49,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:37:49,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:37:49,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:37:49,883 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:37:49,883 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 -> da982387660185d291ba506664c590935ec691dede2a6c22408e1c80bc2337b3 [2024-10-14 07:37:50,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:37:50,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:37:50,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:37:50,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:37:50,165 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:37:50,166 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i [2024-10-14 07:37:51,607 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:37:51,804 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:37:51,808 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i [2024-10-14 07:37:51,822 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd367b0e/d01725a0863e4109852d5fd42d6a7ba6/FLAGee7a500bb [2024-10-14 07:37:52,178 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edd367b0e/d01725a0863e4109852d5fd42d6a7ba6 [2024-10-14 07:37:52,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:37:52,181 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:37:52,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:37:52,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:37:52,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:37:52,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:37:52" (1/1) ... [2024-10-14 07:37:52,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa168a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52, skipping insertion in model container [2024-10-14 07:37:52,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:37:52" (1/1) ... [2024-10-14 07:37:52,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:37:52,373 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_steplocals_file-16.i[917,930] [2024-10-14 07:37:52,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:37:52,445 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:37:52,457 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_steplocals_file-16.i[917,930] [2024-10-14 07:37:52,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:37:52,512 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:37:52,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52 WrapperNode [2024-10-14 07:37:52,513 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:37:52,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:37:52,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:37:52,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:37:52,522 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:37:52" (1/1) ... [2024-10-14 07:37:52,535 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:37:52" (1/1) ... [2024-10-14 07:37:52,587 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2024-10-14 07:37:52,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:37:52,592 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:37:52,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:37:52,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:37:52,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52" (1/1) ... [2024-10-14 07:37:52,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52" (1/1) ... [2024-10-14 07:37:52,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52" (1/1) ... [2024-10-14 07:37:52,644 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:37:52,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52" (1/1) ... [2024-10-14 07:37:52,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52" (1/1) ... [2024-10-14 07:37:52,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52" (1/1) ... [2024-10-14 07:37:52,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52" (1/1) ... [2024-10-14 07:37:52,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52" (1/1) ... [2024-10-14 07:37:52,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52" (1/1) ... [2024-10-14 07:37:52,670 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:37:52,673 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:37:52,674 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:37:52,674 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:37:52,674 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52" (1/1) ... [2024-10-14 07:37:52,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:37:52,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:37:52,704 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:37:52,706 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:37:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:37:52,746 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:37:52,746 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:37:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:37:52,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:37:52,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:37:52,825 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:37:52,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:37:53,248 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-14 07:37:53,248 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:37:53,278 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:37:53,278 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:37:53,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:37:53 BoogieIcfgContainer [2024-10-14 07:37:53,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:37:53,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:37:53,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:37:53,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:37:53,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:37:52" (1/3) ... [2024-10-14 07:37:53,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f86ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:37:53, skipping insertion in model container [2024-10-14 07:37:53,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:37:52" (2/3) ... [2024-10-14 07:37:53,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76f86ce6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:37:53, skipping insertion in model container [2024-10-14 07:37:53,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:37:53" (3/3) ... [2024-10-14 07:37:53,286 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-16.i [2024-10-14 07:37:53,301 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:37:53,301 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:37:53,355 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:37:53,362 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;@273b6792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:37:53,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:37:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:37:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 07:37:53,380 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:37:53,381 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:53,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:37:53,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:37:53,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1379691845, now seen corresponding path program 1 times [2024-10-14 07:37:53,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:37:53,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162375177] [2024-10-14 07:37:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:37:53,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:37:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:37:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:37:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:37:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:37:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:37:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:37:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:37:53,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:37:53,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:37:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:37:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:37:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:37:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:37:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:37:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:37:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:37:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:37:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:37:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:37:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 07:37:53,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:37:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 07:37:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:37:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 07:37:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 07:37:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:37:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:37:53,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:37:53,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162375177] [2024-10-14 07:37:53,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162375177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:37:53,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:37:53,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:37:53,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391107717] [2024-10-14 07:37:53,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:37:53,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:37:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:37:53,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:37:53,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:37:53,912 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:37:53,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:37:53,964 INFO L93 Difference]: Finished difference Result 153 states and 268 transitions. [2024-10-14 07:37:53,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:37:53,967 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-10-14 07:37:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:37:53,974 INFO L225 Difference]: With dead ends: 153 [2024-10-14 07:37:53,974 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 07:37:53,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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:37:53,981 INFO L432 NwaCegarLoop]: 114 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, 114 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:37:53,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:37:53,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 07:37:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-14 07:37:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:37:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 117 transitions. [2024-10-14 07:37:54,030 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 117 transitions. Word has length 165 [2024-10-14 07:37:54,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:37:54,031 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 117 transitions. [2024-10-14 07:37:54,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:37:54,031 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 117 transitions. [2024-10-14 07:37:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 07:37:54,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:37:54,036 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:54,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:37:54,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:37:54,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:37:54,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1000846733, now seen corresponding path program 1 times [2024-10-14 07:37:54,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:37:54,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772584876] [2024-10-14 07:37:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:37:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:37:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:37:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:37:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:37:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:37:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:37:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:37:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:37:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:37:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:37:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:37:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:37:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:37:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:37:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:37:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:37:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:37:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:37:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:37:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:37:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 07:37:57,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:37:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 07:37:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:37:57,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 07:37:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 07:37:57,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:37:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:37:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:37:57,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:37:57,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772584876] [2024-10-14 07:37:57,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772584876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:37:57,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:37:57,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 07:37:57,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087947153] [2024-10-14 07:37:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:37:57,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:37:57,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:37:57,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:37:57,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:37:57,180 INFO L87 Difference]: Start difference. First operand 76 states and 117 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:37:57,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:37:57,543 INFO L93 Difference]: Finished difference Result 205 states and 314 transitions. [2024-10-14 07:37:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:37:57,544 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-14 07:37:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:37:57,549 INFO L225 Difference]: With dead ends: 205 [2024-10-14 07:37:57,550 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 07:37:57,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:37:57,553 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 92 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:37:57,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 417 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 07:37:57,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 07:37:57,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 94. [2024-10-14 07:37:57,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:37:57,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2024-10-14 07:37:57,580 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 165 [2024-10-14 07:37:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:37:57,582 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2024-10-14 07:37:57,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:37:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2024-10-14 07:37:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 07:37:57,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:37:57,588 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:57,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:37:57,588 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:37:57,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:37:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash -2021915087, now seen corresponding path program 1 times [2024-10-14 07:37:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:37:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312461304] [2024-10-14 07:37:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:37:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:37:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:38:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:38:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:38:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:38:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:38:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:38:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:38:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:38:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:38:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:38:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:38:00,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:38:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:38:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:38:00,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:38:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:38:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:38:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:38:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:38:00,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 07:38:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:38:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 07:38:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:38:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 07:38:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 07:38:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:38:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:38:00,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:38:00,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312461304] [2024-10-14 07:38:00,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312461304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:38:00,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:38:00,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 07:38:00,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752466513] [2024-10-14 07:38:00,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:38:00,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 07:38:00,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:38:00,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 07:38:00,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:38:00,132 INFO L87 Difference]: Start difference. First operand 94 states and 146 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:38:00,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:38:00,355 INFO L93 Difference]: Finished difference Result 213 states and 330 transitions. [2024-10-14 07:38:00,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:38:00,355 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-14 07:38:00,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:38:00,358 INFO L225 Difference]: With dead ends: 213 [2024-10-14 07:38:00,360 INFO L226 Difference]: Without dead ends: 120 [2024-10-14 07:38:00,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:38:00,362 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 108 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:38:00,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 336 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:38:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-14 07:38:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 94. [2024-10-14 07:38:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:38:00,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2024-10-14 07:38:00,380 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 165 [2024-10-14 07:38:00,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:38:00,382 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2024-10-14 07:38:00,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:38:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2024-10-14 07:38:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 07:38:00,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:00,389 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:00,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:38:00,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:00,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:00,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1188045802, now seen corresponding path program 1 times [2024-10-14 07:38:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:38:00,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977322626] [2024-10-14 07:38:00,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:00,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:38:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:38:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:38:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:38:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:38:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:38:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:38:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:38:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:38:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:38:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:38:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:38:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:38:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:38:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:38:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:38:00,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:38:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:38:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:38:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:38:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 07:38:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:38:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 07:38:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:38:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 07:38:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 07:38:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:38:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:00,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:38:00,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:38:00,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977322626] [2024-10-14 07:38:00,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977322626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:38:00,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:38:00,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:38:00,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363624626] [2024-10-14 07:38:00,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:38:00,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:38:00,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:38:00,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:38:00,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:38:00,511 INFO L87 Difference]: Start difference. First operand 94 states and 146 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:38:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:38:00,561 INFO L93 Difference]: Finished difference Result 234 states and 360 transitions. [2024-10-14 07:38:00,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:38:00,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-14 07:38:00,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:38:00,563 INFO L225 Difference]: With dead ends: 234 [2024-10-14 07:38:00,564 INFO L226 Difference]: Without dead ends: 141 [2024-10-14 07:38:00,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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:38:00,565 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 39 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:38:00,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 243 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:38:00,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-14 07:38:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2024-10-14 07:38:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 07:38:00,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 210 transitions. [2024-10-14 07:38:00,585 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 210 transitions. Word has length 166 [2024-10-14 07:38:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:38:00,588 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 210 transitions. [2024-10-14 07:38:00,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:38:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 210 transitions. [2024-10-14 07:38:00,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 07:38:00,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:00,593 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:00,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:38:00,594 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:00,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:00,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1130787500, now seen corresponding path program 1 times [2024-10-14 07:38:00,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:38:00,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540244659] [2024-10-14 07:38:00,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:00,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:38:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:38:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:38:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:38:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:38:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:38:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:38:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:38:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:38:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:38:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:38:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:38:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:38:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:38:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:38:05,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:38:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:38:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:38:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:38:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:38:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 07:38:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:38:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 07:38:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:38:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 07:38:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 07:38:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:38:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:05,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:38:05,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:38:05,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540244659] [2024-10-14 07:38:05,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540244659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:38:05,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:38:05,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 07:38:05,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688239459] [2024-10-14 07:38:05,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:38:05,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:38:05,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:38:05,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:38:05,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:38:05,073 INFO L87 Difference]: Start difference. First operand 138 states and 210 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:38:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:38:05,708 INFO L93 Difference]: Finished difference Result 320 states and 482 transitions. [2024-10-14 07:38:05,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:38:05,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-14 07:38:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:38:05,713 INFO L225 Difference]: With dead ends: 320 [2024-10-14 07:38:05,713 INFO L226 Difference]: Without dead ends: 183 [2024-10-14 07:38:05,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:38:05,715 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 86 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 07:38:05,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 444 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 07:38:05,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-14 07:38:05,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2024-10-14 07:38:05,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.4375) internal successors, (161), 113 states have internal predecessors, (161), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 07:38:05,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 221 transitions. [2024-10-14 07:38:05,730 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 221 transitions. Word has length 166 [2024-10-14 07:38:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:38:05,731 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 221 transitions. [2024-10-14 07:38:05,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:38:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 221 transitions. [2024-10-14 07:38:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 07:38:05,733 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:05,734 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:05,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:38:05,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:05,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash 2143111442, now seen corresponding path program 1 times [2024-10-14 07:38:05,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:38:05,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846790922] [2024-10-14 07:38:05,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:05,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:38:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:38:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:38:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:38:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:38:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:38:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:38:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:38:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:38:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:38:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:38:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:38:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:38:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:38:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:38:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:38:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:38:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:38:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:38:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:38:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 07:38:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:38:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 07:38:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:38:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 07:38:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 07:38:06,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:38:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:38:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:38:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846790922] [2024-10-14 07:38:06,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846790922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:38:06,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:38:06,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 07:38:06,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533319110] [2024-10-14 07:38:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:38:06,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:38:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:38:06,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:38:06,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:38:06,203 INFO L87 Difference]: Start difference. First operand 145 states and 221 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:38:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:38:06,433 INFO L93 Difference]: Finished difference Result 327 states and 493 transitions. [2024-10-14 07:38:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 07:38:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-14 07:38:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:38:06,436 INFO L225 Difference]: With dead ends: 327 [2024-10-14 07:38:06,436 INFO L226 Difference]: Without dead ends: 183 [2024-10-14 07:38:06,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-14 07:38:06,437 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 62 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:38:06,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 425 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 07:38:06,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-14 07:38:06,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 138. [2024-10-14 07:38:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 105 states have (on average 1.4285714285714286) internal successors, (150), 106 states have internal predecessors, (150), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 07:38:06,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 210 transitions. [2024-10-14 07:38:06,458 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 210 transitions. Word has length 166 [2024-10-14 07:38:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:38:06,458 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 210 transitions. [2024-10-14 07:38:06,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:38:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 210 transitions. [2024-10-14 07:38:06,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 07:38:06,460 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:06,461 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:06,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 07:38:06,461 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:06,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash 806098904, now seen corresponding path program 1 times [2024-10-14 07:38:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:38:06,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438890684] [2024-10-14 07:38:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:06,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:38:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:38:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:38:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:38:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:38:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:38:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:38:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:38:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:38:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:38:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:38:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:38:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:38:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:38:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:38:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:38:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:38:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:38:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:38:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:38:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 07:38:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:38:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 07:38:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:38:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 07:38:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 07:38:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:38:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:38:07,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:38:07,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438890684] [2024-10-14 07:38:07,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438890684] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:38:07,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:38:07,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 07:38:07,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001346481] [2024-10-14 07:38:07,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:38:07,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:38:07,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:38:07,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:38:07,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:38:07,761 INFO L87 Difference]: Start difference. First operand 138 states and 210 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:38:08,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:38:08,128 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2024-10-14 07:38:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:38:08,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-14 07:38:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:38:08,131 INFO L225 Difference]: With dead ends: 321 [2024-10-14 07:38:08,131 INFO L226 Difference]: Without dead ends: 184 [2024-10-14 07:38:08,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:38:08,133 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 154 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:38:08,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 556 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 07:38:08,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-14 07:38:08,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 142. [2024-10-14 07:38:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 109 states have (on average 1.4128440366972477) internal successors, (154), 110 states have internal predecessors, (154), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 07:38:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 214 transitions. [2024-10-14 07:38:08,146 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 214 transitions. Word has length 166 [2024-10-14 07:38:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:38:08,146 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 214 transitions. [2024-10-14 07:38:08,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:38:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 214 transitions. [2024-10-14 07:38:08,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 07:38:08,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:08,151 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:08,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 07:38:08,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:08,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:08,152 INFO L85 PathProgramCache]: Analyzing trace with hash -214969450, now seen corresponding path program 1 times [2024-10-14 07:38:08,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:38:08,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441553818] [2024-10-14 07:38:08,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:38:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:38:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:38:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:38:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:38:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:38:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:38:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:38:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:38:09,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:38:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:38:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 07:38:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:38:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 07:38:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 07:38:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 07:38:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 07:38:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 07:38:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 07:38:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 07:38:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 07:38:09,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 07:38:09,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 07:38:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 07:38:09,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-14 07:38:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-14 07:38:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-14 07:38:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:38:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:38:09,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441553818] [2024-10-14 07:38:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441553818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:38:09,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:38:09,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 07:38:09,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408337657] [2024-10-14 07:38:09,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:38:09,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 07:38:09,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:38:09,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 07:38:09,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:38:09,083 INFO L87 Difference]: Start difference. First operand 142 states and 214 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:38:09,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:38:09,415 INFO L93 Difference]: Finished difference Result 315 states and 468 transitions. [2024-10-14 07:38:09,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 07:38:09,416 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-14 07:38:09,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:38:09,418 INFO L225 Difference]: With dead ends: 315 [2024-10-14 07:38:09,418 INFO L226 Difference]: Without dead ends: 174 [2024-10-14 07:38:09,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:38:09,419 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 65 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:38:09,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 545 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 07:38:09,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-14 07:38:09,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 126. [2024-10-14 07:38:09,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 93 states have (on average 1.3870967741935485) internal successors, (129), 94 states have internal predecessors, (129), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 07:38:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 189 transitions. [2024-10-14 07:38:09,434 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 189 transitions. Word has length 166 [2024-10-14 07:38:09,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:38:09,435 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 189 transitions. [2024-10-14 07:38:09,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:38:09,435 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 189 transitions. [2024-10-14 07:38:09,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-14 07:38:09,438 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:09,438 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:09,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 07:38:09,439 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:09,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:09,439 INFO L85 PathProgramCache]: Analyzing trace with hash -263012392, now seen corresponding path program 1 times [2024-10-14 07:38:09,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:38:09,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497271330] [2024-10-14 07:38:09,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:09,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:38:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:38:09,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1874631436] [2024-10-14 07:38:09,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:09,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:38:09,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:38:09,499 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:38:09,501 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:38:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:38:09,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:38:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:38:09,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:38:09,956 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:38:09,957 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:38:09,976 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:38:10,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:38:10,162 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:38:10,319 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:38:10,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:38:10 BoogieIcfgContainer [2024-10-14 07:38:10,321 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:38:10,322 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:38:10,322 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:38:10,322 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:38:10,323 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:37:53" (3/4) ... [2024-10-14 07:38:10,324 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:38:10,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:38:10,326 INFO L158 Benchmark]: Toolchain (without parser) took 18144.80ms. Allocated memory was 159.4MB in the beginning and 610.3MB in the end (delta: 450.9MB). Free memory was 103.7MB in the beginning and 567.7MB in the end (delta: -464.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:38:10,326 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory was 119.4MB in the beginning and 119.2MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:38:10,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.29ms. Allocated memory is still 159.4MB. Free memory was 103.7MB in the beginning and 88.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 07:38:10,326 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.09ms. Allocated memory is still 159.4MB. Free memory was 88.0MB in the beginning and 85.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:38:10,327 INFO L158 Benchmark]: Boogie Preprocessor took 80.92ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 81.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:38:10,327 INFO L158 Benchmark]: RCFGBuilder took 605.40ms. Allocated memory is still 159.4MB. Free memory was 81.8MB in the beginning and 116.4MB in the end (delta: -34.6MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-10-14 07:38:10,327 INFO L158 Benchmark]: TraceAbstraction took 17040.96ms. Allocated memory was 159.4MB in the beginning and 610.3MB in the end (delta: 450.9MB). Free memory was 115.6MB in the beginning and 568.7MB in the end (delta: -453.1MB). Peak memory consumption was 358.7MB. Max. memory is 16.1GB. [2024-10-14 07:38:10,328 INFO L158 Benchmark]: Witness Printer took 3.60ms. Allocated memory is still 610.3MB. Free memory was 568.7MB in the beginning and 567.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:38:10,329 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.17ms. Allocated memory is still 159.4MB. Free memory was 119.4MB in the beginning and 119.2MB in the end (delta: 184.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.29ms. Allocated memory is still 159.4MB. Free memory was 103.7MB in the beginning and 88.4MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.09ms. Allocated memory is still 159.4MB. Free memory was 88.0MB in the beginning and 85.2MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.92ms. Allocated memory is still 159.4MB. Free memory was 85.2MB in the beginning and 81.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 605.40ms. Allocated memory is still 159.4MB. Free memory was 81.8MB in the beginning and 116.4MB in the end (delta: -34.6MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17040.96ms. Allocated memory was 159.4MB in the beginning and 610.3MB in the end (delta: 450.9MB). Free memory was 115.6MB in the beginning and 568.7MB in the end (delta: -453.1MB). Peak memory consumption was 358.7MB. Max. memory is 16.1GB. * Witness Printer took 3.60ms. Allocated memory is still 610.3MB. Free memory was 568.7MB in the beginning and 567.7MB 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 someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 139, overapproximation of someUnaryFLOAToperation at line 87, overapproximation of someBinaryArithmeticFLOAToperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -50; [L23] signed short int var_1_2 = 10000; [L24] signed long int var_1_3 = 64; [L25] unsigned char var_1_4 = 0; [L26] signed short int var_1_5 = 8; [L27] signed short int var_1_6 = 64; [L28] unsigned short int var_1_7 = 8; [L29] unsigned short int var_1_8 = 256; [L30] signed long int var_1_9 = 2; [L31] signed long int var_1_10 = 1441729073; [L32] unsigned short int var_1_11 = 32; [L33] double var_1_12 = 7.6; [L34] double var_1_13 = 127.8; [L35] signed char var_1_14 = 32; [L36] signed char var_1_15 = 50; [L37] signed char var_1_16 = 0; [L38] signed char var_1_17 = 16; [L39] float var_1_18 = 0.4; [L40] unsigned char var_1_19 = 0; [L41] float var_1_20 = 24.4; [L42] float var_1_21 = 500.5; [L43] float var_1_22 = 99.324; [L44] unsigned short int var_1_23 = 128; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L94] var_1_2 = __VERIFIER_nondet_short() [L95] CALL assume_abort_if_not(var_1_2 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L95] RET assume_abort_if_not(var_1_2 >= -32768) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L96] CALL assume_abort_if_not(var_1_2 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L96] RET assume_abort_if_not(var_1_2 <= 32767) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=64, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L97] var_1_3 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L98] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L99] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L100] var_1_4 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L101] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L102] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L102] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=8, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L103] var_1_5 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L104] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L105] CALL assume_abort_if_not(var_1_5 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L105] RET assume_abort_if_not(var_1_5 <= 32766) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=64, var_1_7=8, var_1_8=256, var_1_9=2] [L106] var_1_6 = __VERIFIER_nondet_short() [L107] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=256, var_1_9=2] [L107] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=256, var_1_9=2] [L108] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=256, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=256, var_1_9=2] [L108] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=256, var_1_9=2] [L109] var_1_8 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_9=2] [L110] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_9=2] [L111] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L111] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, var_1_10=1441729073, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L112] var_1_10 = __VERIFIER_nondet_long() [L113] CALL assume_abort_if_not(var_1_10 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L113] RET assume_abort_if_not(var_1_10 >= 1073741823) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L114] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L114] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_13=639/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L115] var_1_13 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L116] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=50, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L117] var_1_15 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L118] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L119] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L119] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=0, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L120] var_1_16 = __VERIFIER_nondet_char() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L122] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L122] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=16, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L123] var_1_17 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L124] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L125] CALL assume_abort_if_not(var_1_17 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L125] RET assume_abort_if_not(var_1_17 <= 63) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=0, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L126] var_1_19 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L127] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L128] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L128] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_20=122/5, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L129] var_1_20 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L130] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_21=1001/2, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L131] var_1_21 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L132] RET assume_abort_if_not((var_1_21 >= -230584.3009213691390e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 2305843.009213691390e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_22=24831/250, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L133] var_1_22 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L134] RET assume_abort_if_not((var_1_22 >= -230584.3009213691390e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L147] RET updateVariables() [L148] CALL step() [L48] signed long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=2, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=-50, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L49] COND FALSE !((var_1_2 / -50) >= stepLocal_0) [L56] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L58] signed short int stepLocal_1 = var_1_6; VAL [isInitial=1, stepLocal_1=4, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=8, var_1_8=1, var_1_9=2] [L59] COND TRUE var_1_2 < stepLocal_1 [L60] var_1_7 = (var_1_6 + var_1_8) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L62] COND FALSE !(var_1_6 > 128) VAL [isInitial=1, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L65] signed long int stepLocal_2 = (var_1_7 + var_1_9) * var_1_3; VAL [isInitial=1, stepLocal_2=14, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L66] EXPR var_1_5 | var_1_6 VAL [isInitial=1, stepLocal_2=14, var_1_10=1073741823, var_1_11=32, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L66] COND FALSE !(stepLocal_2 < (var_1_5 | var_1_6)) [L71] var_1_11 = var_1_8 VAL [isInitial=1, var_1_10=1073741823, var_1_11=1, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L73] signed short int stepLocal_4 = var_1_2; [L74] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, stepLocal_3=1, stepLocal_4=1, var_1_10=1073741823, var_1_11=1, var_1_12=38/5, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L75] COND FALSE !(stepLocal_3 < (- var_1_10)) [L80] var_1_12 = var_1_13 VAL [isInitial=1, stepLocal_4=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L82] unsigned short int stepLocal_5 = var_1_8; VAL [isInitial=1, stepLocal_4=1, stepLocal_5=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=32, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L83] COND TRUE var_1_1 <= stepLocal_5 [L84] var_1_14 = ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2) VAL [isInitial=1, stepLocal_4=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=2/5, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L86] COND TRUE var_1_4 || var_1_19 [L87] var_1_18 = ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))) VAL [isInitial=1, stepLocal_4=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=128, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L89] COND TRUE var_1_4 && (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) > var_1_5) [L90] var_1_23 = var_1_6 VAL [isInitial=1, stepLocal_4=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=4, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=4, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L139] EXPR var_1_5 | var_1_6 VAL [isInitial=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=4, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L139] EXPR (((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8))) VAL [isInitial=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=4, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L139-L140] return (((((((((var_1_2 / -50) >= var_1_3) ? (var_1_4 ? (var_1_1 == ((signed short int) (var_1_5 - var_1_6))) : (var_1_1 == ((signed short int) var_1_5))) : (var_1_1 == ((signed short int) var_1_5))) && ((var_1_2 < var_1_6) ? (var_1_7 == ((unsigned short int) (var_1_6 + var_1_8))) : 1)) && ((var_1_6 > 128) ? (var_1_9 == ((signed long int) (var_1_8 - (var_1_10 - var_1_7)))) : 1)) && ((((var_1_7 + var_1_9) * var_1_3) < (var_1_5 | var_1_6)) ? (var_1_4 ? (var_1_11 == ((unsigned short int) var_1_8)) : 1) : (var_1_11 == ((unsigned short int) var_1_8)))) && ((var_1_11 < (- var_1_10)) ? ((var_1_8 <= var_1_2) ? (var_1_12 == ((double) (var_1_13 - 63.75))) : 1) : (var_1_12 == ((double) var_1_13)))) && ((var_1_1 <= var_1_8) ? (var_1_14 == ((signed char) ((((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - var_1_17) + -2))) : 1)) && ((var_1_4 || var_1_19) ? (var_1_18 == ((float) ((((var_1_20 + (var_1_21 + var_1_22)) < 0 ) ? -(var_1_20 + (var_1_21 + var_1_22)) : (var_1_20 + (var_1_21 + var_1_22)))))) : 1)) && ((var_1_4 && (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) > var_1_5)) ? (var_1_23 == ((unsigned short int) var_1_6)) : 1) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=4, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=1073741823, var_1_11=1, var_1_12=2, var_1_13=2, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=0, var_1_18=3, var_1_19=1, var_1_1=0, var_1_23=4, var_1_2=1, var_1_3=2, var_1_4=1, var_1_5=0, var_1_6=4, var_1_7=5, var_1_8=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.8s, OverallIterations: 9, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 606 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 606 mSDsluCounter, 3080 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2110 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1410 IncrementalHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 970 mSDtfsCounter, 1410 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 461 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=5, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 238 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 1659 NumberOfCodeBlocks, 1659 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1317 ConstructedInterpolants, 0 QuantifiedInterpolants, 12782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 10400/10400 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:38:10,389 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_steplocals_file-16.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 da982387660185d291ba506664c590935ec691dede2a6c22408e1c80bc2337b3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:38:12,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:38:12,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:38:12,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:38:12,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:38:12,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:38:12,771 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:38:12,772 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:38:12,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:38:12,773 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:38:12,773 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:38:12,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:38:12,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:38:12,778 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:38:12,778 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:38:12,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:38:12,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:38:12,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:38:12,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:38:12,779 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:38:12,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:38:12,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:38:12,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:38:12,780 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:38:12,780 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:38:12,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:38:12,781 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:38:12,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:38:12,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:38:12,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:38:12,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:38:12,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:38:12,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:38:12,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:38:12,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:38:12,783 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:38:12,786 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:38:12,786 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:38:12,786 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:38:12,786 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:38:12,787 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:38:12,787 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:38:12,787 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:38:12,787 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:38:12,787 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:38:12,788 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 -> da982387660185d291ba506664c590935ec691dede2a6c22408e1c80bc2337b3 [2024-10-14 07:38:13,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:38:13,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:38:13,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:38:13,110 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:38:13,110 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:38:13,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i [2024-10-14 07:38:14,738 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:38:14,966 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:38:14,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-16.i [2024-10-14 07:38:14,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134c32a86/580f3eed78854950a2ecc3c84af5fded/FLAG0710859cc [2024-10-14 07:38:14,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/134c32a86/580f3eed78854950a2ecc3c84af5fded [2024-10-14 07:38:15,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:38:15,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:38:15,006 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:38:15,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:38:15,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:38:15,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:38:15" (1/1) ... [2024-10-14 07:38:15,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@795cb996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15, skipping insertion in model container [2024-10-14 07:38:15,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:38:15" (1/1) ... [2024-10-14 07:38:15,045 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:38:15,214 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_steplocals_file-16.i[917,930] [2024-10-14 07:38:15,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:38:15,313 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:38:15,324 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_steplocals_file-16.i[917,930] [2024-10-14 07:38:15,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:38:15,392 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:38:15,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15 WrapperNode [2024-10-14 07:38:15,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:38:15,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:38:15,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:38:15,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:38:15,400 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:38:15" (1/1) ... [2024-10-14 07:38:15,417 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:38:15" (1/1) ... [2024-10-14 07:38:15,453 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-10-14 07:38:15,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:38:15,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:38:15,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:38:15,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:38:15,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15" (1/1) ... [2024-10-14 07:38:15,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15" (1/1) ... [2024-10-14 07:38:15,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15" (1/1) ... [2024-10-14 07:38:15,491 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:38:15,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15" (1/1) ... [2024-10-14 07:38:15,491 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15" (1/1) ... [2024-10-14 07:38:15,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15" (1/1) ... [2024-10-14 07:38:15,516 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15" (1/1) ... [2024-10-14 07:38:15,519 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15" (1/1) ... [2024-10-14 07:38:15,525 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15" (1/1) ... [2024-10-14 07:38:15,529 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:38:15,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:38:15,534 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:38:15,538 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:38:15,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15" (1/1) ... [2024-10-14 07:38:15,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:38:15,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:38:15,570 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:38:15,572 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:38:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:38:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:38:15,607 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:38:15,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:38:15,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:38:15,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:38:15,692 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:38:15,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:38:17,285 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-14 07:38:17,286 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:38:17,323 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:38:17,323 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:38:17,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:38:17 BoogieIcfgContainer [2024-10-14 07:38:17,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:38:17,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:38:17,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:38:17,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:38:17,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:38:15" (1/3) ... [2024-10-14 07:38:17,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad940ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:38:17, skipping insertion in model container [2024-10-14 07:38:17,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:38:15" (2/3) ... [2024-10-14 07:38:17,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ad940ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:38:17, skipping insertion in model container [2024-10-14 07:38:17,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:38:17" (3/3) ... [2024-10-14 07:38:17,331 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-16.i [2024-10-14 07:38:17,348 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:38:17,348 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:38:17,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:38:17,421 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;@27c06755, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:38:17,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:38:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:38:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 07:38:17,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:17,439 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:17,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:17,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:17,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1591907401, now seen corresponding path program 1 times [2024-10-14 07:38:17,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:38:17,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868727585] [2024-10-14 07:38:17,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:17,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:38:17,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:38:17,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:38:17,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 07:38:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:17,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:38:17,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:38:17,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2024-10-14 07:38:17,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:38:17,920 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:38:17,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868727585] [2024-10-14 07:38:17,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868727585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:38:17,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:38:17,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:38:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882398094] [2024-10-14 07:38:17,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:38:17,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:38:17,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:38:17,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:38:17,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:38:17,958 INFO L87 Difference]: Start difference. First operand has 69 states, 40 states have (on average 1.4) internal successors, (56), 41 states have internal predecessors, (56), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:38:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:38:18,718 INFO L93 Difference]: Finished difference Result 135 states and 240 transitions. [2024-10-14 07:38:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:38:18,736 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2024-10-14 07:38:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:38:18,743 INFO L225 Difference]: With dead ends: 135 [2024-10-14 07:38:18,743 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 07:38:18,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:38:18,751 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 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.7s IncrementalHoareTripleChecker+Time [2024-10-14 07:38:18,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 07:38:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 07:38:18,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-14 07:38:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:38:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 103 transitions. [2024-10-14 07:38:18,813 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 103 transitions. Word has length 162 [2024-10-14 07:38:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:38:18,813 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 103 transitions. [2024-10-14 07:38:18,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:38:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 103 transitions. [2024-10-14 07:38:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 07:38:18,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:38:18,818 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:18,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 07:38:19,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:38:19,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:38:19,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:38:19,020 INFO L85 PathProgramCache]: Analyzing trace with hash -600328303, now seen corresponding path program 1 times [2024-10-14 07:38:19,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:38:19,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [654029079] [2024-10-14 07:38:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:38:19,022 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 07:38:19,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:38:19,024 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 07:38:19,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 07:38:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:38:19,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-14 07:38:19,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:39:08,362 WARN L286 SmtUtils]: Spent 9.14s on a formula simplification that was a NOOP. DAG size: 107 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)