./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_loopvsstraightlinecode_100-while_file-41.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_loopvsstraightlinecode_100-while_file-41.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 cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:24:51,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:24:51,952 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 11:24:51,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:24:51,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:24:51,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:24:51,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:24:51,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:24:51,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:24:51,997 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:24:51,997 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:24:51,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:24:51,998 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:24:51,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:24:52,000 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:24:52,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:24:52,000 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:24:52,000 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:24:52,000 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 11:24:52,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:24:52,001 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:24:52,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:24:52,004 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:24:52,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:24:52,004 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:24:52,004 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:24:52,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:24:52,005 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:24:52,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:24:52,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:24:52,005 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:24:52,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:24:52,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:24:52,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:24:52,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:24:52,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:24:52,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 11:24:52,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 11:24:52,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:24:52,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:24:52,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:24:52,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:24:52,011 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 -> cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498 [2024-10-14 11:24:52,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:24:52,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:24:52,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:24:52,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:24:52,278 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:24:52,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-10-14 11:24:53,657 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 11:24:53,878 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 11:24:53,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-10-14 11:24:53,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90189b848/cf3bb08549ad4d8c9f1bc01bf1168467/FLAG3c0820213 [2024-10-14 11:24:54,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90189b848/cf3bb08549ad4d8c9f1bc01bf1168467 [2024-10-14 11:24:54,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 11:24:54,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 11:24:54,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 11:24:54,242 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 11:24:54,248 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 11:24:54,248 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,249 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@217884ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54, skipping insertion in model container [2024-10-14 11:24:54,249 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,283 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 11:24:54,427 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_loopvsstraightlinecode_100-while_file-41.i[916,929] [2024-10-14 11:24:54,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:24:54,534 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 11:24:54,545 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_loopvsstraightlinecode_100-while_file-41.i[916,929] [2024-10-14 11:24:54,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 11:24:54,638 INFO L204 MainTranslator]: Completed translation [2024-10-14 11:24:54,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54 WrapperNode [2024-10-14 11:24:54,639 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 11:24:54,640 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 11:24:54,641 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 11:24:54,641 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 11:24:54,648 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,676 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,740 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-10-14 11:24:54,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 11:24:54,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 11:24:54,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 11:24:54,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 11:24:54,753 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,763 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,791 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 11:24:54,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,806 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,810 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,814 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 11:24:54,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 11:24:54,829 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 11:24:54,829 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 11:24:54,830 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (1/1) ... [2024-10-14 11:24:54,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:24:54,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:24:54,862 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 11:24:54,865 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 11:24:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 11:24:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 11:24:54,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 11:24:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 11:24:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 11:24:54,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 11:24:55,017 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 11:24:55,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 11:24:55,517 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-14 11:24:55,518 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 11:24:55,564 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 11:24:55,565 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 11:24:55,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:24:55 BoogieIcfgContainer [2024-10-14 11:24:55,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 11:24:55,568 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 11:24:55,568 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 11:24:55,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 11:24:55,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:24:54" (1/3) ... [2024-10-14 11:24:55,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b62526d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:24:55, skipping insertion in model container [2024-10-14 11:24:55,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:24:54" (2/3) ... [2024-10-14 11:24:55,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b62526d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:24:55, skipping insertion in model container [2024-10-14 11:24:55,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:24:55" (3/3) ... [2024-10-14 11:24:55,576 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-41.i [2024-10-14 11:24:55,594 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 11:24:55,594 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 11:24:55,653 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 11:24:55,659 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;@30e8ae7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 11:24:55,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 11:24:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 11:24:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-14 11:24:55,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:24:55,685 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:24:55,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:24:55,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:24:55,691 INFO L85 PathProgramCache]: Analyzing trace with hash -808493932, now seen corresponding path program 1 times [2024-10-14 11:24:55,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:24:55,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275797561] [2024-10-14 11:24:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:24:55,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:24:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:24:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:24:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:24:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:24:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:24:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:24:56,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:24:56,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:24:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:24:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:24:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:24:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:24:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:24:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:24:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:24:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:24:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:24:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:24:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:24:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:24:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:24:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:24:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:24:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:24:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:24:56,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:24:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:24:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:24:56,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:24:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:24:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:24:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:24:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:24:56,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:24:56,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275797561] [2024-10-14 11:24:56,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275797561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:24:56,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:24:56,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:24:56,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359602762] [2024-10-14 11:24:56,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:24:56,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:24:56,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:24:56,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:24:56,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:24:56,770 INFO L87 Difference]: Start difference. First operand has 95 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 11:24:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:24:57,262 INFO L93 Difference]: Finished difference Result 284 states and 527 transitions. [2024-10-14 11:24:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:24:57,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 202 [2024-10-14 11:24:57,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:24:57,277 INFO L225 Difference]: With dead ends: 284 [2024-10-14 11:24:57,277 INFO L226 Difference]: Without dead ends: 190 [2024-10-14 11:24:57,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:24:57,284 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 221 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 11:24:57,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 527 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 11:24:57,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-14 11:24:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 96. [2024-10-14 11:24:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.4193548387096775) internal successors, (88), 62 states have internal predecessors, (88), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-14 11:24:57,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 152 transitions. [2024-10-14 11:24:57,360 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 152 transitions. Word has length 202 [2024-10-14 11:24:57,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:24:57,362 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 152 transitions. [2024-10-14 11:24:57,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-10-14 11:24:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 152 transitions. [2024-10-14 11:24:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-14 11:24:57,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:24:57,367 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:24:57,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 11:24:57,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:24:57,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:24:57,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1617840558, now seen corresponding path program 1 times [2024-10-14 11:24:57,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:24:57,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160109910] [2024-10-14 11:24:57,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:24:57,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:24:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:24:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:24:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:24:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:24:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:24:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:24:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:24:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:24:57,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:24:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:24:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:24:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:24:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:24:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:24:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:24:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:24:57,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:24:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:24:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:24:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:24:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:24:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:24:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:24:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:24:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:24:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:57,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:24:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:58,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:24:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:58,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:24:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:58,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:24:58,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:58,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:24:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:58,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:24:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:58,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:24:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:24:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:24:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:24:58,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160109910] [2024-10-14 11:24:58,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160109910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:24:58,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:24:58,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:24:58,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519222784] [2024-10-14 11:24:58,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:24:58,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:24:58,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:24:58,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:24:58,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:24:58,038 INFO L87 Difference]: Start difference. First operand 96 states and 152 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:24:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:24:58,125 INFO L93 Difference]: Finished difference Result 283 states and 450 transitions. [2024-10-14 11:24:58,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:24:58,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 202 [2024-10-14 11:24:58,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:24:58,129 INFO L225 Difference]: With dead ends: 283 [2024-10-14 11:24:58,132 INFO L226 Difference]: Without dead ends: 188 [2024-10-14 11:24:58,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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 11:24:58,134 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 84 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:24:58,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 280 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:24:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-14 11:24:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2024-10-14 11:24:58,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 118 states have (on average 1.4067796610169492) internal successors, (166), 118 states have internal predecessors, (166), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-14 11:24:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 294 transitions. [2024-10-14 11:24:58,195 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 294 transitions. Word has length 202 [2024-10-14 11:24:58,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:24:58,196 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 294 transitions. [2024-10-14 11:24:58,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:24:58,197 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 294 transitions. [2024-10-14 11:24:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-14 11:24:58,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:24:58,203 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:24:58,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 11:24:58,203 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:24:58,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:24:58,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1118546604, now seen corresponding path program 1 times [2024-10-14 11:24:58,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:24:58,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905405209] [2024-10-14 11:24:58,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:24:58,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:24:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:25:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:25:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:25:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:25:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:25:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:25:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:25:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:25:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:25:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:25:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:25:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:25:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:25:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:25:12,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:25:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:25:12,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:25:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:25:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:25:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:25:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:25:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:25:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:25:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:25:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:25:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:25:12,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:25:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:25:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:25:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:25:12,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:25:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:25:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:25:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:25:12,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905405209] [2024-10-14 11:25:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905405209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:25:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:25:12,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 11:25:12,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047627330] [2024-10-14 11:25:12,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:25:12,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 11:25:12,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:25:12,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 11:25:12,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:25:12,604 INFO L87 Difference]: Start difference. First operand 185 states and 294 transitions. Second operand has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:25:13,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:25:13,943 INFO L93 Difference]: Finished difference Result 625 states and 979 transitions. [2024-10-14 11:25:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 11:25:13,944 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 202 [2024-10-14 11:25:13,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:25:13,949 INFO L225 Difference]: With dead ends: 625 [2024-10-14 11:25:13,949 INFO L226 Difference]: Without dead ends: 441 [2024-10-14 11:25:13,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2024-10-14 11:25:13,951 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 558 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:25:13,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 509 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 11:25:13,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-10-14 11:25:14,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 265. [2024-10-14 11:25:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 184 states have (on average 1.4293478260869565) internal successors, (263), 185 states have internal predecessors, (263), 76 states have call successors, (76), 4 states have call predecessors, (76), 4 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-14 11:25:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 415 transitions. [2024-10-14 11:25:14,026 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 415 transitions. Word has length 202 [2024-10-14 11:25:14,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:25:14,027 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 415 transitions. [2024-10-14 11:25:14,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.090909090909091) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:25:14,027 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 415 transitions. [2024-10-14 11:25:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-14 11:25:14,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:25:14,033 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:25:14,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 11:25:14,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:25:14,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:25:14,034 INFO L85 PathProgramCache]: Analyzing trace with hash -695844778, now seen corresponding path program 1 times [2024-10-14 11:25:14,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:25:14,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364954466] [2024-10-14 11:25:14,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:25:14,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:25:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:25:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:25:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:25:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:25:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:25:14,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:25:14,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:25:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:25:14,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:25:14,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:25:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:25:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:25:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:25:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:25:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:25:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:25:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:25:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:25:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:25:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:25:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:25:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:25:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:25:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:25:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:25:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:25:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:25:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:25:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:25:14,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:25:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:25:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:25:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:25:14,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:25:14,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364954466] [2024-10-14 11:25:14,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364954466] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:25:14,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:25:14,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 11:25:14,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718272971] [2024-10-14 11:25:14,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:25:14,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 11:25:14,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:25:14,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 11:25:14,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 11:25:14,183 INFO L87 Difference]: Start difference. First operand 265 states and 415 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:25:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:25:14,267 INFO L93 Difference]: Finished difference Result 682 states and 1058 transitions. [2024-10-14 11:25:14,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 11:25:14,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 202 [2024-10-14 11:25:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:25:14,273 INFO L225 Difference]: With dead ends: 682 [2024-10-14 11:25:14,274 INFO L226 Difference]: Without dead ends: 436 [2024-10-14 11:25:14,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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 11:25:14,276 INFO L432 NwaCegarLoop]: 268 mSDtfsCounter, 132 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:25:14,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 401 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 11:25:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-14 11:25:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 363. [2024-10-14 11:25:14,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 248 states have (on average 1.3870967741935485) internal successors, (344), 250 states have internal predecessors, (344), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-14 11:25:14,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 560 transitions. [2024-10-14 11:25:14,329 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 560 transitions. Word has length 202 [2024-10-14 11:25:14,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:25:14,329 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 560 transitions. [2024-10-14 11:25:14,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:25:14,330 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 560 transitions. [2024-10-14 11:25:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-14 11:25:14,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:25:14,332 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:25:14,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 11:25:14,332 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:25:14,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:25:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1975708456, now seen corresponding path program 1 times [2024-10-14 11:25:14,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:25:14,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741990459] [2024-10-14 11:25:14,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:25:14,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:25:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:25:14,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:25:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:25:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:25:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:25:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:25:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:25:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:25:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:25:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:25:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:25:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:25:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:25:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:25:14,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:25:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:25:14,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:25:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:25:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:25:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:25:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:25:14,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:25:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:25:14,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:25:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:25:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:25:14,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:25:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:25:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:25:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:25:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:25:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:25:14,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:14,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:25:14,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:25:14,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741990459] [2024-10-14 11:25:14,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741990459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:25:14,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:25:14,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:25:14,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039913132] [2024-10-14 11:25:14,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:25:14,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:25:14,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:25:14,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:25:14,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:25:14,687 INFO L87 Difference]: Start difference. First operand 363 states and 560 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:25:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:25:14,810 INFO L93 Difference]: Finished difference Result 750 states and 1155 transitions. [2024-10-14 11:25:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:25:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 202 [2024-10-14 11:25:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:25:14,816 INFO L225 Difference]: With dead ends: 750 [2024-10-14 11:25:14,816 INFO L226 Difference]: Without dead ends: 406 [2024-10-14 11:25:14,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:25:14,819 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 109 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:25:14,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 373 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:25:14,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-14 11:25:14,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 363. [2024-10-14 11:25:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 248 states have (on average 1.3790322580645162) internal successors, (342), 250 states have internal predecessors, (342), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-14 11:25:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 558 transitions. [2024-10-14 11:25:14,896 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 558 transitions. Word has length 202 [2024-10-14 11:25:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:25:14,899 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 558 transitions. [2024-10-14 11:25:14,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:25:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 558 transitions. [2024-10-14 11:25:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 11:25:14,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:25:14,902 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:25:14,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 11:25:14,902 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:25:14,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:25:14,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1920856111, now seen corresponding path program 1 times [2024-10-14 11:25:14,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:25:14,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634938934] [2024-10-14 11:25:14,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:25:14,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:25:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:25:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:25:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:25:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:25:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:25:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:25:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:25:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:25:15,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:25:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:25:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:25:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:25:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:25:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:25:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:25:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:25:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:25:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:25:15,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:25:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:25:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:25:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:25:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:25:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:25:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:25:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:25:15,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:25:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:25:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:25:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:25:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:25:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:25:15,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:25:15,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:25:15,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634938934] [2024-10-14 11:25:15,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634938934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:25:15,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:25:15,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 11:25:15,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475076454] [2024-10-14 11:25:15,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:25:15,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 11:25:15,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:25:15,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 11:25:15,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:25:15,319 INFO L87 Difference]: Start difference. First operand 363 states and 558 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:25:15,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:25:15,446 INFO L93 Difference]: Finished difference Result 778 states and 1192 transitions. [2024-10-14 11:25:15,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 11:25:15,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-10-14 11:25:15,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:25:15,451 INFO L225 Difference]: With dead ends: 778 [2024-10-14 11:25:15,451 INFO L226 Difference]: Without dead ends: 421 [2024-10-14 11:25:15,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:25:15,453 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 207 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:25:15,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 378 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:25:15,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-14 11:25:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 365. [2024-10-14 11:25:15,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 250 states have (on average 1.368) internal successors, (342), 252 states have internal predecessors, (342), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-14 11:25:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 558 transitions. [2024-10-14 11:25:15,509 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 558 transitions. Word has length 203 [2024-10-14 11:25:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:25:15,509 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 558 transitions. [2024-10-14 11:25:15,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:25:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 558 transitions. [2024-10-14 11:25:15,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 11:25:15,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:25:15,512 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:25:15,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 11:25:15,513 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:25:15,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:25:15,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1771544584, now seen corresponding path program 1 times [2024-10-14 11:25:15,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:25:15,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754553342] [2024-10-14 11:25:15,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:25:15,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:25:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:25:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:25:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:25:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:25:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:25:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:25:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:25:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:25:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:25:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:25:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:25:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:25:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:25:15,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:25:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:25:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:25:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:25:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:25:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:25:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:25:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:25:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:25:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:25:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:25:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:25:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:25:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:25:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:25:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:25:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:25:15,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:25:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:25:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:15,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:25:15,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:25:15,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754553342] [2024-10-14 11:25:15,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754553342] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:25:15,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:25:15,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 11:25:15,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85985817] [2024-10-14 11:25:15,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:25:15,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 11:25:15,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:25:15,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 11:25:15,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 11:25:15,858 INFO L87 Difference]: Start difference. First operand 365 states and 558 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:25:15,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:25:15,984 INFO L93 Difference]: Finished difference Result 583 states and 890 transitions. [2024-10-14 11:25:15,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 11:25:15,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-10-14 11:25:15,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:25:15,988 INFO L225 Difference]: With dead ends: 583 [2024-10-14 11:25:15,988 INFO L226 Difference]: Without dead ends: 439 [2024-10-14 11:25:15,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 11:25:15,990 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 88 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 11:25:15,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 448 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 11:25:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-14 11:25:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 367. [2024-10-14 11:25:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 252 states have (on average 1.3650793650793651) internal successors, (344), 254 states have internal predecessors, (344), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-14 11:25:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 560 transitions. [2024-10-14 11:25:16,036 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 560 transitions. Word has length 203 [2024-10-14 11:25:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:25:16,036 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 560 transitions. [2024-10-14 11:25:16,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:25:16,037 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 560 transitions. [2024-10-14 11:25:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 11:25:16,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:25:16,041 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:25:16,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 11:25:16,041 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:25:16,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:25:16,041 INFO L85 PathProgramCache]: Analyzing trace with hash -22545818, now seen corresponding path program 1 times [2024-10-14 11:25:16,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:25:16,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515932045] [2024-10-14 11:25:16,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:25:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:25:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:25:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:25:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:25:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:25:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:25:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:25:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:25:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:25:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:25:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:25:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:25:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:25:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:25:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:25:38,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:25:38,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:25:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:25:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:25:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:25:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:25:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:25:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:25:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:25:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:25:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:25:38,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:25:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:25:38,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:25:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:25:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:25:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:25:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:25:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:25:38,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:25:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515932045] [2024-10-14 11:25:38,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515932045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:25:38,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:25:38,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 11:25:38,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733761394] [2024-10-14 11:25:38,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:25:38,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 11:25:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:25:38,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 11:25:38,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2024-10-14 11:25:38,447 INFO L87 Difference]: Start difference. First operand 367 states and 560 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:25:40,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:25:40,100 INFO L93 Difference]: Finished difference Result 847 states and 1282 transitions. [2024-10-14 11:25:40,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 11:25:40,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 203 [2024-10-14 11:25:40,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:25:40,105 INFO L225 Difference]: With dead ends: 847 [2024-10-14 11:25:40,106 INFO L226 Difference]: Without dead ends: 499 [2024-10-14 11:25:40,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2024-10-14 11:25:40,107 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 406 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 11:25:40,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 672 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 11:25:40,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-10-14 11:25:40,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 381. [2024-10-14 11:25:40,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 266 states have (on average 1.3834586466165413) internal successors, (368), 268 states have internal predecessors, (368), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-14 11:25:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 584 transitions. [2024-10-14 11:25:40,157 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 584 transitions. Word has length 203 [2024-10-14 11:25:40,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:25:40,157 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 584 transitions. [2024-10-14 11:25:40,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 12 states have internal predecessors, (46), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:25:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 584 transitions. [2024-10-14 11:25:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-10-14 11:25:40,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:25:40,160 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:25:40,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 11:25:40,161 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:25:40,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:25:40,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1498154285, now seen corresponding path program 1 times [2024-10-14 11:25:40,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:25:40,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397203733] [2024-10-14 11:25:40,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:25:40,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:25:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:25:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:25:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:25:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:25:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:25:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:25:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:25:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:25:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:25:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:25:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:25:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:25:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:25:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:25:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:25:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:25:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:25:40,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:25:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:25:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:25:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:25:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:25:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:25:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:25:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:25:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:25:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:25:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:25:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:25:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:25:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:25:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:25:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-14 11:25:40,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:25:40,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397203733] [2024-10-14 11:25:40,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397203733] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:25:40,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080622816] [2024-10-14 11:25:40,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:25:40,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:25:40,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:25:40,509 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 11:25:40,510 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 11:25:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:25:40,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 11:25:40,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:25:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 153 proven. 90 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2024-10-14 11:25:41,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:25:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-14 11:25:41,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080622816] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:25:41,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 11:25:41,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 11:25:41,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775198309] [2024-10-14 11:25:41,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 11:25:41,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:25:41,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:25:41,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:25:41,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:25:41,366 INFO L87 Difference]: Start difference. First operand 381 states and 584 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-10-14 11:25:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:25:41,613 INFO L93 Difference]: Finished difference Result 630 states and 949 transitions. [2024-10-14 11:25:41,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:25:41,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 203 [2024-10-14 11:25:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:25:41,617 INFO L225 Difference]: With dead ends: 630 [2024-10-14 11:25:41,617 INFO L226 Difference]: Without dead ends: 264 [2024-10-14 11:25:41,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 465 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:25:41,621 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 55 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:25:41,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 246 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:25:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-14 11:25:41,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 252. [2024-10-14 11:25:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 168 states have (on average 1.3333333333333333) internal successors, (224), 169 states have internal predecessors, (224), 76 states have call successors, (76), 7 states have call predecessors, (76), 7 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-14 11:25:41,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2024-10-14 11:25:41,655 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 203 [2024-10-14 11:25:41,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:25:41,656 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2024-10-14 11:25:41,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2024-10-14 11:25:41,656 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2024-10-14 11:25:41,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 11:25:41,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:25:41,659 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:25:41,679 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 11:25:41,860 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 11:25:41,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:25:41,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:25:41,861 INFO L85 PathProgramCache]: Analyzing trace with hash -492403328, now seen corresponding path program 1 times [2024-10-14 11:25:41,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:25:41,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369044732] [2024-10-14 11:25:41,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:25:41,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:25:41,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:26:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:26:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:26:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:26:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:26:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:26:05,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:26:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:26:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:26:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:26:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:26:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:26:05,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:26:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:26:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:26:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:26:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:26:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:26:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:26:05,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:26:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:26:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:26:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:26:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:26:05,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:26:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:26:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:26:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:26:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:26:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:26:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:26:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:26:05,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-10-14 11:26:05,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:26:05,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369044732] [2024-10-14 11:26:05,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369044732] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 11:26:05,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 11:26:05,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 11:26:05,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236865083] [2024-10-14 11:26:05,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 11:26:05,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 11:26:05,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:26:05,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 11:26:05,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2024-10-14 11:26:05,369 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:26:06,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:26:06,870 INFO L93 Difference]: Finished difference Result 425 states and 629 transitions. [2024-10-14 11:26:06,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 11:26:06,871 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 204 [2024-10-14 11:26:06,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:26:06,874 INFO L225 Difference]: With dead ends: 425 [2024-10-14 11:26:06,874 INFO L226 Difference]: Without dead ends: 294 [2024-10-14 11:26:06,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2024-10-14 11:26:06,875 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 289 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 11:26:06,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 473 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 11:26:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-14 11:26:06,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 240. [2024-10-14 11:26:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 76 states have call successors, (76), 7 states have call predecessors, (76), 7 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-14 11:26:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 356 transitions. [2024-10-14 11:26:06,908 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 356 transitions. Word has length 204 [2024-10-14 11:26:06,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:26:06,908 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 356 transitions. [2024-10-14 11:26:06,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-10-14 11:26:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 356 transitions. [2024-10-14 11:26:06,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 11:26:06,910 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:26:06,911 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:06,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 11:26:06,911 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:26:06,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:26:06,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1859503399, now seen corresponding path program 1 times [2024-10-14 11:26:06,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:26:06,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201991004] [2024-10-14 11:26:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:26:06,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:26:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 11:26:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 11:26:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 11:26:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 11:26:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 11:26:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 11:26:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 11:26:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 11:26:07,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 11:26:07,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 11:26:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 11:26:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 11:26:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 11:26:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 11:26:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 11:26:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 11:26:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 11:26:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 11:26:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 11:26:07,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 11:26:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 11:26:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 11:26:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 11:26:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 11:26:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-14 11:26:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-14 11:26:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-14 11:26:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-14 11:26:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 11:26:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-14 11:26:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-14 11:26:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-14 11:26:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-14 11:26:07,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 11:26:07,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201991004] [2024-10-14 11:26:07,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201991004] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 11:26:07,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105243708] [2024-10-14 11:26:07,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:26:07,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:26:07,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:26:07,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:26:07,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 11:26:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 11:26:07,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 11:26:07,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 11:26:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1021 proven. 48 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-10-14 11:26:07,559 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 11:26:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-10-14 11:26:07,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105243708] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 11:26:07,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 11:26:07,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 11:26:07,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368488002] [2024-10-14 11:26:07,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 11:26:07,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 11:26:07,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 11:26:07,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 11:26:07,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 11:26:07,783 INFO L87 Difference]: Start difference. First operand 240 states and 356 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-10-14 11:26:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 11:26:08,035 INFO L93 Difference]: Finished difference Result 479 states and 698 transitions. [2024-10-14 11:26:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 11:26:08,036 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 204 [2024-10-14 11:26:08,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 11:26:08,039 INFO L225 Difference]: With dead ends: 479 [2024-10-14 11:26:08,041 INFO L226 Difference]: Without dead ends: 262 [2024-10-14 11:26:08,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 467 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-14 11:26:08,043 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 76 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 11:26:08,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 242 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 11:26:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-14 11:26:08,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 248. [2024-10-14 11:26:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 162 states have (on average 1.2839506172839505) internal successors, (208), 163 states have internal predecessors, (208), 76 states have call successors, (76), 9 states have call predecessors, (76), 9 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2024-10-14 11:26:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 360 transitions. [2024-10-14 11:26:08,080 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 360 transitions. Word has length 204 [2024-10-14 11:26:08,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 11:26:08,080 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 360 transitions. [2024-10-14 11:26:08,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (48), 2 states have call predecessors, (48), 4 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2024-10-14 11:26:08,081 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 360 transitions. [2024-10-14 11:26:08,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-10-14 11:26:08,083 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 11:26:08,083 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:26:08,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 11:26:08,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-14 11:26:08,284 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 11:26:08,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 11:26:08,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1640648681, now seen corresponding path program 1 times [2024-10-14 11:26:08,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 11:26:08,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464615447] [2024-10-14 11:26:08,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:26:08,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 11:26:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 11:26:08,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [968322341] [2024-10-14 11:26:08,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 11:26:08,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:26:08,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 11:26:08,462 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 11:26:08,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 11:26:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:26:08,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 11:26:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 11:26:08,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 11:26:08,818 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 11:26:08,819 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 11:26:08,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 11:26:09,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 11:26:09,024 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 11:26:09,164 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 11:26:09,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:26:09 BoogieIcfgContainer [2024-10-14 11:26:09,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 11:26:09,167 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 11:26:09,167 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 11:26:09,167 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 11:26:09,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:24:55" (3/4) ... [2024-10-14 11:26:09,170 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 11:26:09,171 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 11:26:09,172 INFO L158 Benchmark]: Toolchain (without parser) took 74932.04ms. Allocated memory was 176.2MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 116.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 515.2MB. Max. memory is 16.1GB. [2024-10-14 11:26:09,172 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:26:09,172 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.00ms. Allocated memory is still 176.2MB. Free memory was 116.9MB in the beginning and 99.0MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 11:26:09,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.89ms. Allocated memory is still 176.2MB. Free memory was 99.0MB in the beginning and 93.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:26:09,173 INFO L158 Benchmark]: Boogie Preprocessor took 86.19ms. Allocated memory is still 176.2MB. Free memory was 93.8MB in the beginning and 85.9MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 11:26:09,174 INFO L158 Benchmark]: RCFGBuilder took 737.60ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 85.9MB in the beginning and 182.8MB in the end (delta: -97.0MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-10-14 11:26:09,174 INFO L158 Benchmark]: TraceAbstraction took 73597.98ms. Allocated memory was 234.9MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 181.8MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 521.0MB. Max. memory is 16.1GB. [2024-10-14 11:26:09,174 INFO L158 Benchmark]: Witness Printer took 4.80ms. Allocated memory is still 1.8GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 11:26:09,176 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 176.2MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.00ms. Allocated memory is still 176.2MB. Free memory was 116.9MB in the beginning and 99.0MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.89ms. Allocated memory is still 176.2MB. Free memory was 99.0MB in the beginning and 93.8MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.19ms. Allocated memory is still 176.2MB. Free memory was 93.8MB in the beginning and 85.9MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 737.60ms. Allocated memory was 176.2MB in the beginning and 234.9MB in the end (delta: 58.7MB). Free memory was 85.9MB in the beginning and 182.8MB in the end (delta: -97.0MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * TraceAbstraction took 73597.98ms. Allocated memory was 234.9MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 181.8MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 521.0MB. Max. memory is 16.1GB. * Witness Printer took 4.80ms. Allocated memory is still 1.8GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someBinaryArithmeticFLOAToperation at line 61. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 100000; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_9 = 0; [L25] unsigned char var_1_10 = 1; [L26] signed char var_1_11 = -8; [L27] signed char var_1_12 = -50; [L28] signed char var_1_13 = 25; [L29] signed char var_1_14 = 100; [L30] signed char var_1_15 = 32; [L31] signed char var_1_16 = 25; [L32] signed long int var_1_17 = 50; [L33] signed long int var_1_18 = -32; [L34] signed short int var_1_19 = 256; [L35] unsigned long int var_1_20 = 64; [L36] unsigned char var_1_21 = 1; [L37] unsigned char var_1_22 = 0; [L38] float var_1_23 = 1.4; [L39] float var_1_24 = 3.875; [L40] float var_1_25 = 255.375; [L41] float var_1_26 = 0.65; [L42] float var_1_27 = 64.75; [L43] float var_1_28 = 3.5; [L44] signed long int var_1_29 = 16; [L45] unsigned char var_1_31 = 5; [L46] unsigned char var_1_32 = 128; [L47] unsigned char var_1_33 = 64; [L48] unsigned char var_1_34 = 2; [L49] signed short int var_1_35 = -128; [L50] signed short int var_1_36 = 19851; [L51] signed short int var_1_37 = 28837; [L52] float var_1_38 = 31.2; [L53] float var_1_39 = 127.6; [L54] unsigned long int last_1_var_1_20 = 64; [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L188] last_1_var_1_20 = var_1_20 [L198] RET updateLastVariables() [L199] CALL updateVariables() [L135] var_1_9 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0] [L136] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0] [L137] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L138] var_1_10 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L139] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L140] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=-50, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L141] var_1_12 = __VERIFIER_nondet_char() [L142] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L142] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L143] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=25, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L144] var_1_13 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L145] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L146] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L146] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=100, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L147] var_1_14 = __VERIFIER_nondet_char() [L148] CALL assume_abort_if_not(var_1_14 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L148] RET assume_abort_if_not(var_1_14 >= -127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=32, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L150] var_1_15 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_15 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L151] RET assume_abort_if_not(var_1_15 >= -1) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=25, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L153] var_1_16 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L154] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L156] var_1_22 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L157] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L158] CALL assume_abort_if_not(var_1_22 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_22 <= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_24=31/8, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L159] var_1_24 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L160] RET assume_abort_if_not((var_1_24 >= -230584.3009213691390e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 2305843.009213691390e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_25=2043/8, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L161] var_1_25 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L162] RET assume_abort_if_not((var_1_25 >= -230584.3009213691390e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 2305843.009213691390e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_26=13/20, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L163] var_1_26 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L164] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_27=259/4, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L165] var_1_27 = __VERIFIER_nondet_float() [L166] CALL assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L166] RET assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_28=7/2, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L167] var_1_28 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L168] RET assume_abort_if_not((var_1_28 >= -461168.6018427382800e+13F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 4611686.018427382800e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=128, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L169] var_1_32 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_32 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L170] RET assume_abort_if_not(var_1_32 >= 127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L171] CALL assume_abort_if_not(var_1_32 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L171] RET assume_abort_if_not(var_1_32 <= 254) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=64, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L172] var_1_33 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_33 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L173] RET assume_abort_if_not(var_1_33 >= 63) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L174] CALL assume_abort_if_not(var_1_33 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L174] RET assume_abort_if_not(var_1_33 <= 127) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=2, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L175] var_1_34 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L176] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L177] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L177] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=19851, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L178] var_1_36 = __VERIFIER_nondet_short() [L179] CALL assume_abort_if_not(var_1_36 >= 16382) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L179] RET assume_abort_if_not(var_1_36 >= 16382) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L180] CALL assume_abort_if_not(var_1_36 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L180] RET assume_abort_if_not(var_1_36 <= 32766) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=28837, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L181] var_1_37 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_37 >= 16382) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L182] RET assume_abort_if_not(var_1_37 >= 16382) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L183] CALL assume_abort_if_not(var_1_37 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L183] RET assume_abort_if_not(var_1_37 <= 32766) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_39=638/5, var_1_7=0, var_1_9=0] [L184] var_1_39 = __VERIFIER_nondet_float() [L185] CALL assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L185] RET assume_abort_if_not((var_1_39 >= -461168.6018427382800e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 4611686.018427382800e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=50, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L199] RET updateVariables() [L200] CALL step() [L58] var_1_17 = ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16)))) [L59] var_1_21 = (! (var_1_9 && var_1_22)) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_23=7/5, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L60] COND TRUE \read(var_1_21) [L61] var_1_23 = ((var_1_24 + var_1_25) + ((((var_1_26) < (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (var_1_26) : (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L63] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=156/5, var_1_7=0, var_1_9=0] [L66] COND FALSE !(\read(var_1_9)) [L73] var_1_38 = var_1_25 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=100000, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L75] COND FALSE !((- var_1_23) == var_1_23) [L78] var_1_1 = var_1_31 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L80] unsigned char stepLocal_0 = var_1_17 < var_1_31; VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L81] COND FALSE !((127.35 + var_1_23) <= var_1_23) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=-8, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L88] COND TRUE \read(var_1_21) [L89] var_1_11 = ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=-32, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L93] COND FALSE !(\read(var_1_7)) [L96] var_1_18 = (var_1_15 + var_1_14) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L98] EXPR ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18 VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=64, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L98] COND FALSE !(last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) [L101] var_1_20 = var_1_31 VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=16, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L103] COND FALSE !(\read(var_1_7)) [L106] var_1_29 = ((((((var_1_16 + var_1_15) + -16)) > (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18)))))))) ? (((var_1_16 + var_1_15) + -16)) : (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))))))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L108] unsigned char stepLocal_5 = (var_1_17 / var_1_32) > ((((var_1_31) > (var_1_33)) ? (var_1_31) : (var_1_33))); [L109] signed long int stepLocal_4 = var_1_29; VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_4=5, stepLocal_5=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L110] COND FALSE !(stepLocal_5 && var_1_21) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_4=5, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=-128, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L115] COND TRUE var_1_31 == stepLocal_4 [L116] var_1_35 = ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L121] signed long int stepLocal_3 = var_1_17; [L122] unsigned char stepLocal_2 = var_1_10; [L123] signed short int stepLocal_1 = var_1_35; VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_1=127, stepLocal_2=1, stepLocal_3=4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=256, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L124] COND FALSE !((var_1_15 + var_1_17) == stepLocal_1) [L131] var_1_19 = ((((var_1_13) < (128)) ? (var_1_13) : (128))) VAL [isInitial=1, last_1_var_1_20=64, stepLocal_0=1, stepLocal_2=1, stepLocal_3=4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR ((((((((- var_1_23) == var_1_23) ? (var_1_1 == ((unsigned long int) (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))))) : (var_1_1 == ((unsigned long int) var_1_31))) && (((127.35 + var_1_23) <= var_1_23) ? (((var_1_17 < var_1_31) || var_1_21) ? (var_1_7 == ((unsigned char) (var_1_21 && var_1_9))) : (var_1_7 == ((unsigned char) (! var_1_10)))) : 1)) && (var_1_21 ? (var_1_11 == ((signed char) ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))))) : (var_1_11 == ((signed char) (var_1_15 - var_1_16))))) && (var_1_17 == ((signed long int) ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16))))))) && (var_1_7 ? (var_1_18 == ((signed long int) var_1_14)) : (var_1_18 == ((signed long int) (var_1_15 + var_1_14))))) && (((var_1_15 + var_1_17) == var_1_35) ? ((var_1_21 && var_1_10) ? ((var_1_16 < var_1_17) ? (var_1_19 == ((signed short int) ((var_1_12 + var_1_11) + var_1_15))) : 1) : 1) : (var_1_19 == ((signed short int) ((((var_1_13) < (128)) ? (var_1_13) : (128))))))) && ((last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) ? (var_1_20 == ((unsigned long int) ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))))) : (var_1_20 == ((unsigned long int) var_1_31))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L191] EXPR ((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18 VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L191] EXPR ((((((((- var_1_23) == var_1_23) ? (var_1_1 == ((unsigned long int) (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))))) : (var_1_1 == ((unsigned long int) var_1_31))) && (((127.35 + var_1_23) <= var_1_23) ? (((var_1_17 < var_1_31) || var_1_21) ? (var_1_7 == ((unsigned char) (var_1_21 && var_1_9))) : (var_1_7 == ((unsigned char) (! var_1_10)))) : 1)) && (var_1_21 ? (var_1_11 == ((signed char) ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))))) : (var_1_11 == ((signed char) (var_1_15 - var_1_16))))) && (var_1_17 == ((signed long int) ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16))))))) && (var_1_7 ? (var_1_18 == ((signed long int) var_1_14)) : (var_1_18 == ((signed long int) (var_1_15 + var_1_14))))) && (((var_1_15 + var_1_17) == var_1_35) ? ((var_1_21 && var_1_10) ? ((var_1_16 < var_1_17) ? (var_1_19 == ((signed short int) ((var_1_12 + var_1_11) + var_1_15))) : 1) : 1) : (var_1_19 == ((signed short int) ((((var_1_13) < (128)) ? (var_1_13) : (128))))))) && ((last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) ? (var_1_20 == ((unsigned long int) ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))))) : (var_1_20 == ((unsigned long int) var_1_31))) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L191-L192] return ((((((((((((((- var_1_23) == var_1_23) ? (var_1_1 == ((unsigned long int) (((((var_1_31 + var_1_31)) < (var_1_31)) ? ((var_1_31 + var_1_31)) : (var_1_31))))) : (var_1_1 == ((unsigned long int) var_1_31))) && (((127.35 + var_1_23) <= var_1_23) ? (((var_1_17 < var_1_31) || var_1_21) ? (var_1_7 == ((unsigned char) (var_1_21 && var_1_9))) : (var_1_7 == ((unsigned char) (! var_1_10)))) : 1)) && (var_1_21 ? (var_1_11 == ((signed char) ((((var_1_12) < (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))))) ? (var_1_12) : (((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))))) : (var_1_11 == ((signed char) (var_1_15 - var_1_16))))) && (var_1_17 == ((signed long int) ((((4) < (((1807938565 - 128) - var_1_16))) ? (4) : (((1807938565 - 128) - var_1_16))))))) && (var_1_7 ? (var_1_18 == ((signed long int) var_1_14)) : (var_1_18 == ((signed long int) (var_1_15 + var_1_14))))) && (((var_1_15 + var_1_17) == var_1_35) ? ((var_1_21 && var_1_10) ? ((var_1_16 < var_1_17) ? (var_1_19 == ((signed short int) ((var_1_12 + var_1_11) + var_1_15))) : 1) : 1) : (var_1_19 == ((signed short int) ((((var_1_13) < (128)) ? (var_1_13) : (128))))))) && ((last_1_var_1_20 <= (((((var_1_13) < 0 ) ? -(var_1_13) : (var_1_13))) ^ var_1_18)) ? (var_1_20 == ((unsigned long int) ((((var_1_31) > ((var_1_31 + var_1_16))) ? (var_1_31) : ((var_1_31 + var_1_16)))))) : (var_1_20 == ((unsigned long int) var_1_31)))) && (var_1_21 == ((unsigned char) (! (var_1_9 && var_1_22))))) && (var_1_21 ? (var_1_23 == ((float) ((var_1_24 + var_1_25) + ((((var_1_26) < (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))) ? (var_1_26) : (((((var_1_27) < (var_1_28)) ? (var_1_27) : (var_1_28))))))))) : 1)) && (var_1_7 ? (var_1_29 == ((signed long int) ((1349734853 - var_1_16) - (1715174523 - var_1_31)))) : (var_1_29 == ((signed long int) ((((((var_1_16 + var_1_15) + -16)) > (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18)))))))) ? (((var_1_16 + var_1_15) + -16)) : (((((var_1_14) < (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))) ? (var_1_14) : (((((var_1_31) < (var_1_18)) ? (var_1_31) : (var_1_18))))))))))))) && (var_1_22 ? (var_1_31 == ((unsigned char) ((((var_1_16) < ((var_1_32 - (var_1_33 - var_1_34)))) ? (var_1_16) : ((var_1_32 - (var_1_33 - var_1_34))))))) : 1)) && ((((var_1_17 / var_1_32) > ((((var_1_31) > (var_1_33)) ? (var_1_31) : (var_1_33)))) && var_1_21) ? ((var_1_23 <= 0.125f) ? (var_1_35 == ((signed short int) ((((((var_1_36) < (var_1_37)) ? (var_1_36) : (var_1_37))) - var_1_33) - var_1_16))) : 1) : ((var_1_31 == var_1_29) ? (var_1_35 == ((signed short int) ((((var_1_32) < 0 ) ? -(var_1_32) : (var_1_32))))) : (var_1_35 == ((signed short int) var_1_13))))) && (var_1_9 ? ((var_1_25 == var_1_26) ? (var_1_38 == ((float) (((((var_1_24) < (var_1_39)) ? (var_1_24) : (var_1_39))) + var_1_25))) : (var_1_38 == ((float) var_1_39))) : (var_1_38 == ((float) var_1_25))) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_20=64, var_1_10=1, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=5, var_1_15=1, var_1_16=0, var_1_17=4, var_1_18=6, var_1_19=0, var_1_1=5, var_1_20=5, var_1_21=1, var_1_22=0, var_1_25=2, var_1_29=5, var_1_31=5, var_1_32=127, var_1_33=63, var_1_34=0, var_1_35=127, var_1_36=16382, var_1_37=16382, var_1_38=2, var_1_7=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 73.4s, OverallIterations: 12, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2239 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2225 mSDsluCounter, 4549 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2778 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1888 IncrementalHoareTripleChecker+Invalid, 2036 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 1771 mSDtfsCounter, 1888 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1609 GetRequests, 1538 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381occurred in iteration=8, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 715 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 63.9s InterpolantComputationTime, 3045 NumberOfCodeBlocks, 3045 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3029 ConstructedInterpolants, 0 QuantifiedInterpolants, 24416 SizeOfPredicates, 4 NumberOfNonLiveVariables, 936 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 29346/29760 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 11:26:09,394 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-14 11:26:09,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.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 cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 11:26:11,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 11:26:11,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 11:26:11,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 11:26:11,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 11:26:11,798 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 11:26:11,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 11:26:11,801 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 11:26:11,802 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 11:26:11,803 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 11:26:11,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 11:26:11,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 11:26:11,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 11:26:11,806 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 11:26:11,807 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 11:26:11,807 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 11:26:11,807 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 11:26:11,807 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 11:26:11,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 11:26:11,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 11:26:11,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 11:26:11,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 11:26:11,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 11:26:11,812 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 11:26:11,813 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 11:26:11,813 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 11:26:11,813 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 11:26:11,813 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 11:26:11,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 11:26:11,814 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 11:26:11,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 11:26:11,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 11:26:11,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 11:26:11,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 11:26:11,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 11:26:11,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 11:26:11,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 11:26:11,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 11:26:11,826 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 11:26:11,827 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 11:26:11,828 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 11:26:11,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 11:26:11,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 11:26:11,829 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 11:26:11,829 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 11:26:11,830 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 -> cefce1e082ba19bdab32bd25d6d8c4c5179b384e1b7a368e743da81f29016498 [2024-10-14 11:26:12,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 11:26:12,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 11:26:12,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 11:26:12,170 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 11:26:12,171 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 11:26:12,173 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i