./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-45.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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-1loop_file-45.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 b4f6e04aab7a375a9a3b1db14655fd21d6933c9320c3b6ac5eeb9864f972d443 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:03:33,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:03:33,519 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:03:33,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:03:33,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:03:33,553 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:03:33,554 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:03:33,554 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:03:33,555 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:03:33,556 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:03:33,556 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:03:33,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:03:33,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:03:33,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:03:33,559 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:03:33,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:03:33,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:03:33,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:03:33,560 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:03:33,560 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:03:33,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:03:33,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:03:33,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:03:33,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:03:33,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:03:33,565 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:03:33,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:03:33,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:03:33,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:03:33,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:03:33,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:03:33,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:03:33,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:03:33,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:03:33,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:03:33,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:03:33,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:03:33,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:03:33,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:03:33,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:03:33,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:03:33,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:03:33,568 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 -> b4f6e04aab7a375a9a3b1db14655fd21d6933c9320c3b6ac5eeb9864f972d443 [2024-11-10 07:03:33,837 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:03:33,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:03:33,866 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:03:33,867 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:03:33,867 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:03:33,868 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-45.i [2024-11-10 07:03:35,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:03:35,663 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:03:35,664 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-45.i [2024-11-10 07:03:35,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e75f8c7/ef6aa247c34d4ae0bbc970deca9c3dcc/FLAG653337392 [2024-11-10 07:03:35,689 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0e75f8c7/ef6aa247c34d4ae0bbc970deca9c3dcc [2024-11-10 07:03:35,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:03:35,693 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:03:35,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:03:35,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:03:35,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:03:35,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e98770 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:35, skipping insertion in model container [2024-11-10 07:03:35,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:35" (1/1) ... [2024-11-10 07:03:35,735 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:03:35,912 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-1loop_file-45.i[916,929] [2024-11-10 07:03:36,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:03:36,070 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:03:36,137 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-1loop_file-45.i[916,929] [2024-11-10 07:03:36,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:03:36,357 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:03:36,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36 WrapperNode [2024-11-10 07:03:36,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:03:36,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:03:36,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:03:36,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:03:36,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (1/1) ... [2024-11-10 07:03:36,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (1/1) ... [2024-11-10 07:03:36,488 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 250 [2024-11-10 07:03:36,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:03:36,496 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:03:36,499 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:03:36,499 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:03:36,517 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (1/1) ... [2024-11-10 07:03:36,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (1/1) ... [2024-11-10 07:03:36,531 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (1/1) ... [2024-11-10 07:03:36,588 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-10 07:03:36,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (1/1) ... [2024-11-10 07:03:36,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (1/1) ... [2024-11-10 07:03:36,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (1/1) ... [2024-11-10 07:03:36,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (1/1) ... [2024-11-10 07:03:36,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (1/1) ... [2024-11-10 07:03:36,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (1/1) ... [2024-11-10 07:03:36,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:03:36,671 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:03:36,671 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:03:36,671 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:03:36,672 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (1/1) ... [2024-11-10 07:03:36,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:03:36,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:36,710 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-10 07:03:36,714 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-10 07:03:36,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:03:36,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:03:36,748 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:03:36,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:03:36,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:03:36,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:03:36,826 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:03:36,828 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:03:37,247 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L192: havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~bitwise25#1;havoc property_#t~short26#1; [2024-11-10 07:03:37,290 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-10 07:03:37,291 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:03:37,316 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:03:37,316 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:03:37,317 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:37 BoogieIcfgContainer [2024-11-10 07:03:37,317 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:03:37,319 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:03:37,319 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:03:37,322 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:03:37,323 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:03:35" (1/3) ... [2024-11-10 07:03:37,324 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b75b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:03:37, skipping insertion in model container [2024-11-10 07:03:37,324 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:36" (2/3) ... [2024-11-10 07:03:37,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22b75b61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:03:37, skipping insertion in model container [2024-11-10 07:03:37,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:37" (3/3) ... [2024-11-10 07:03:37,327 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-45.i [2024-11-10 07:03:37,344 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:03:37,345 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:03:37,424 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:03:37,431 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;@3fa8e834, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:03:37,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:03:37,438 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 71 states have (on average 1.352112676056338) internal successors, (96), 72 states have internal predecessors, (96), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 07:03:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 07:03:37,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:37,454 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:03:37,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:37,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:37,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1172269115, now seen corresponding path program 1 times [2024-11-10 07:03:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:37,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023988318] [2024-11-10 07:03:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:03:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:03:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:03:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:03:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:03:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:03:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:03:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:03:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:03:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:03:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:03:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:03:37,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:03:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:03:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:03:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:03:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:03:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:03:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:03:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:03:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:03:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:37,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:03:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:03:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:03:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:03:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:03:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 07:03:38,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:38,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023988318] [2024-11-10 07:03:38,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023988318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:03:38,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:03:38,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:03:38,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924787845] [2024-11-10 07:03:38,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:03:38,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:03:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:38,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:03:38,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:03:38,042 INFO L87 Difference]: Start difference. First operand has 103 states, 71 states have (on average 1.352112676056338) internal successors, (96), 72 states have internal predecessors, (96), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 07:03:38,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:38,087 INFO L93 Difference]: Finished difference Result 202 states and 333 transitions. [2024-11-10 07:03:38,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:03:38,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 194 [2024-11-10 07:03:38,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:38,100 INFO L225 Difference]: With dead ends: 202 [2024-11-10 07:03:38,101 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 07:03:38,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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-10 07:03:38,108 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:38,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:03:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 07:03:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 07:03:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 07:03:38,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2024-11-10 07:03:38,158 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 194 [2024-11-10 07:03:38,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:38,158 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2024-11-10 07:03:38,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 07:03:38,160 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2024-11-10 07:03:38,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 07:03:38,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:38,164 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:03:38,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:03:38,165 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:38,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:38,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1425078332, now seen corresponding path program 1 times [2024-11-10 07:03:38,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:38,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903506690] [2024-11-10 07:03:38,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:38,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:38,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:03:38,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:03:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:03:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:03:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:03:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:03:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:03:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:03:38,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:03:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:03:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:03:38,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:03:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:03:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:03:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:03:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:03:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:03:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:03:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:03:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:03:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:03:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:03:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:03:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:03:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:03:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:03:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 07:03:38,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:38,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903506690] [2024-11-10 07:03:38,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903506690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:03:38,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:03:38,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:03:38,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915966599] [2024-11-10 07:03:38,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:03:38,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:03:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:03:38,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:03:38,990 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:03:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:39,355 INFO L93 Difference]: Finished difference Result 290 states and 434 transitions. [2024-11-10 07:03:39,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:03:39,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-10 07:03:39,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:39,361 INFO L225 Difference]: With dead ends: 290 [2024-11-10 07:03:39,361 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 07:03:39,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-10 07:03:39,364 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 117 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:39,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 399 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:03:39,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 07:03:39,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2024-11-10 07:03:39,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.25) internal successors, (120), 96 states have internal predecessors, (120), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:03:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 236 transitions. [2024-11-10 07:03:39,406 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 236 transitions. Word has length 194 [2024-11-10 07:03:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:39,409 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 236 transitions. [2024-11-10 07:03:39,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:03:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 236 transitions. [2024-11-10 07:03:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-10 07:03:39,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:39,412 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:03:39,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:03:39,413 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:39,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash 180313851, now seen corresponding path program 1 times [2024-11-10 07:03:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:39,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277910899] [2024-11-10 07:03:39,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:39,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:03:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:03:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:03:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:03:40,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:03:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:03:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:03:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:03:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:03:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:03:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:03:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:03:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:03:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:03:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:03:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:03:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:03:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:03:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:03:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:03:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:03:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:03:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:03:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:03:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:03:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:03:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 07:03:40,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:40,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277910899] [2024-11-10 07:03:40,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277910899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:03:40,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:03:40,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:03:40,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223606877] [2024-11-10 07:03:40,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:03:40,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:03:40,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:40,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:03:40,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:03:40,355 INFO L87 Difference]: Start difference. First operand 157 states and 236 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:03:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:40,590 INFO L93 Difference]: Finished difference Result 290 states and 433 transitions. [2024-11-10 07:03:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:03:40,592 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 194 [2024-11-10 07:03:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:40,594 INFO L225 Difference]: With dead ends: 290 [2024-11-10 07:03:40,594 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 07:03:40,595 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:03:40,600 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 92 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:40,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 390 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:03:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 07:03:40,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 159. [2024-11-10 07:03:40,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 98 states have internal predecessors, (122), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:03:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 238 transitions. [2024-11-10 07:03:40,633 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 238 transitions. Word has length 194 [2024-11-10 07:03:40,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:40,636 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 238 transitions. [2024-11-10 07:03:40,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:03:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 238 transitions. [2024-11-10 07:03:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-10 07:03:40,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:40,642 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:03:40,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:03:40,642 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:40,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:40,643 INFO L85 PathProgramCache]: Analyzing trace with hash 857878820, now seen corresponding path program 1 times [2024-11-10 07:03:40,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:40,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862893608] [2024-11-10 07:03:40,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:40,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:40,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:03:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:03:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:03:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:03:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:03:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:03:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:03:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:03:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:03:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:03:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:03:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:03:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:03:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:03:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:03:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:03:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:03:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:03:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:03:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:03:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:03:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:03:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:03:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:03:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:03:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:03:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:03:41,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:41,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862893608] [2024-11-10 07:03:41,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862893608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:03:41,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259710852] [2024-11-10 07:03:41,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:41,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:41,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:41,049 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-10 07:03:41,051 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-10 07:03:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:41,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:03:41,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:03:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 820 proven. 48 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2024-11-10 07:03:41,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:03:41,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:03:41,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259710852] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:03:41,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:03:41,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 07:03:41,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129982593] [2024-11-10 07:03:41,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:03:41,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:03:41,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:41,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:03:41,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:03:41,790 INFO L87 Difference]: Start difference. First operand 159 states and 238 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-10 07:03:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:42,692 INFO L93 Difference]: Finished difference Result 270 states and 395 transitions. [2024-11-10 07:03:42,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:03:42,693 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 195 [2024-11-10 07:03:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:42,695 INFO L225 Difference]: With dead ends: 270 [2024-11-10 07:03:42,695 INFO L226 Difference]: Without dead ends: 175 [2024-11-10 07:03:42,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 444 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:03:42,696 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 138 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:42,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 264 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 07:03:42,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-10 07:03:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 167. [2024-11-10 07:03:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 104 states have internal predecessors, (127), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:03:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 243 transitions. [2024-11-10 07:03:42,751 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 243 transitions. Word has length 195 [2024-11-10 07:03:42,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:42,755 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 243 transitions. [2024-11-10 07:03:42,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-10 07:03:42,756 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 243 transitions. [2024-11-10 07:03:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 07:03:42,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:42,760 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:03:42,780 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-10 07:03:42,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:42,962 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:42,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:42,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1415657573, now seen corresponding path program 1 times [2024-11-10 07:03:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:42,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599925535] [2024-11-10 07:03:42,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:42,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:43,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:03:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:03:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:03:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:03:43,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:03:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:03:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:03:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:03:43,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:03:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:03:43,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:03:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:03:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:03:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:03:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:03:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:03:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:03:43,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:03:43,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:03:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:03:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:03:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:03:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:03:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:03:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:03:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:03:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:03:43,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:43,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599925535] [2024-11-10 07:03:43,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599925535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:03:43,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238060308] [2024-11-10 07:03:43,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:43,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:43,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:43,391 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-10 07:03:43,392 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-10 07:03:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:43,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:03:43,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:03:43,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 840 proven. 42 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2024-11-10 07:03:43,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:03:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:03:43,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238060308] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:03:43,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:03:43,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 07:03:43,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202143207] [2024-11-10 07:03:43,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:03:43,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:03:43,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:43,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:03:43,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:03:43,850 INFO L87 Difference]: Start difference. First operand 167 states and 243 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-10 07:03:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:44,028 INFO L93 Difference]: Finished difference Result 286 states and 406 transitions. [2024-11-10 07:03:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:03:44,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 196 [2024-11-10 07:03:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:44,030 INFO L225 Difference]: With dead ends: 286 [2024-11-10 07:03:44,030 INFO L226 Difference]: Without dead ends: 187 [2024-11-10 07:03:44,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 446 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:03:44,031 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 137 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:44,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 260 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:03:44,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-10 07:03:44,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 175. [2024-11-10 07:03:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 110 states have (on average 1.2) internal successors, (132), 110 states have internal predecessors, (132), 58 states have call successors, (58), 6 states have call predecessors, (58), 6 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:03:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 248 transitions. [2024-11-10 07:03:44,049 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 248 transitions. Word has length 196 [2024-11-10 07:03:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:44,050 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 248 transitions. [2024-11-10 07:03:44,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-10 07:03:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 248 transitions. [2024-11-10 07:03:44,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-10 07:03:44,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:44,052 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:03:44,067 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-10 07:03:44,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:44,253 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:44,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:44,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1882237370, now seen corresponding path program 1 times [2024-11-10 07:03:44,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:44,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303346446] [2024-11-10 07:03:44,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:44,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:03:45,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:03:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:03:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:03:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:03:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:03:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:03:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:03:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:03:45,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:03:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:03:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:03:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:03:45,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:03:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:03:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:45,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:03:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:03:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:03:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:03:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:03:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:03:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:03:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:03:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:03:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:03:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:03:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 54 proven. 30 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:03:45,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:45,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303346446] [2024-11-10 07:03:45,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303346446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:03:45,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367319432] [2024-11-10 07:03:45,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:45,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:45,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:45,077 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-10 07:03:45,081 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-10 07:03:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:45,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 07:03:45,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:03:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 784 proven. 30 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-11-10 07:03:45,440 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:03:45,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 54 proven. 30 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:03:45,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367319432] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:03:45,709 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:03:45,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-10 07:03:45,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180750859] [2024-11-10 07:03:45,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:03:45,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 07:03:45,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:45,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 07:03:45,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-10 07:03:45,711 INFO L87 Difference]: Start difference. First operand 175 states and 248 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-10 07:03:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:46,213 INFO L93 Difference]: Finished difference Result 303 states and 420 transitions. [2024-11-10 07:03:46,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 07:03:46,213 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 196 [2024-11-10 07:03:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:46,215 INFO L225 Difference]: With dead ends: 303 [2024-11-10 07:03:46,215 INFO L226 Difference]: Without dead ends: 200 [2024-11-10 07:03:46,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 443 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=494, Unknown=0, NotChecked=0, Total=702 [2024-11-10 07:03:46,219 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 335 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:46,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 517 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:03:46,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-10 07:03:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 183. [2024-11-10 07:03:46,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 116 states have internal predecessors, (136), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:03:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 252 transitions. [2024-11-10 07:03:46,252 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 252 transitions. Word has length 196 [2024-11-10 07:03:46,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:46,255 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 252 transitions. [2024-11-10 07:03:46,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-10 07:03:46,256 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 252 transitions. [2024-11-10 07:03:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 07:03:46,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:46,258 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:03:46,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 07:03:46,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:46,459 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:46,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:46,460 INFO L85 PathProgramCache]: Analyzing trace with hash -2073603455, now seen corresponding path program 1 times [2024-11-10 07:03:46,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:46,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99135101] [2024-11-10 07:03:46,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:46,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:03:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:03:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:03:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:03:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-10 07:03:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:03:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 07:03:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 07:03:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 07:03:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:03:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 07:03:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:03:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 07:03:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:03:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 07:03:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:03:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 07:03:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 07:03:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 07:03:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 07:03:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 07:03:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-10 07:03:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 07:03:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-10 07:03:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 07:03:47,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-10 07:03:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-10 07:03:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-10 07:03:47,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-10 07:03:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 07:03:47,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:47,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99135101] [2024-11-10 07:03:47,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99135101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:03:47,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:03:47,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:03:47,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555262394] [2024-11-10 07:03:47,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:03:47,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:03:47,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:47,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:03:47,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:03:47,869 INFO L87 Difference]: Start difference. First operand 183 states and 252 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:03:48,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:48,487 INFO L93 Difference]: Finished difference Result 383 states and 518 transitions. [2024-11-10 07:03:48,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 07:03:48,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 199 [2024-11-10 07:03:48,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:48,490 INFO L225 Difference]: With dead ends: 383 [2024-11-10 07:03:48,490 INFO L226 Difference]: Without dead ends: 276 [2024-11-10 07:03:48,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2024-11-10 07:03:48,491 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 319 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:48,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 623 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 07:03:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-10 07:03:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 195. [2024-11-10 07:03:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 128 states have (on average 1.1875) internal successors, (152), 128 states have internal predecessors, (152), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:03:48,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 268 transitions. [2024-11-10 07:03:48,514 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 268 transitions. Word has length 199 [2024-11-10 07:03:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:48,514 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 268 transitions. [2024-11-10 07:03:48,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:03:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 268 transitions. [2024-11-10 07:03:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 07:03:48,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:48,516 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:03:48,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 07:03:48,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:48,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1715805216, now seen corresponding path program 1 times [2024-11-10 07:03:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:48,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102877471] [2024-11-10 07:03:48,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:03:48,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1606426652] [2024-11-10 07:03:48,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:48,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:48,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:48,698 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:03:48,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 07:03:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:48,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-10 07:03:48,933 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:03:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 372 proven. 225 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2024-11-10 07:03:50,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:03:51,060 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_z_12 Int) (v_z_11 Int)) (or (< (mod |c_ULTIMATE.start_step_~stepLocal_3~0#1| 4294967296) (+ (mod (div v_z_12 v_z_11) 4294967296) 1)) (< 255 v_z_12) (< v_z_11 0) (< v_z_12 0) (< 4294967295 v_z_11))) (forall ((v_~var_1_21~0_20 Int)) (or (< (+ (mod (+ 32 c_~var_1_5~0) 256) v_~var_1_21~0_20) (+ 256 c_~var_1_5~0 (mod c_~var_1_8~0 256))) (not (= (* v_~var_1_21~0_20 (mod c_~var_1_5~0 256)) 0))))) is different from false [2024-11-10 07:03:51,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:51,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102877471] [2024-11-10 07:03:51,968 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 07:03:51,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606426652] [2024-11-10 07:03:51,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606426652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:03:51,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 07:03:51,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-10 07:03:51,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886970809] [2024-11-10 07:03:51,969 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 07:03:51,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 07:03:51,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:51,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 07:03:51,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=344, Unknown=1, NotChecked=38, Total=462 [2024-11-10 07:03:51,971 INFO L87 Difference]: Start difference. First operand 195 states and 268 transitions. Second operand has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-11-10 07:03:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:53,256 INFO L93 Difference]: Finished difference Result 385 states and 513 transitions. [2024-11-10 07:03:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 07:03:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) Word has length 199 [2024-11-10 07:03:53,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:53,258 INFO L225 Difference]: With dead ends: 385 [2024-11-10 07:03:53,258 INFO L226 Difference]: Without dead ends: 275 [2024-11-10 07:03:53,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=345, Invalid=1298, Unknown=1, NotChecked=78, Total=1722 [2024-11-10 07:03:53,260 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 275 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:53,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 789 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 07:03:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-10 07:03:53,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 215. [2024-11-10 07:03:53,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 145 states have (on average 1.186206896551724) internal successors, (172), 145 states have internal predecessors, (172), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:03:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 288 transitions. [2024-11-10 07:03:53,284 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 288 transitions. Word has length 199 [2024-11-10 07:03:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:53,285 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 288 transitions. [2024-11-10 07:03:53,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.0588235294117645) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (29), 4 states have call predecessors, (29), 5 states have return successors, (29), 3 states have call predecessors, (29), 4 states have call successors, (29) [2024-11-10 07:03:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 288 transitions. [2024-11-10 07:03:53,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 07:03:53,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:53,287 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:03:53,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 07:03:53,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:53,488 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:53,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:53,489 INFO L85 PathProgramCache]: Analyzing trace with hash 144154498, now seen corresponding path program 1 times [2024-11-10 07:03:53,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:53,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240630655] [2024-11-10 07:03:53,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:53,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:03:53,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552053988] [2024-11-10 07:03:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:53,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:53,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:53,657 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:03:53,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 07:03:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:53,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-10 07:03:53,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:03:55,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 758 proven. 198 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2024-11-10 07:03:55,712 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:03:56,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 07:03:56,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:03:56,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240630655] [2024-11-10 07:03:56,075 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 07:03:56,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552053988] [2024-11-10 07:03:56,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552053988] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 07:03:56,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 07:03:56,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 19 [2024-11-10 07:03:56,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534318323] [2024-11-10 07:03:56,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:03:56,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:03:56,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:03:56,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:03:56,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-10 07:03:56,076 INFO L87 Difference]: Start difference. First operand 215 states and 288 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:03:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:56,478 INFO L93 Difference]: Finished difference Result 341 states and 464 transitions. [2024-11-10 07:03:56,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:03:56,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 199 [2024-11-10 07:03:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:56,481 INFO L225 Difference]: With dead ends: 341 [2024-11-10 07:03:56,482 INFO L226 Difference]: Without dead ends: 234 [2024-11-10 07:03:56,482 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-11-10 07:03:56,483 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 55 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:56,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 457 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:03:56,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-10 07:03:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 218. [2024-11-10 07:03:56,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 148 states have (on average 1.1824324324324325) internal successors, (175), 148 states have internal predecessors, (175), 58 states have call successors, (58), 11 states have call predecessors, (58), 11 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:03:56,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 291 transitions. [2024-11-10 07:03:56,507 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 291 transitions. Word has length 199 [2024-11-10 07:03:56,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:56,508 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 291 transitions. [2024-11-10 07:03:56,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:03:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 291 transitions. [2024-11-10 07:03:56,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-10 07:03:56,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:56,511 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:03:56,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 07:03:56,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:56,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:56,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:56,717 INFO L85 PathProgramCache]: Analyzing trace with hash -361404127, now seen corresponding path program 1 times [2024-11-10 07:03:56,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:03:56,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572560105] [2024-11-10 07:03:56,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:56,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:03:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:03:56,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009871575] [2024-11-10 07:03:56,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:56,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:56,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:56,938 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:03:56,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 07:03:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:03:57,146 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:03:57,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:03:57,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:03:57,355 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:03:57,356 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:03:57,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 07:03:57,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:03:57,566 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:57,679 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:03:57,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:03:57 BoogieIcfgContainer [2024-11-10 07:03:57,682 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:03:57,682 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:03:57,682 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:03:57,683 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:03:57,683 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:37" (3/4) ... [2024-11-10 07:03:57,685 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:03:57,685 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:03:57,686 INFO L158 Benchmark]: Toolchain (without parser) took 21992.92ms. Allocated memory was 172.0MB in the beginning and 530.6MB in the end (delta: 358.6MB). Free memory was 101.7MB in the beginning and 310.8MB in the end (delta: -209.1MB). Peak memory consumption was 150.7MB. Max. memory is 16.1GB. [2024-11-10 07:03:57,686 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 172.0MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:03:57,686 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.39ms. Allocated memory is still 172.0MB. Free memory was 101.6MB in the beginning and 137.5MB in the end (delta: -36.0MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2024-11-10 07:03:57,686 INFO L158 Benchmark]: Boogie Procedure Inliner took 136.60ms. Allocated memory is still 172.0MB. Free memory was 137.5MB in the beginning and 132.6MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:03:57,687 INFO L158 Benchmark]: Boogie Preprocessor took 169.65ms. Allocated memory is still 172.0MB. Free memory was 132.6MB in the beginning and 125.0MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 07:03:57,687 INFO L158 Benchmark]: IcfgBuilder took 646.63ms. Allocated memory is still 172.0MB. Free memory was 125.0MB in the beginning and 90.6MB in the end (delta: 34.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-10 07:03:57,687 INFO L158 Benchmark]: TraceAbstraction took 20362.62ms. Allocated memory was 172.0MB in the beginning and 530.6MB in the end (delta: 358.6MB). Free memory was 90.0MB in the beginning and 310.8MB in the end (delta: -220.8MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. [2024-11-10 07:03:57,687 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 530.6MB. Free memory is still 310.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:03:57,688 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.18ms. Allocated memory is still 172.0MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 662.39ms. Allocated memory is still 172.0MB. Free memory was 101.6MB in the beginning and 137.5MB in the end (delta: -36.0MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 136.60ms. Allocated memory is still 172.0MB. Free memory was 137.5MB in the beginning and 132.6MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 169.65ms. Allocated memory is still 172.0MB. Free memory was 132.6MB in the beginning and 125.0MB in the end (delta: 7.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 646.63ms. Allocated memory is still 172.0MB. Free memory was 125.0MB in the beginning and 90.6MB in the end (delta: 34.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20362.62ms. Allocated memory was 172.0MB in the beginning and 530.6MB in the end (delta: 358.6MB). Free memory was 90.0MB in the beginning and 310.8MB in the end (delta: -220.8MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 530.6MB. Free memory is still 310.8MB. 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 someBinaryDOUBLEComparisonOperation at line 192, overapproximation of someBinaryFLOATComparisonOperation at line 192, overapproximation of someBinaryArithmeticFLOAToperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 0; [L23] signed long int var_1_5 = 32; [L24] unsigned char var_1_6 = 16; [L25] unsigned long int var_1_7 = 64; [L26] unsigned char var_1_8 = 128; [L27] double var_1_9 = 99999.2; [L28] double var_1_10 = 31.9; [L29] double var_1_11 = 8.5; [L30] unsigned char var_1_12 = 1; [L31] unsigned char var_1_13 = 0; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_15 = 0; [L34] double var_1_16 = 63.5; [L35] double var_1_17 = 1.75; [L36] double var_1_18 = 4.25; [L37] double var_1_19 = 127.7; [L38] unsigned char var_1_20 = 0; [L39] signed long int var_1_21 = -2; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] float var_1_24 = 999999999.6; [L43] float var_1_25 = 99999999999999.5; [L44] signed char var_1_26 = 32; [L45] signed char var_1_27 = 64; [L46] signed char var_1_28 = 32; [L47] signed char var_1_29 = 4; [L48] unsigned char var_1_30 = 0; [L49] unsigned char var_1_31 = 0; [L50] signed long int var_1_32 = 128; [L51] signed short int var_1_34 = -25; [L52] unsigned char var_1_36 = 64; [L53] unsigned long int last_1_var_1_1 = 0; [L54] unsigned char last_1_var_1_6 = 16; [L55] double last_1_var_1_16 = 63.5; [L56] unsigned char last_1_var_1_20 = 0; [L57] signed long int last_1_var_1_32 = 128; [L58] signed short int last_1_var_1_34 = -25; [L59] unsigned char last_1_var_1_36 = 64; VAL [isInitial=0, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=32, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L196] isInitial = 1 [L197] FCALL initially() [L198] int k_loop; [L199] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=32, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L199] COND TRUE k_loop < 1 [L200] CALL updateLastVariables() [L183] last_1_var_1_1 = var_1_1 [L184] last_1_var_1_6 = var_1_6 [L185] last_1_var_1_16 = var_1_16 [L186] last_1_var_1_20 = var_1_20 [L187] last_1_var_1_32 = var_1_32 [L188] last_1_var_1_34 = var_1_34 [L189] last_1_var_1_36 = var_1_36 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=32, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L135] var_1_5 = __VERIFIER_nondet_long() [L136] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L136] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L137] CALL assume_abort_if_not(var_1_5 <= 33) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L137] RET assume_abort_if_not(var_1_5 <= 33) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=64, var_1_8=128, var_1_9=499996/5] [L138] var_1_7 = __VERIFIER_nondet_ulong() [L139] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_8=128, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_8=128, var_1_9=499996/5] [L139] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_8=128, var_1_9=499996/5] [L140] CALL assume_abort_if_not(var_1_7 <= 4294967295) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_8=128, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_8=128, var_1_9=499996/5] [L140] RET assume_abort_if_not(var_1_7 <= 4294967295) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_8=128, var_1_9=499996/5] [L141] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=128, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=128, var_1_9=499996/5] [L141] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=128, var_1_9=499996/5] [L142] var_1_8 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_8 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L143] RET assume_abort_if_not(var_1_8 >= 127) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L144] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L144] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=319/10, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L145] var_1_10 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L146] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_11=17/2, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L147] var_1_11 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L148] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L149] var_1_13 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L150] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L151] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L151] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L152] var_1_14 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L153] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L154] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L154] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L155] var_1_15 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L156] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L157] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L157] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_17=7/4, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L158] var_1_17 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L159] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_18=17/4, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L160] var_1_18 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L161] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_19=1277/10, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L162] var_1_19 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L163] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L164] var_1_23 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_23 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L165] RET assume_abort_if_not(var_1_23 >= 1) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L166] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L166] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_25=199999999999999/2, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L167] var_1_25 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L168] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=64, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L169] var_1_27 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_27 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L170] RET assume_abort_if_not(var_1_27 >= 63) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L171] CALL assume_abort_if_not(var_1_27 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L171] RET assume_abort_if_not(var_1_27 <= 126) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=32, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L172] var_1_28 = __VERIFIER_nondet_char() [L173] CALL assume_abort_if_not(var_1_28 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L173] RET assume_abort_if_not(var_1_28 >= 31) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L174] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L174] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=4, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L175] var_1_29 = __VERIFIER_nondet_char() [L176] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L176] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L177] CALL assume_abort_if_not(var_1_29 <= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L177] RET assume_abort_if_not(var_1_29 <= 31) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L178] var_1_31 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_31 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L179] RET assume_abort_if_not(var_1_31 >= 1) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L180] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L180] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L201] RET updateVariables() [L202] CALL step() [L63] EXPR var_1_29 >> var_1_5 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=-25, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L63] COND FALSE !(! (((((last_1_var_1_6) > (last_1_var_1_36)) ? (last_1_var_1_6) : (last_1_var_1_36))) > (var_1_29 >> var_1_5))) [L68] var_1_34 = var_1_29 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=1, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L70] signed long int stepLocal_6 = (((last_1_var_1_34) < ((last_1_var_1_6 % var_1_8))) ? (last_1_var_1_34) : ((last_1_var_1_6 % var_1_8))); VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_6=-25, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=0, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=1, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L71] COND TRUE stepLocal_6 >= last_1_var_1_1 [L72] var_1_20 = (var_1_5 + ((((16) < (1)) ? (16) : (1)))) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=1, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L74] unsigned long int stepLocal_3 = (((var_1_5) > (last_1_var_1_1)) ? (var_1_5) : (last_1_var_1_1)); [L75] signed long int stepLocal_2 = var_1_5; VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_2=0, stepLocal_3=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=1, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L76] COND TRUE stepLocal_2 >= ((((last_1_var_1_20) > (last_1_var_1_1)) ? (last_1_var_1_20) : (last_1_var_1_1))) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_3=0, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=1, var_1_36=64, var_1_5=0, var_1_6=16, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L77] COND FALSE !(stepLocal_3 > (last_1_var_1_36 / var_1_7)) [L80] var_1_6 = (var_1_8 - var_1_5) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_12=1, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=-2, var_1_22=0, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=1, var_1_36=64, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=499996/5] [L85] var_1_21 = ((256 + (var_1_8 + var_1_5)) - var_1_6) [L86] var_1_9 = ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11))) [L87] var_1_12 = (var_1_13 || (var_1_14 || var_1_15)) [L88] var_1_22 = (! (var_1_15 || (! var_1_23))) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_24=4999999998/5, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=1, var_1_36=64, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L89] COND TRUE (var_1_17 / 31.375f) < 100.25 [L90] var_1_24 = (var_1_25 + 128.6f) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=1, var_1_36=64, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L92] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=1, var_1_36=64, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L95] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=128, var_1_34=1, var_1_36=64, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L99] var_1_30 = (var_1_12 || (var_1_23 && (var_1_12 || var_1_31))) [L100] var_1_36 = var_1_5 [L101] unsigned char stepLocal_7 = var_1_20; VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_7=1, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=128, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L102] COND TRUE stepLocal_7 < (var_1_20 + var_1_6) [L103] var_1_32 = (var_1_34 + var_1_5) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L107] unsigned char stepLocal_1 = var_1_36 >= var_1_21; VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_1=0, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L108] EXPR (var_1_36 * var_1_21) >> var_1_5 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_1=0, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L108] signed long int stepLocal_0 = (var_1_36 * var_1_21) >> var_1_5; [L109] COND TRUE stepLocal_1 || var_1_22 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_0=0, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L110] COND FALSE !(stepLocal_0 >= 50u) [L113] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L118] unsigned long int stepLocal_5 = var_1_7 * var_1_1; [L119] unsigned long int stepLocal_4 = 1u; VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_4=1, stepLocal_5=0, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=127/2, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L120] COND FALSE !(var_1_20 < stepLocal_4) [L131] var_1_16 = ((((var_1_18) > (((((var_1_17) < (var_1_10)) ? (var_1_17) : (var_1_10))))) ? (var_1_18) : (((((var_1_17) < (var_1_10)) ? (var_1_17) : (var_1_10)))))) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, stepLocal_5=0, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L202] RET step() [L203] CALL, EXPR property() [L192] EXPR ((var_1_36 >= var_1_21) || var_1_22) ? ((((var_1_36 * var_1_21) >> var_1_5) >= 50u) ? (var_1_1 == ((unsigned long int) var_1_5)) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_5)) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L192] EXPR (var_1_36 * var_1_21) >> var_1_5 VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L192] EXPR ((var_1_36 >= var_1_21) || var_1_22) ? ((((var_1_36 * var_1_21) >> var_1_5) >= 50u) ? (var_1_1 == ((unsigned long int) var_1_5)) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_5)) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L192] EXPR ((((((((((((((var_1_36 >= var_1_21) || var_1_22) ? ((((var_1_36 * var_1_21) >> var_1_5) >= 50u) ? (var_1_1 == ((unsigned long int) var_1_5)) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_5))) && ((var_1_5 >= ((((last_1_var_1_20) > (last_1_var_1_1)) ? (last_1_var_1_20) : (last_1_var_1_1)))) ? ((((((var_1_5) > (last_1_var_1_1)) ? (var_1_5) : (last_1_var_1_1))) > (last_1_var_1_36 / var_1_7)) ? (var_1_6 == ((unsigned char) (var_1_5 + 32))) : (var_1_6 == ((unsigned char) (var_1_8 - var_1_5)))) : (var_1_6 == ((unsigned char) var_1_5)))) && (var_1_9 == ((double) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11)))))) && (var_1_12 == ((unsigned char) (var_1_13 || (var_1_14 || var_1_15))))) && ((var_1_20 < 1u) ? ((! (var_1_7 >= var_1_5)) ? ((var_1_20 < (var_1_7 * var_1_1)) ? (var_1_16 == ((double) 31.6)) : (var_1_16 == ((double) (var_1_17 - ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))))) : (var_1_16 == ((double) ((((var_1_18 + var_1_19) < 0 ) ? -(var_1_18 + var_1_19) : (var_1_18 + var_1_19)))))) : (var_1_16 == ((double) ((((var_1_18) > (((((var_1_17) < (var_1_10)) ? (var_1_17) : (var_1_10))))) ? (var_1_18) : (((((var_1_17) < (var_1_10)) ? (var_1_17) : (var_1_10)))))))))) && ((((((last_1_var_1_34) < ((last_1_var_1_6 % var_1_8))) ? (last_1_var_1_34) : ((last_1_var_1_6 % var_1_8)))) >= last_1_var_1_1) ? (var_1_20 == ((unsigned char) (var_1_5 + ((((16) < (1)) ? (16) : (1)))))) : 1)) && (var_1_21 == ((signed long int) ((256 + (var_1_8 + var_1_5)) - var_1_6)))) && (var_1_22 == ((unsigned char) (! (var_1_15 || (! var_1_23)))))) && (((var_1_17 / 31.375f) < 100.25) ? (var_1_24 == ((float) (var_1_25 + 128.6f))) : 1)) && (var_1_14 ? (var_1_26 == ((signed char) (var_1_5 - (var_1_27 - (var_1_28 - var_1_29))))) : (var_1_15 ? (var_1_26 == ((signed char) (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - ((((var_1_5) > (var_1_29)) ? (var_1_5) : (var_1_29)))))) : 1))) && (var_1_30 == ((unsigned char) (var_1_12 || (var_1_23 && (var_1_12 || var_1_31)))))) && ((var_1_20 < (var_1_20 + var_1_6)) ? (var_1_32 == ((signed long int) (var_1_34 + var_1_5))) : (var_1_32 == ((signed long int) (((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) - 16))))) && ((! (((((last_1_var_1_6) > (last_1_var_1_36)) ? (last_1_var_1_6) : (last_1_var_1_36))) > (var_1_29 >> var_1_5))) ? ((last_1_var_1_16 <= var_1_19) ? (var_1_34 == ((signed short int) ((((((var_1_28 - var_1_5)) > (var_1_8)) ? ((var_1_28 - var_1_5)) : (var_1_8))) + last_1_var_1_32))) : 1) : (var_1_34 == ((signed short int) var_1_29))) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L192-L193] return (((((((((((((((var_1_36 >= var_1_21) || var_1_22) ? ((((var_1_36 * var_1_21) >> var_1_5) >= 50u) ? (var_1_1 == ((unsigned long int) var_1_5)) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_5))) && ((var_1_5 >= ((((last_1_var_1_20) > (last_1_var_1_1)) ? (last_1_var_1_20) : (last_1_var_1_1)))) ? ((((((var_1_5) > (last_1_var_1_1)) ? (var_1_5) : (last_1_var_1_1))) > (last_1_var_1_36 / var_1_7)) ? (var_1_6 == ((unsigned char) (var_1_5 + 32))) : (var_1_6 == ((unsigned char) (var_1_8 - var_1_5)))) : (var_1_6 == ((unsigned char) var_1_5)))) && (var_1_9 == ((double) ((((var_1_10) < (var_1_11)) ? (var_1_10) : (var_1_11)))))) && (var_1_12 == ((unsigned char) (var_1_13 || (var_1_14 || var_1_15))))) && ((var_1_20 < 1u) ? ((! (var_1_7 >= var_1_5)) ? ((var_1_20 < (var_1_7 * var_1_1)) ? (var_1_16 == ((double) 31.6)) : (var_1_16 == ((double) (var_1_17 - ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))))) : (var_1_16 == ((double) ((((var_1_18 + var_1_19) < 0 ) ? -(var_1_18 + var_1_19) : (var_1_18 + var_1_19)))))) : (var_1_16 == ((double) ((((var_1_18) > (((((var_1_17) < (var_1_10)) ? (var_1_17) : (var_1_10))))) ? (var_1_18) : (((((var_1_17) < (var_1_10)) ? (var_1_17) : (var_1_10)))))))))) && ((((((last_1_var_1_34) < ((last_1_var_1_6 % var_1_8))) ? (last_1_var_1_34) : ((last_1_var_1_6 % var_1_8)))) >= last_1_var_1_1) ? (var_1_20 == ((unsigned char) (var_1_5 + ((((16) < (1)) ? (16) : (1)))))) : 1)) && (var_1_21 == ((signed long int) ((256 + (var_1_8 + var_1_5)) - var_1_6)))) && (var_1_22 == ((unsigned char) (! (var_1_15 || (! var_1_23)))))) && (((var_1_17 / 31.375f) < 100.25) ? (var_1_24 == ((float) (var_1_25 + 128.6f))) : 1)) && (var_1_14 ? (var_1_26 == ((signed char) (var_1_5 - (var_1_27 - (var_1_28 - var_1_29))))) : (var_1_15 ? (var_1_26 == ((signed char) (((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) - ((((var_1_5) > (var_1_29)) ? (var_1_5) : (var_1_29)))))) : 1))) && (var_1_30 == ((unsigned char) (var_1_12 || (var_1_23 && (var_1_12 || var_1_31)))))) && ((var_1_20 < (var_1_20 + var_1_6)) ? (var_1_32 == ((signed long int) (var_1_34 + var_1_5))) : (var_1_32 == ((signed long int) (((((var_1_6) < (var_1_8)) ? (var_1_6) : (var_1_8))) - 16))))) && ((! (((((last_1_var_1_6) > (last_1_var_1_36)) ? (last_1_var_1_6) : (last_1_var_1_36))) > (var_1_29 >> var_1_5))) ? ((last_1_var_1_16 <= var_1_19) ? (var_1_34 == ((signed short int) ((((((var_1_28 - var_1_5)) > (var_1_8)) ? ((var_1_28 - var_1_5)) : (var_1_8))) + last_1_var_1_32))) : 1) : (var_1_34 == ((signed short int) var_1_29)))) && (var_1_36 == ((unsigned char) var_1_5)) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=127/2, last_1_var_1_1=0, last_1_var_1_20=0, last_1_var_1_32=128, last_1_var_1_34=-25, last_1_var_1_36=64, last_1_var_1_6=16, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=3, var_1_17=0, var_1_18=3, var_1_1=0, var_1_20=1, var_1_21=256, var_1_22=1, var_1_23=1, var_1_26=32, var_1_27=63, var_1_28=31, var_1_29=1, var_1_30=1, var_1_31=1, var_1_32=1, var_1_34=1, var_1_36=0, var_1_5=0, var_1_6=127, var_1_7=65, var_1_8=383, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 10, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1536 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1468 mSDsluCounter, 3845 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2702 mSDsCounter, 561 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2266 IncrementalHoareTripleChecker+Invalid, 2827 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 561 mSolverCounterUnsat, 1143 mSDtfsCounter, 2266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2324 GetRequests, 2195 SyntacticMatches, 5 SemanticMatches, 124 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=9, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 268 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 3149 NumberOfCodeBlocks, 3149 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3123 ConstructedInterpolants, 8 QuantifiedInterpolants, 12887 SizeOfPredicates, 24 NumberOfNonLiveVariables, 2423 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 25201/25984 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-10 07:03:57,775 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-1loop_file-45.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 b4f6e04aab7a375a9a3b1db14655fd21d6933c9320c3b6ac5eeb9864f972d443 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:03:59,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:04:00,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:04:00,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:04:00,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:04:00,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:04:00,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:04:00,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:04:00,109 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:04:00,110 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:04:00,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:04:00,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:04:00,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:04:00,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:04:00,112 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:04:00,113 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:04:00,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:04:00,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:04:00,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:04:00,114 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:04:00,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:04:00,119 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:04:00,119 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:04:00,119 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:04:00,120 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:04:00,120 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:04:00,120 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:04:00,121 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:04:00,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:04:00,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:04:00,121 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:04:00,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:04:00,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:04:00,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:04:00,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:04:00,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:04:00,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:04:00,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:04:00,123 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:04:00,123 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:04:00,124 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:04:00,125 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:04:00,125 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:04:00,126 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:04:00,126 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 -> b4f6e04aab7a375a9a3b1db14655fd21d6933c9320c3b6ac5eeb9864f972d443 [2024-11-10 07:04:00,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:04:00,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:04:00,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:04:00,478 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:04:00,479 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:04:00,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-45.i [2024-11-10 07:04:02,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:04:02,324 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:04:02,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-45.i [2024-11-10 07:04:02,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca107756/a2c5919d102a442aa812a1ab0b8d857c/FLAG2c6a8a3c0 [2024-11-10 07:04:02,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca107756/a2c5919d102a442aa812a1ab0b8d857c [2024-11-10 07:04:02,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:04:02,362 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:04:02,363 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:04:02,363 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:04:02,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:04:02,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f951db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02, skipping insertion in model container [2024-11-10 07:04:02,368 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:04:02,528 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-1loop_file-45.i[916,929] [2024-11-10 07:04:02,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:04:02,638 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:04:02,649 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-1loop_file-45.i[916,929] [2024-11-10 07:04:02,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:04:02,738 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:04:02,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02 WrapperNode [2024-11-10 07:04:02,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:04:02,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:04:02,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:04:02,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:04:02,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,762 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,812 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 209 [2024-11-10 07:04:02,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:04:02,816 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:04:02,818 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:04:02,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:04:02,830 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,833 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,857 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-10 07:04:02,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,875 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,876 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,887 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:04:02,894 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:04:02,895 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:04:02,895 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:04:02,895 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (1/1) ... [2024-11-10 07:04:02,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:04:02,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:04:02,925 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-10 07:04:02,930 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-10 07:04:02,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:04:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:04:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:04:02,969 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:04:02,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:04:02,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:04:03,070 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:04:03,071 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:04:12,791 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-10 07:04:12,792 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:04:12,820 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:04:12,820 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:04:12,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:04:12 BoogieIcfgContainer [2024-11-10 07:04:12,826 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:04:12,828 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:04:12,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:04:12,842 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:04:12,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:04:02" (1/3) ... [2024-11-10 07:04:12,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5558456b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:04:12, skipping insertion in model container [2024-11-10 07:04:12,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:04:02" (2/3) ... [2024-11-10 07:04:12,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5558456b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:04:12, skipping insertion in model container [2024-11-10 07:04:12,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:04:12" (3/3) ... [2024-11-10 07:04:12,846 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-45.i [2024-11-10 07:04:12,887 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:04:12,887 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:04:13,024 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:04:13,038 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;@5764f028, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:04:13,039 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:04:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 07:04:13,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 07:04:13,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:04:13,069 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:04:13,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:04:13,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:04:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash 704311551, now seen corresponding path program 1 times [2024-11-10 07:04:13,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:04:13,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [599698846] [2024-11-10 07:04:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:04:13,098 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-10 07:04:13,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:04:13,104 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-10 07:04:13,105 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-10 07:04:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:04:13,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:04:13,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:04:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 516 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2024-11-10 07:04:13,954 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:04:13,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:04:13,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [599698846] [2024-11-10 07:04:13,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [599698846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:04:13,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:04:13,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:04:13,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340609198] [2024-11-10 07:04:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:04:13,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:04:13,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:04:13,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:04:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:04:13,983 INFO L87 Difference]: Start difference. First operand has 88 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 57 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 07:04:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:04:14,013 INFO L93 Difference]: Finished difference Result 172 states and 291 transitions. [2024-11-10 07:04:14,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:04:14,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-11-10 07:04:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:04:14,025 INFO L225 Difference]: With dead ends: 172 [2024-11-10 07:04:14,026 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 07:04:14,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 186 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-10 07:04:14,033 INFO L432 NwaCegarLoop]: 129 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, 129 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-10 07:04:14,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:04:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 07:04:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-10 07:04:14,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 52 states have internal predecessors, (67), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-10 07:04:14,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2024-11-10 07:04:14,080 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 187 [2024-11-10 07:04:14,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:04:14,081 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2024-11-10 07:04:14,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-11-10 07:04:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2024-11-10 07:04:14,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 07:04:14,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:04:14,084 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:04:14,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 07:04:14,284 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-10 07:04:14,285 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:04:14,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:04:14,286 INFO L85 PathProgramCache]: Analyzing trace with hash -213848034, now seen corresponding path program 1 times [2024-11-10 07:04:14,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:04:14,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462992512] [2024-11-10 07:04:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:04:14,287 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-10 07:04:14,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:04:14,308 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-10 07:04:14,309 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-10 07:04:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:04:14,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 07:04:14,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:04:20,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-10 07:04:20,166 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:04:20,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:04:20,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462992512] [2024-11-10 07:04:20,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462992512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:04:20,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:04:20,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:04:20,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475010048] [2024-11-10 07:04:20,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:04:20,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:04:20,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:04:20,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:04:20,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:04:20,175 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:04:24,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:28,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:33,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:36,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:04:36,792 INFO L93 Difference]: Finished difference Result 245 states and 371 transitions. [2024-11-10 07:04:36,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:04:36,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-11-10 07:04:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:04:36,852 INFO L225 Difference]: With dead ends: 245 [2024-11-10 07:04:36,852 INFO L226 Difference]: Without dead ends: 165 [2024-11-10 07:04:36,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:04:36,856 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 66 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 60 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:04:36,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 342 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 26 Invalid, 3 Unknown, 0 Unchecked, 16.5s Time] [2024-11-10 07:04:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-10 07:04:36,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 142. [2024-11-10 07:04:36,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 81 states have internal predecessors, (98), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:04:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 214 transitions. [2024-11-10 07:04:36,902 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 214 transitions. Word has length 187 [2024-11-10 07:04:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:04:36,903 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 214 transitions. [2024-11-10 07:04:36,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-11-10 07:04:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 214 transitions. [2024-11-10 07:04:36,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-10 07:04:36,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:04:36,910 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:04:36,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 07:04:37,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-10 07:04:37,111 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:04:37,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:04:37,111 INFO L85 PathProgramCache]: Analyzing trace with hash 645183207, now seen corresponding path program 1 times [2024-11-10 07:04:37,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:04:37,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379069865] [2024-11-10 07:04:37,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:04:37,113 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-10 07:04:37,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:04:37,115 INFO L229 MonitoredProcess]: Starting monitored process 4 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-10 07:04:37,116 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 (4)] Waiting until timeout for monitored process [2024-11-10 07:04:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:04:37,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 07:04:37,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:04:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 820 proven. 48 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2024-11-10 07:04:39,686 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:04:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 36 proven. 48 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:04:41,586 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:04:41,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379069865] [2024-11-10 07:04:41,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379069865] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:04:41,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:04:41,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 07:04:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998017446] [2024-11-10 07:04:41,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:04:41,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:04:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:04:41,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:04:41,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:04:41,593 INFO L87 Difference]: Start difference. First operand 142 states and 214 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-10 07:04:47,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:51,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:54,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:54,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:04:54,865 INFO L93 Difference]: Finished difference Result 238 states and 350 transitions. [2024-11-10 07:04:54,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:04:54,937 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 188 [2024-11-10 07:04:54,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:04:54,943 INFO L225 Difference]: With dead ends: 238 [2024-11-10 07:04:54,943 INFO L226 Difference]: Without dead ends: 158 [2024-11-10 07:04:54,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 368 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 07:04:54,947 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 139 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 46 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:04:54,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 212 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 158 Invalid, 2 Unknown, 0 Unchecked, 13.0s Time] [2024-11-10 07:04:54,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-10 07:04:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2024-11-10 07:04:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 87 states have internal predecessors, (103), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-10 07:04:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 219 transitions. [2024-11-10 07:04:54,987 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 219 transitions. Word has length 188 [2024-11-10 07:04:54,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:04:54,988 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 219 transitions. [2024-11-10 07:04:54,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-10 07:04:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 219 transitions. [2024-11-10 07:04:54,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 07:04:54,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:04:54,992 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 07:04:55,021 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 (4)] Forceful destruction successful, exit code 0 [2024-11-10 07:04:55,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-10 07:04:55,193 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:04:55,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:04:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1941933246, now seen corresponding path program 1 times [2024-11-10 07:04:55,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:04:55,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439988662] [2024-11-10 07:04:55,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:04:55,199 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-10 07:04:55,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:04:55,203 INFO L229 MonitoredProcess]: Starting monitored process 5 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-10 07:04:55,204 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 (5)] Waiting until timeout for monitored process [2024-11-10 07:04:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:04:55,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 07:04:55,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:04:57,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 840 proven. 42 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2024-11-10 07:04:57,652 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:04:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 42 proven. 42 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-11-10 07:04:59,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:04:59,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439988662] [2024-11-10 07:04:59,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439988662] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:04:59,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:04:59,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 07:04:59,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729217547] [2024-11-10 07:04:59,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:04:59,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:04:59,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:04:59,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:04:59,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:04:59,718 INFO L87 Difference]: Start difference. First operand 150 states and 219 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44)