./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:09:53,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:09:53,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:09:53,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:09:53,735 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:09:53,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:09:53,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:09:53,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:09:53,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:09:53,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:09:53,776 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:09:53,776 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:09:53,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:09:53,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:09:53,778 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:09:53,778 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:09:53,778 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:09:53,779 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:09:53,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:09:53,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:09:53,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:09:53,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:09:53,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:09:53,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:09:53,781 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:09:53,781 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:09:53,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:09:53,782 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:09:53,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:09:53,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:09:53,783 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:09:53,783 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:09:53,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:09:53,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:09:53,788 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:09:53,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:09:53,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:09:53,790 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:09:53,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:09:53,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:09:53,792 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:09:53,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:09:53,793 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-11-12 05:09:54,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:09:54,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:09:54,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:09:54,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:09:54,127 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:09:54,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-12 05:09:55,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:09:55,889 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:09:55,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-12 05:09:55,907 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364436b29/d1eb8383ae4543c5ada1b4c4b0cd3eaf/FLAG7e5867228 [2024-11-12 05:09:55,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/364436b29/d1eb8383ae4543c5ada1b4c4b0cd3eaf [2024-11-12 05:09:55,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:09:55,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:09:55,930 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:09:55,930 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:09:55,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:09:55,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:09:55" (1/1) ... [2024-11-12 05:09:55,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bcc7ad2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:55, skipping insertion in model container [2024-11-12 05:09:55,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:09:55" (1/1) ... [2024-11-12 05:09:55,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:09:56,184 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i[916,929] [2024-11-12 05:09:56,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:09:56,314 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:09:56,325 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i[916,929] [2024-11-12 05:09:56,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:09:56,414 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:09:56,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56 WrapperNode [2024-11-12 05:09:56,414 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:09:56,415 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:09:56,416 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:09:56,416 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:09:56,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (1/1) ... [2024-11-12 05:09:56,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (1/1) ... [2024-11-12 05:09:56,490 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-11-12 05:09:56,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:09:56,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:09:56,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:09:56,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:09:56,504 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (1/1) ... [2024-11-12 05:09:56,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (1/1) ... [2024-11-12 05:09:56,513 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (1/1) ... [2024-11-12 05:09:56,567 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:09:56,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (1/1) ... [2024-11-12 05:09:56,568 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (1/1) ... [2024-11-12 05:09:56,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (1/1) ... [2024-11-12 05:09:56,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (1/1) ... [2024-11-12 05:09:56,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (1/1) ... [2024-11-12 05:09:56,605 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (1/1) ... [2024-11-12 05:09:56,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:09:56,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:09:56,640 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:09:56,640 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:09:56,641 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (1/1) ... [2024-11-12 05:09:56,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:09:56,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:09:56,677 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:09:56,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:09:56,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:09:56,736 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:09:56,737 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:09:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:09:56,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:09:56,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:09:56,838 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:09:56,840 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:09:57,393 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-12 05:09:57,394 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:09:57,413 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:09:57,414 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:09:57,414 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:57 BoogieIcfgContainer [2024-11-12 05:09:57,415 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:09:57,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:09:57,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:09:57,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:09:57,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:09:55" (1/3) ... [2024-11-12 05:09:57,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0d30de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:09:57, skipping insertion in model container [2024-11-12 05:09:57,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:09:56" (2/3) ... [2024-11-12 05:09:57,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0d30de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:09:57, skipping insertion in model container [2024-11-12 05:09:57,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:57" (3/3) ... [2024-11-12 05:09:57,428 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-12 05:09:57,448 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:09:57,449 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:09:57,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:09:57,535 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;@3c98f581, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:09:57,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:09:57,540 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 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-11-12 05:09:57,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-12 05:09:57,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:09:57,559 INFO L218 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, 1, 1] [2024-11-12 05:09:57,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:09:57,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:09:57,566 INFO L85 PathProgramCache]: Analyzing trace with hash 198294688, now seen corresponding path program 1 times [2024-11-12 05:09:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:09:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337740607] [2024-11-12 05:09:57,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:09:57,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:09:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:09:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:09:58,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:09:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:09:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:09:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:09:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:09:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:09:58,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:09:58,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:09:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:09:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:09:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:09:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:09:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:09:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:09:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:09:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:09:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:09:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:09:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:09:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 05:09:58,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:09:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 05:09:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 05:09:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 05:09:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:09:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 05:09:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 05:09:58,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 05:09:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 05:09:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 05:09:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 05:09:58,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:09:58,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337740607] [2024-11-12 05:09:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337740607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:09:58,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:09:58,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:09:58,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580911509] [2024-11-12 05:09:58,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:09:58,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:09:58,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:09:58,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:09:58,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:09:58,741 INFO L87 Difference]: Start difference. First operand has 101 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 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.8) internal successors, (49), 5 states have internal predecessors, (49), 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-11-12 05:09:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:09:59,222 INFO L93 Difference]: Finished difference Result 294 states and 537 transitions. [2024-11-12 05:09:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:09:59,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 206 [2024-11-12 05:09:59,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:09:59,240 INFO L225 Difference]: With dead ends: 294 [2024-11-12 05:09:59,241 INFO L226 Difference]: Without dead ends: 196 [2024-11-12 05:09:59,248 INFO L434 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-11-12 05:09:59,253 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 228 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:09:59,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 547 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:09:59,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-12 05:09:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 100. [2024-11-12 05:09:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.393939393939394) internal successors, (92), 66 states have internal predecessors, (92), 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-11-12 05:09:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 156 transitions. [2024-11-12 05:09:59,342 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 156 transitions. Word has length 206 [2024-11-12 05:09:59,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:09:59,346 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 156 transitions. [2024-11-12 05:09:59,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-11-12 05:09:59,347 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 156 transitions. [2024-11-12 05:09:59,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-12 05:09:59,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:09:59,355 INFO L218 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, 1, 1] [2024-11-12 05:09:59,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:09:59,356 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:09:59,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:09:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash 878353058, now seen corresponding path program 1 times [2024-11-12 05:09:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:09:59,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588586413] [2024-11-12 05:09:59,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:09:59,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:09:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:09:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:09:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:09:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:09:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:09:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:09:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:09:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:09:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:09:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:09:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:09:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:09:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:09:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:09:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:09:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:09:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:09:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:09:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:09:59,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:09:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:09:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 05:09:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:09:59,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:09:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:00,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 05:10:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:00,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 05:10:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:00,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 05:10:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:00,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:10:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:00,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 05:10:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:00,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 05:10:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:00,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 05:10:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:00,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 05:10:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:00,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 05:10:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 05:10:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:10:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588586413] [2024-11-12 05:10:00,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588586413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:10:00,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:10:00,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:10:00,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448063881] [2024-11-12 05:10:00,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:10:00,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:10:00,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:10:00,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:10:00,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:10:00,076 INFO L87 Difference]: Start difference. First operand 100 states and 156 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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-11-12 05:10:00,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:10:00,152 INFO L93 Difference]: Finished difference Result 291 states and 458 transitions. [2024-11-12 05:10:00,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:10:00,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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 206 [2024-11-12 05:10:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:10:00,158 INFO L225 Difference]: With dead ends: 291 [2024-11-12 05:10:00,158 INFO L226 Difference]: Without dead ends: 194 [2024-11-12 05:10:00,160 INFO L434 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-11-12 05:10:00,162 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 85 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:10:00,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 289 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:10:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-12 05:10:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2024-11-12 05:10:00,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 124 states have (on average 1.3870967741935485) internal successors, (172), 124 states have internal predecessors, (172), 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-11-12 05:10:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 300 transitions. [2024-11-12 05:10:00,217 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 300 transitions. Word has length 206 [2024-11-12 05:10:00,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:10:00,218 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 300 transitions. [2024-11-12 05:10:00,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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-11-12 05:10:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2024-11-12 05:10:00,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-12 05:10:00,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:10:00,226 INFO L218 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, 1, 1] [2024-11-12 05:10:00,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:10:00,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:10:00,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:10:00,230 INFO L85 PathProgramCache]: Analyzing trace with hash -823403552, now seen corresponding path program 1 times [2024-11-12 05:10:00,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:10:00,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423701254] [2024-11-12 05:10:00,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:00,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:10:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:10:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:10:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:10:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:10:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:10:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:10:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:10:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:10:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:10:14,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:10:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:10:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:10:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:10:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:10:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:10:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:10:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:10:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:10:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:10:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:10:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:10:14,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 05:10:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:10:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 05:10:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 05:10:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 05:10:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:10:14,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 05:10:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 05:10:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 05:10:14,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 05:10:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 05:10:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:14,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 05:10:14,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:10:14,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423701254] [2024-11-12 05:10:14,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423701254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:10:14,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:10:14,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-12 05:10:14,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787532325] [2024-11-12 05:10:14,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:10:14,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 05:10:14,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:10:14,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 05:10:14,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:10:14,676 INFO L87 Difference]: Start difference. First operand 191 states and 300 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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-11-12 05:10:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:10:15,811 INFO L93 Difference]: Finished difference Result 650 states and 1004 transitions. [2024-11-12 05:10:15,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 05:10:15,812 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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 206 [2024-11-12 05:10:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:10:15,820 INFO L225 Difference]: With dead ends: 650 [2024-11-12 05:10:15,820 INFO L226 Difference]: Without dead ends: 462 [2024-11-12 05:10:15,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2024-11-12 05:10:15,826 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 424 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 05:10:15,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 627 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 05:10:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-12 05:10:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 271. [2024-11-12 05:10:15,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 190 states have (on average 1.4157894736842105) internal successors, (269), 191 states have internal predecessors, (269), 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-11-12 05:10:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 421 transitions. [2024-11-12 05:10:15,900 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 421 transitions. Word has length 206 [2024-11-12 05:10:15,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:10:15,901 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 421 transitions. [2024-11-12 05:10:15,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 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-11-12 05:10:15,902 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 421 transitions. [2024-11-12 05:10:15,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-12 05:10:15,904 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:10:15,904 INFO L218 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, 1, 1] [2024-11-12 05:10:15,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:10:15,905 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:10:15,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:10:15,905 INFO L85 PathProgramCache]: Analyzing trace with hash -604548834, now seen corresponding path program 1 times [2024-11-12 05:10:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:10:15,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234142930] [2024-11-12 05:10:15,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:15,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:10:15,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:15,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:10:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:10:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:10:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:10:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:10:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:10:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:10:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:10:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:10:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:10:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:10:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:10:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:10:16,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:10:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:10:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:10:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:10:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:10:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:10:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:10:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:10:16,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 05:10:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:10:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 05:10:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 05:10:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 05:10:16,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:10:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 05:10:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 05:10:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 05:10:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 05:10:16,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 05:10:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 05:10:16,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:10:16,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234142930] [2024-11-12 05:10:16,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234142930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:10:16,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:10:16,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 05:10:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409125279] [2024-11-12 05:10:16,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:10:16,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 05:10:16,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:10:16,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 05:10:16,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 05:10:16,075 INFO L87 Difference]: Start difference. First operand 271 states and 421 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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-11-12 05:10:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:10:16,150 INFO L93 Difference]: Finished difference Result 695 states and 1071 transitions. [2024-11-12 05:10:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 05:10:16,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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 206 [2024-11-12 05:10:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:10:16,156 INFO L225 Difference]: With dead ends: 695 [2024-11-12 05:10:16,157 INFO L226 Difference]: Without dead ends: 446 [2024-11-12 05:10:16,158 INFO L434 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-11-12 05:10:16,159 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 134 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:10:16,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 414 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:10:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-11-12 05:10:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 371. [2024-11-12 05:10:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 256 states have (on average 1.375) internal successors, (352), 258 states have internal predecessors, (352), 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-11-12 05:10:16,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 568 transitions. [2024-11-12 05:10:16,216 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 568 transitions. Word has length 206 [2024-11-12 05:10:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:10:16,217 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 568 transitions. [2024-11-12 05:10:16,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (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-11-12 05:10:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 568 transitions. [2024-11-12 05:10:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-12 05:10:16,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:10:16,220 INFO L218 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, 1, 1] [2024-11-12 05:10:16,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 05:10:16,220 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:10:16,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:10:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1625617188, now seen corresponding path program 1 times [2024-11-12 05:10:16,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:10:16,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647635012] [2024-11-12 05:10:16,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:16,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:10:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:10:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:10:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:10:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:10:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:10:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:10:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:10:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:10:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:10:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:10:16,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:10:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:10:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:10:16,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:10:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:10:16,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:10:16,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:10:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:10:16,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:10:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:10:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:10:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 05:10:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:10:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 05:10:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 05:10:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 05:10:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:10:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 05:10:16,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 05:10:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 05:10:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 05:10:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 05:10:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 05:10:16,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:10:16,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647635012] [2024-11-12 05:10:16,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647635012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:10:16,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:10:16,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:10:16,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083631127] [2024-11-12 05:10:16,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:10:16,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:10:16,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:10:16,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:10:16,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:10:16,621 INFO L87 Difference]: Start difference. First operand 371 states and 568 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-11-12 05:10:16,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:10:16,734 INFO L93 Difference]: Finished difference Result 770 states and 1176 transitions. [2024-11-12 05:10:16,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:10:16,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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 206 [2024-11-12 05:10:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:10:16,738 INFO L225 Difference]: With dead ends: 770 [2024-11-12 05:10:16,738 INFO L226 Difference]: Without dead ends: 421 [2024-11-12 05:10:16,740 INFO L434 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-11-12 05:10:16,741 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 115 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:10:16,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 385 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:10:16,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-12 05:10:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 371. [2024-11-12 05:10:16,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 256 states have (on average 1.3671875) internal successors, (350), 258 states have internal predecessors, (350), 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-11-12 05:10:16,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 566 transitions. [2024-11-12 05:10:16,791 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 566 transitions. Word has length 206 [2024-11-12 05:10:16,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:10:16,791 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 566 transitions. [2024-11-12 05:10:16,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 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-11-12 05:10:16,792 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 566 transitions. [2024-11-12 05:10:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-12 05:10:16,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:10:16,794 INFO L218 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, 1, 1, 1] [2024-11-12 05:10:16,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 05:10:16,795 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:10:16,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:10:16,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2093744881, now seen corresponding path program 1 times [2024-11-12 05:10:16,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:10:16,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982119927] [2024-11-12 05:10:16,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:16,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:10:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:10:17,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:10:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:10:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:10:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:10:17,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:10:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:10:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:10:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:10:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:10:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:10:17,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:10:17,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:10:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:10:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:10:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:10:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:10:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:10:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:10:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:10:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:10:17,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 05:10:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:10:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 05:10:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 05:10:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 05:10:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:10:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 05:10:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 05:10:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 05:10:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 05:10:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 05:10:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 05:10:17,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:10:17,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982119927] [2024-11-12 05:10:17,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982119927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:10:17,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:10:17,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 05:10:17,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476847870] [2024-11-12 05:10:17,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:10:17,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 05:10:17,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:10:17,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 05:10:17,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-12 05:10:17,302 INFO L87 Difference]: Start difference. First operand 371 states and 566 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-11-12 05:10:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:10:17,413 INFO L93 Difference]: Finished difference Result 800 states and 1215 transitions. [2024-11-12 05:10:17,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 05:10:17,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 207 [2024-11-12 05:10:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:10:17,418 INFO L225 Difference]: With dead ends: 800 [2024-11-12 05:10:17,419 INFO L226 Difference]: Without dead ends: 438 [2024-11-12 05:10:17,420 INFO L434 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-11-12 05:10:17,421 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 332 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:10:17,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 306 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:10:17,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2024-11-12 05:10:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 373. [2024-11-12 05:10:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 258 states have (on average 1.3565891472868217) internal successors, (350), 260 states have internal predecessors, (350), 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-11-12 05:10:17,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 566 transitions. [2024-11-12 05:10:17,467 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 566 transitions. Word has length 207 [2024-11-12 05:10:17,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:10:17,468 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 566 transitions. [2024-11-12 05:10:17,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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-11-12 05:10:17,469 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 566 transitions. [2024-11-12 05:10:17,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-12 05:10:17,471 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:10:17,471 INFO L218 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, 1, 1, 1] [2024-11-12 05:10:17,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 05:10:17,472 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:10:17,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:10:17,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1867532374, now seen corresponding path program 1 times [2024-11-12 05:10:17,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:10:17,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139742926] [2024-11-12 05:10:17,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:17,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:10:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:10:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:10:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:10:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:10:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:10:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:10:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:10:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:10:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:10:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:10:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:10:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:10:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:10:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:10:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:10:17,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:10:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:10:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:10:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:10:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:10:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:10:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 05:10:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:10:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 05:10:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 05:10:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 05:10:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:10:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 05:10:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 05:10:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 05:10:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 05:10:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 05:10:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 05:10:17,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:10:17,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139742926] [2024-11-12 05:10:17,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139742926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:10:17,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:10:17,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 05:10:17,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959986545] [2024-11-12 05:10:17,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:10:17,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 05:10:17,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:10:17,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 05:10:17,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 05:10:17,969 INFO L87 Difference]: Start difference. First operand 373 states and 566 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (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-11-12 05:10:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:10:18,064 INFO L93 Difference]: Finished difference Result 597 states and 905 transitions. [2024-11-12 05:10:18,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 05:10:18,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (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 207 [2024-11-12 05:10:18,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:10:18,068 INFO L225 Difference]: With dead ends: 597 [2024-11-12 05:10:18,069 INFO L226 Difference]: Without dead ends: 452 [2024-11-12 05:10:18,070 INFO L434 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-11-12 05:10:18,071 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 104 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:10:18,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 453 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 05:10:18,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-12 05:10:18,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 382. [2024-11-12 05:10:18,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 267 states have (on average 1.3595505617977528) internal successors, (363), 269 states have internal predecessors, (363), 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-11-12 05:10:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 579 transitions. [2024-11-12 05:10:18,117 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 579 transitions. Word has length 207 [2024-11-12 05:10:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:10:18,118 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 579 transitions. [2024-11-12 05:10:18,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (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-11-12 05:10:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 579 transitions. [2024-11-12 05:10:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-12 05:10:18,121 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:10:18,121 INFO L218 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, 1, 1, 1] [2024-11-12 05:10:18,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 05:10:18,121 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:10:18,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:10:18,122 INFO L85 PathProgramCache]: Analyzing trace with hash 725678312, now seen corresponding path program 1 times [2024-11-12 05:10:18,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:10:18,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218722066] [2024-11-12 05:10:18,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:18,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:10:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:10:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:10:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:10:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:10:28,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:10:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:10:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:10:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:10:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:10:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:10:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:10:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:10:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:10:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:10:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:10:28,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:10:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:10:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:10:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:10:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:10:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:10:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 05:10:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:10:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 05:10:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 05:10:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 05:10:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:10:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 05:10:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 05:10:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 05:10:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 05:10:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 05:10:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 05:10:28,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:10:28,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218722066] [2024-11-12 05:10:28,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218722066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:10:28,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:10:28,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 05:10:28,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617625014] [2024-11-12 05:10:28,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:10:28,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 05:10:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:10:28,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 05:10:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2024-11-12 05:10:28,348 INFO L87 Difference]: Start difference. First operand 382 states and 579 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-11-12 05:10:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:10:29,728 INFO L93 Difference]: Finished difference Result 670 states and 1003 transitions. [2024-11-12 05:10:29,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 05:10:29,729 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 207 [2024-11-12 05:10:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:10:29,733 INFO L225 Difference]: With dead ends: 670 [2024-11-12 05:10:29,733 INFO L226 Difference]: Without dead ends: 516 [2024-11-12 05:10:29,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2024-11-12 05:10:29,735 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 329 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 05:10:29,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 759 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 05:10:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-12 05:10:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 376. [2024-11-12 05:10:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 261 states have (on average 1.3524904214559388) internal successors, (353), 263 states have internal predecessors, (353), 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-11-12 05:10:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 569 transitions. [2024-11-12 05:10:29,795 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 569 transitions. Word has length 207 [2024-11-12 05:10:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:10:29,798 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 569 transitions. [2024-11-12 05:10:29,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-11-12 05:10:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 569 transitions. [2024-11-12 05:10:29,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-12 05:10:29,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:10:29,802 INFO L218 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, 1, 1, 1] [2024-11-12 05:10:29,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 05:10:29,803 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:10:29,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:10:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash 811821820, now seen corresponding path program 1 times [2024-11-12 05:10:29,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:10:29,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349030728] [2024-11-12 05:10:29,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:29,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:10:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:10:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:10:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:10:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:10:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:10:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:10:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:10:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:10:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:10:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:10:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:10:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:10:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:10:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:10:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:10:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:10:48,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:10:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:10:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:10:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:10:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:10:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 05:10:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:10:48,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 05:10:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 05:10:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 05:10:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:10:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 05:10:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 05:10:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 05:10:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 05:10:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 05:10:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:48,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-12 05:10:48,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:10:48,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349030728] [2024-11-12 05:10:48,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349030728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:10:48,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:10:48,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-12 05:10:48,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469820533] [2024-11-12 05:10:48,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:10:48,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 05:10:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:10:48,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 05:10:48,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2024-11-12 05:10:48,905 INFO L87 Difference]: Start difference. First operand 376 states and 569 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-11-12 05:10:50,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:10:50,301 INFO L93 Difference]: Finished difference Result 860 states and 1287 transitions. [2024-11-12 05:10:50,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 05:10:50,302 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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 207 [2024-11-12 05:10:50,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:10:50,306 INFO L225 Difference]: With dead ends: 860 [2024-11-12 05:10:50,306 INFO L226 Difference]: Without dead ends: 506 [2024-11-12 05:10:50,307 INFO L434 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-11-12 05:10:50,308 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 361 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 05:10:50,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 872 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 05:10:50,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2024-11-12 05:10:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 378. [2024-11-12 05:10:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 263 states have (on average 1.3574144486692015) internal successors, (357), 265 states have internal predecessors, (357), 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-11-12 05:10:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 573 transitions. [2024-11-12 05:10:50,347 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 573 transitions. Word has length 207 [2024-11-12 05:10:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:10:50,348 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 573 transitions. [2024-11-12 05:10:50,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 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-11-12 05:10:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 573 transitions. [2024-11-12 05:10:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-12 05:10:50,349 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:10:50,350 INFO L218 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, 1, 1, 1] [2024-11-12 05:10:50,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 05:10:50,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:10:50,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:10:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1982367697, now seen corresponding path program 1 times [2024-11-12 05:10:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:10:50,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993323606] [2024-11-12 05:10:50,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:50,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:10:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:10:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:10:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:10:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:10:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:10:50,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:10:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:10:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:10:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:10:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:10:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:10:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:10:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:10:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:10:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:10:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:10:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:10:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:10:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:10:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:10:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:10:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 05:10:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:10:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 05:10:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 05:10:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 05:10:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:10:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 05:10:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 05:10:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 05:10:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 05:10:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 05:10:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-12 05:10:50,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:10:50,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993323606] [2024-11-12 05:10:50,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993323606] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:10:50,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442433601] [2024-11-12 05:10:50,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:50,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:10:50,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:10:50,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:10:50,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:10:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:50,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:10:50,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:10:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 153 proven. 90 refuted. 0 times theorem prover too weak. 1741 trivial. 0 not checked. [2024-11-12 05:10:51,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:10:51,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 3 proven. 90 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-12 05:10:51,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442433601] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:10:51,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:10:51,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 05:10:51,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869257655] [2024-11-12 05:10:51,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:10:51,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:10:51,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:10:51,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:10:51,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:10:51,605 INFO L87 Difference]: Start difference. First operand 378 states and 573 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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-11-12 05:10:51,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:10:51,846 INFO L93 Difference]: Finished difference Result 619 states and 922 transitions. [2024-11-12 05:10:51,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 05:10:51,850 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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 207 [2024-11-12 05:10:51,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:10:51,853 INFO L225 Difference]: With dead ends: 619 [2024-11-12 05:10:51,853 INFO L226 Difference]: Without dead ends: 259 [2024-11-12 05:10:51,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 474 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:10:51,855 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 115 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 263 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-11-12 05:10:51,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 263 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:10:51,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-12 05:10:51,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 247. [2024-11-12 05:10:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 163 states have (on average 1.294478527607362) internal successors, (211), 164 states have internal predecessors, (211), 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-11-12 05:10:51,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 363 transitions. [2024-11-12 05:10:51,890 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 363 transitions. Word has length 207 [2024-11-12 05:10:51,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:10:51,890 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 363 transitions. [2024-11-12 05:10:51,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 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-11-12 05:10:51,891 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 363 transitions. [2024-11-12 05:10:51,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 05:10:51,892 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:10:51,892 INFO L218 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, 1, 1, 1, 1] [2024-11-12 05:10:51,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 05:10:52,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-12 05:10:52,093 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:10:52,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:10:52,094 INFO L85 PathProgramCache]: Analyzing trace with hash -2136677189, now seen corresponding path program 1 times [2024-11-12 05:10:52,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:10:52,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618834782] [2024-11-12 05:10:52,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:52,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:10:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:10:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:10:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:10:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:10:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:10:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:10:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:10:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:10:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:10:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:10:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:10:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:10:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:10:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:10:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:10:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:10:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:10:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 05:10:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 05:10:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 05:10:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 05:10:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 05:10:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-12 05:10:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 05:10:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-12 05:10:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 05:10:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-12 05:10:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 05:10:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-12 05:10:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-12 05:10:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-12 05:10:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-12 05:10:52,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-12 05:10:52,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:10:52,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618834782] [2024-11-12 05:10:52,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618834782] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:10:52,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348113576] [2024-11-12 05:10:52,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:52,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:10:52,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:10:52,416 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:10:52,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 05:10:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:10:52,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:10:52,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:10:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1021 proven. 48 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-11-12 05:10:52,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:10:52,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 45 proven. 48 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-12 05:10:52,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348113576] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:10:52,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:10:52,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 05:10:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208819349] [2024-11-12 05:10:52,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:10:52,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:10:52,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:10:52,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:10:52,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:10:52,959 INFO L87 Difference]: Start difference. First operand 247 states and 363 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-11-12 05:10:53,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:10:53,180 INFO L93 Difference]: Finished difference Result 490 states and 709 transitions. [2024-11-12 05:10:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 05:10:53,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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 208 [2024-11-12 05:10:53,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:10:53,185 INFO L225 Difference]: With dead ends: 490 [2024-11-12 05:10:53,185 INFO L226 Difference]: Without dead ends: 269 [2024-11-12 05:10:53,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:10:53,187 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 142 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:10:53,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 259 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:10:53,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-12 05:10:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 255. [2024-11-12 05:10:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 169 states have (on average 1.272189349112426) internal successors, (215), 170 states have internal predecessors, (215), 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-11-12 05:10:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 367 transitions. [2024-11-12 05:10:53,217 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 367 transitions. Word has length 208 [2024-11-12 05:10:53,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:10:53,218 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 367 transitions. [2024-11-12 05:10:53,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 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-11-12 05:10:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 367 transitions. [2024-11-12 05:10:53,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 05:10:53,219 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:10:53,219 INFO L218 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, 1, 1, 1, 1] [2024-11-12 05:10:53,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-12 05:10:53,420 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-11-12 05:10:53,420 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:10:53,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:10:53,421 INFO L85 PathProgramCache]: Analyzing trace with hash 352851773, now seen corresponding path program 1 times [2024-11-12 05:10:53,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:10:53,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702255890] [2024-11-12 05:10:53,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:53,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:10:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:10:53,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378670838] [2024-11-12 05:10:53,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:10:53,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:10:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:10:53,572 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:10:53,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 05:10:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:10:53,739 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:10:53,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:10:53,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:10:53,964 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:10:53,965 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:10:53,985 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-11-12 05:10:54,167 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-11-12 05:10:54,172 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:10:54,312 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:10:54,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:10:54 BoogieIcfgContainer [2024-11-12 05:10:54,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:10:54,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:10:54,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:10:54,317 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:10:54,318 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:09:57" (3/4) ... [2024-11-12 05:10:54,320 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:10:54,321 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:10:54,321 INFO L158 Benchmark]: Toolchain (without parser) took 58393.11ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 90.5MB in the beginning and 731.1MB in the end (delta: -640.6MB). Peak memory consumption was 787.1MB. Max. memory is 16.1GB. [2024-11-12 05:10:54,322 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 142.6MB. Free memory was 115.1MB in the beginning and 114.9MB in the end (delta: 194.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:10:54,322 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.90ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 71.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 05:10:54,322 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.77ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 65.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 05:10:54,322 INFO L158 Benchmark]: Boogie Preprocessor took 145.67ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 65.9MB in the beginning and 148.9MB in the end (delta: -82.9MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-12 05:10:54,323 INFO L158 Benchmark]: RCFGBuilder took 776.42ms. Allocated memory is still 180.4MB. Free memory was 148.9MB in the beginning and 117.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-12 05:10:54,323 INFO L158 Benchmark]: TraceAbstraction took 56897.36ms. Allocated memory was 180.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 117.4MB in the beginning and 731.1MB in the end (delta: -613.7MB). Peak memory consumption was 773.6MB. Max. memory is 16.1GB. [2024-11-12 05:10:54,324 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 1.6GB. Free memory is still 731.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:10:54,325 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.10ms. Allocated memory is still 142.6MB. Free memory was 115.1MB in the beginning and 114.9MB in the end (delta: 194.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.90ms. Allocated memory is still 142.6MB. Free memory was 90.1MB in the beginning and 71.2MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.77ms. Allocated memory is still 142.6MB. Free memory was 71.2MB in the beginning and 65.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 145.67ms. Allocated memory was 142.6MB in the beginning and 180.4MB in the end (delta: 37.7MB). Free memory was 65.9MB in the beginning and 148.9MB in the end (delta: -82.9MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * RCFGBuilder took 776.42ms. Allocated memory is still 180.4MB. Free memory was 148.9MB in the beginning and 117.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 56897.36ms. Allocated memory was 180.4MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 117.4MB in the beginning and 731.1MB in the end (delta: -613.7MB). Peak memory consumption was 773.6MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 1.6GB. Free memory is still 731.1MB. 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; VAL [isInitial=0, 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] [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L188] last_1_var_1_20 = var_1_20 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] [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, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 56.7s, OverallIterations: 12, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2383 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2369 mSDsluCounter, 5174 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3314 mSDsCounter, 130 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2085 IncrementalHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 130 mSolverCounterUnsat, 1860 mSDtfsCounter, 2085 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1623 GetRequests, 1555 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=382occurred in iteration=7, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 844 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 47.7s InterpolantComputationTime, 3104 NumberOfCodeBlocks, 3104 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3088 ConstructedInterpolants, 0 QuantifiedInterpolants, 16125 SizeOfPredicates, 2 NumberOfNonLiveVariables, 956 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-11-12 05:10:54,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_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.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:10:56,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:10:56,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:10:56,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:10:56,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:10:56,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:10:56,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:10:56,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:10:56,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:10:56,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:10:56,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:10:56,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:10:56,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:10:56,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:10:56,879 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:10:56,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:10:56,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:10:56,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:10:56,881 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:10:56,881 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:10:56,881 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:10:56,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:10:56,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:10:56,886 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:10:56,886 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:10:56,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:10:56,888 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:10:56,889 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:10:56,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:10:56,890 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:10:56,890 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:10:56,890 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:10:56,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:10:56,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:10:56,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:10:56,891 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:10:56,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:10:56,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:10:56,892 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:10:56,892 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:10:56,892 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:10:56,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:10:56,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:10:56,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:10:56,894 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-11-12 05:10:57,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:10:57,292 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:10:57,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:10:57,297 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:10:57,298 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:10:57,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-12 05:10:58,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:10:59,218 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:10:59,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-12 05:10:59,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87c5b3cd/0ceb0737aefd48e39b72a6ac24fa2043/FLAGa62a1a5e6 [2024-11-12 05:10:59,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e87c5b3cd/0ceb0737aefd48e39b72a6ac24fa2043 [2024-11-12 05:10:59,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:10:59,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:10:59,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:10:59,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:10:59,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:10:59,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:10:59" (1/1) ... [2024-11-12 05:10:59,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745cc29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:10:59, skipping insertion in model container [2024-11-12 05:10:59,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:10:59" (1/1) ... [2024-11-12 05:10:59,597 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:10:59,826 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i[916,929] [2024-11-12 05:10:59,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:10:59,933 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:10:59,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-41.i[916,929] [2024-11-12 05:11:00,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:11:00,046 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:11:00,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00 WrapperNode [2024-11-12 05:11:00,048 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:11:00,049 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:11:00,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:11:00,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:11:00,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (1/1) ... [2024-11-12 05:11:00,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (1/1) ... [2024-11-12 05:11:00,121 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-11-12 05:11:00,122 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:11:00,122 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:11:00,122 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:11:00,123 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:11:00,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (1/1) ... [2024-11-12 05:11:00,136 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (1/1) ... [2024-11-12 05:11:00,146 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (1/1) ... [2024-11-12 05:11:00,169 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:11:00,169 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (1/1) ... [2024-11-12 05:11:00,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (1/1) ... [2024-11-12 05:11:00,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (1/1) ... [2024-11-12 05:11:00,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (1/1) ... [2024-11-12 05:11:00,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (1/1) ... [2024-11-12 05:11:00,204 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (1/1) ... [2024-11-12 05:11:00,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:11:00,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:11:00,236 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:11:00,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:11:00,237 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (1/1) ... [2024-11-12 05:11:00,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:11:00,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:11:00,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:11:00,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:11:00,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:11:00,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:11:00,327 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:11:00,328 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:11:00,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:11:00,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:11:00,417 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:11:00,419 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:11:04,286 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-12 05:11:04,286 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:11:04,306 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:11:04,306 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:11:04,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:04 BoogieIcfgContainer [2024-11-12 05:11:04,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:11:04,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:11:04,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:11:04,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:11:04,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:10:59" (1/3) ... [2024-11-12 05:11:04,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa5f1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:11:04, skipping insertion in model container [2024-11-12 05:11:04,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:11:00" (2/3) ... [2024-11-12 05:11:04,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fa5f1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:11:04, skipping insertion in model container [2024-11-12 05:11:04,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:11:04" (3/3) ... [2024-11-12 05:11:04,319 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-41.i [2024-11-12 05:11:04,340 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:11:04,340 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:11:04,416 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:11:04,427 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;@4c996a71, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:11:04,427 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:11:04,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 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-11-12 05:11:04,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-12 05:11:04,453 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:11:04,454 INFO L218 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-11-12 05:11:04,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:11:04,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:11:04,465 INFO L85 PathProgramCache]: Analyzing trace with hash -668581297, now seen corresponding path program 1 times [2024-11-12 05:11:04,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:11:04,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106849045] [2024-11-12 05:11:04,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:11:04,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:11:04,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:11:04,488 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:11:04,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:11:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:05,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:11:05,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:11:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-12 05:11:05,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:11:05,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:11:05,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106849045] [2024-11-12 05:11:05,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106849045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:11:05,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:11:05,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:11:05,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964702322] [2024-11-12 05:11:05,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:11:05,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:11:05,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:11:05,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:11:05,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:11:05,169 INFO L87 Difference]: Start difference. First operand has 90 states, 55 states have (on average 1.4) internal successors, (77), 56 states have internal predecessors, (77), 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 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-12 05:11:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:11:05,215 INFO L93 Difference]: Finished difference Result 173 states and 308 transitions. [2024-11-12 05:11:05,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:11:05,218 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-12 05:11:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:11:05,229 INFO L225 Difference]: With dead ends: 173 [2024-11-12 05:11:05,231 INFO L226 Difference]: Without dead ends: 86 [2024-11-12 05:11:05,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:11:05,240 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:11:05,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:11:05,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-12 05:11:05,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-12 05:11:05,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 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-11-12 05:11:05,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2024-11-12 05:11:05,299 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 203 [2024-11-12 05:11:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:11:05,310 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2024-11-12 05:11:05,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-12 05:11:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2024-11-12 05:11:05,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-12 05:11:05,319 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:11:05,319 INFO L218 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-11-12 05:11:05,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 05:11:05,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:11:05,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:11:05,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:11:05,522 INFO L85 PathProgramCache]: Analyzing trace with hash -398678841, now seen corresponding path program 1 times [2024-11-12 05:11:05,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:11:05,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584319050] [2024-11-12 05:11:05,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:11:05,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:11:05,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:11:05,527 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:11:05,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:11:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:11:06,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 05:11:06,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:11:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1021 proven. 48 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-11-12 05:11:06,995 INFO L312 TraceCheckSpWp]: Computing backward predicates...