./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.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_fillercode_fillercodesize_ps-cn-25_file-68.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 fc81e632ae2e206eca1f9d4133845a59a7f377b1ec66d9f118cf23bdbc748cd0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:28:03,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:28:03,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:28:03,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:28:03,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:28:03,745 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:28:03,746 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:28:03,746 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:28:03,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:28:03,747 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:28:03,747 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:28:03,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:28:03,748 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:28:03,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:28:03,749 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:28:03,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:28:03,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:28:03,750 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:28:03,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:28:03,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:28:03,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:28:03,751 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:28:03,751 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:28:03,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:28:03,752 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:28:03,752 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:28:03,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:28:03,752 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:28:03,753 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:28:03,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:28:03,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:28:03,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:28:03,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:28:03,754 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:28:03,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:28:03,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:28:03,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:28:03,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:28:03,755 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:28:03,755 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:28:03,756 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:28:03,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:28:03,756 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 -> fc81e632ae2e206eca1f9d4133845a59a7f377b1ec66d9f118cf23bdbc748cd0 [2024-11-10 04:28:03,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:28:03,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:28:03,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:28:03,945 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:28:03,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:28:03,947 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2024-11-10 04:28:05,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:28:05,452 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:28:05,456 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2024-11-10 04:28:05,468 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d8d71af/dd523063824c4625ba76c4ad133d89ab/FLAGc74020bae [2024-11-10 04:28:05,827 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94d8d71af/dd523063824c4625ba76c4ad133d89ab [2024-11-10 04:28:05,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:28:05,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:28:05,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:28:05,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:28:05,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:28:05,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:28:05" (1/1) ... [2024-11-10 04:28:05,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@712033e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:05, skipping insertion in model container [2024-11-10 04:28:05,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:28:05" (1/1) ... [2024-11-10 04:28:05,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:28:06,061 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_fillercode_fillercodesize_ps-cn-25_file-68.i[915,928] [2024-11-10 04:28:06,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:28:06,135 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:28:06,145 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_fillercode_fillercodesize_ps-cn-25_file-68.i[915,928] [2024-11-10 04:28:06,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:28:06,181 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:28:06,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06 WrapperNode [2024-11-10 04:28:06,182 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:28:06,183 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:28:06,183 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:28:06,183 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:28:06,188 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (1/1) ... [2024-11-10 04:28:06,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (1/1) ... [2024-11-10 04:28:06,258 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-11-10 04:28:06,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:28:06,259 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:28:06,259 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:28:06,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:28:06,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (1/1) ... [2024-11-10 04:28:06,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (1/1) ... [2024-11-10 04:28:06,275 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (1/1) ... [2024-11-10 04:28:06,297 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 04:28:06,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (1/1) ... [2024-11-10 04:28:06,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (1/1) ... [2024-11-10 04:28:06,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (1/1) ... [2024-11-10 04:28:06,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (1/1) ... [2024-11-10 04:28:06,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (1/1) ... [2024-11-10 04:28:06,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (1/1) ... [2024-11-10 04:28:06,329 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:28:06,331 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:28:06,331 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:28:06,331 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:28:06,332 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (1/1) ... [2024-11-10 04:28:06,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:28:06,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:28:06,363 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 04:28:06,367 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 04:28:06,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:28:06,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:28:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:28:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:28:06,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:28:06,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:28:06,481 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:28:06,483 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:28:06,770 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L170: havoc property_#t~bitwise18#1; [2024-11-10 04:28:06,807 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-10 04:28:06,808 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:28:06,835 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:28:06,835 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:28:06,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:28:06 BoogieIcfgContainer [2024-11-10 04:28:06,836 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:28:06,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:28:06,838 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:28:06,841 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:28:06,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:28:05" (1/3) ... [2024-11-10 04:28:06,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b88cc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:28:06, skipping insertion in model container [2024-11-10 04:28:06,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:06" (2/3) ... [2024-11-10 04:28:06,842 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b88cc21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:28:06, skipping insertion in model container [2024-11-10 04:28:06,842 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:28:06" (3/3) ... [2024-11-10 04:28:06,844 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2024-11-10 04:28:06,860 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:28:06,861 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:28:06,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:28:06,921 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;@157f04f4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:28:06,921 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:28:06,924 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 62 states have (on average 1.403225806451613) internal successors, (87), 63 states have internal predecessors, (87), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 04:28:06,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 04:28:06,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:06,935 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:06,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:06,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1455732699, now seen corresponding path program 1 times [2024-11-10 04:28:06,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:06,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869485256] [2024-11-10 04:28:06,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:06,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:28:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:28:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:28:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:28:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:28:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:28:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:28:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:28:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:28:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:28:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:28:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:28:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:28:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:28:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:28:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:28:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:28:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:28:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:28:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:28:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:28:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:28:07,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:28:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:28:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 04:28:07,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:28:07,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869485256] [2024-11-10 04:28:07,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869485256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:07,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:07,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:28:07,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929317427] [2024-11-10 04:28:07,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:07,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:28:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:28:07,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:28:07,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:28:07,456 INFO L87 Difference]: Start difference. First operand has 89 states, 62 states have (on average 1.403225806451613) internal successors, (87), 63 states have internal predecessors, (87), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 04:28:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:07,507 INFO L93 Difference]: Finished difference Result 168 states and 285 transitions. [2024-11-10 04:28:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:28:07,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 163 [2024-11-10 04:28:07,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:07,557 INFO L225 Difference]: With dead ends: 168 [2024-11-10 04:28:07,558 INFO L226 Difference]: Without dead ends: 82 [2024-11-10 04:28:07,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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 04:28:07,573 INFO L432 NwaCegarLoop]: 123 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, 123 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 04:28:07,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:28:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-10 04:28:07,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-10 04:28:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 04:28:07,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 123 transitions. [2024-11-10 04:28:07,692 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 123 transitions. Word has length 163 [2024-11-10 04:28:07,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:07,693 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 123 transitions. [2024-11-10 04:28:07,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 04:28:07,698 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 123 transitions. [2024-11-10 04:28:07,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 04:28:07,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:07,709 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:07,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:28:07,709 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:07,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1723898331, now seen corresponding path program 1 times [2024-11-10 04:28:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082485491] [2024-11-10 04:28:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:07,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:28:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:28:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:28:08,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:28:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:28:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:28:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:28:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:28:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:28:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:28:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:28:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:28:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:28:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:28:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:28:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:28:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:28:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:28:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:28:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:28:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:28:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:28:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:28:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:28:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 04:28:08,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:28:08,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082485491] [2024-11-10 04:28:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082485491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:08,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:08,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:28:08,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617981586] [2024-11-10 04:28:08,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:08,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:28:08,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:28:08,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:28:08,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:28:08,107 INFO L87 Difference]: Start difference. First operand 82 states and 123 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 04:28:08,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:08,239 INFO L93 Difference]: Finished difference Result 161 states and 243 transitions. [2024-11-10 04:28:08,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:28:08,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2024-11-10 04:28:08,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:08,243 INFO L225 Difference]: With dead ends: 161 [2024-11-10 04:28:08,243 INFO L226 Difference]: Without dead ends: 82 [2024-11-10 04:28:08,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:28:08,244 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 115 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:08,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 172 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:28:08,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-10 04:28:08,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-10 04:28:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 56 states have internal predecessors, (74), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 04:28:08,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2024-11-10 04:28:08,254 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 122 transitions. Word has length 163 [2024-11-10 04:28:08,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:08,259 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 122 transitions. [2024-11-10 04:28:08,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 04:28:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 122 transitions. [2024-11-10 04:28:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-10 04:28:08,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:08,261 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:08,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:28:08,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:08,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:08,262 INFO L85 PathProgramCache]: Analyzing trace with hash -925226644, now seen corresponding path program 1 times [2024-11-10 04:28:08,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:08,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296904693] [2024-11-10 04:28:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:08,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:28:09,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:28:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:28:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:28:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:28:09,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:28:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:28:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:28:09,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:28:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:28:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:28:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:28:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:28:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:28:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:28:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:28:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:28:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:28:09,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:28:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:28:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:28:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:28:09,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:28:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:28:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 04:28:09,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:28:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296904693] [2024-11-10 04:28:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296904693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:09,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:09,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 04:28:09,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409671803] [2024-11-10 04:28:09,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:09,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:28:09,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:28:09,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:28:09,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:28:09,130 INFO L87 Difference]: Start difference. First operand 82 states and 122 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 04:28:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:09,663 INFO L93 Difference]: Finished difference Result 346 states and 514 transitions. [2024-11-10 04:28:09,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 04:28:09,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 164 [2024-11-10 04:28:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:09,666 INFO L225 Difference]: With dead ends: 346 [2024-11-10 04:28:09,666 INFO L226 Difference]: Without dead ends: 267 [2024-11-10 04:28:09,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-10 04:28:09,668 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 274 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:09,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 766 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 04:28:09,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-10 04:28:09,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 152. [2024-11-10 04:28:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 101 states have (on average 1.297029702970297) internal successors, (131), 101 states have internal predecessors, (131), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 04:28:09,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2024-11-10 04:28:09,697 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 164 [2024-11-10 04:28:09,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:09,698 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2024-11-10 04:28:09,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 04:28:09,698 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2024-11-10 04:28:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 04:28:09,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:09,703 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:09,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:28:09,703 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:09,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:09,704 INFO L85 PathProgramCache]: Analyzing trace with hash 715465223, now seen corresponding path program 1 times [2024-11-10 04:28:09,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:09,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206645123] [2024-11-10 04:28:09,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:09,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:28:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:28:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:28:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:28:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:28:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:28:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:28:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:28:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:28:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:28:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:28:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:28:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:28:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:28:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:28:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:28:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:28:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:28:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:28:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:28:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:28:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:28:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:28:10,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:28:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 04:28:10,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:28:10,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206645123] [2024-11-10 04:28:10,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206645123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:10,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:10,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 04:28:10,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645872673] [2024-11-10 04:28:10,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:10,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 04:28:10,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:28:10,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 04:28:10,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 04:28:10,131 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 04:28:10,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:10,536 INFO L93 Difference]: Finished difference Result 314 states and 455 transitions. [2024-11-10 04:28:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 04:28:10,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 165 [2024-11-10 04:28:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:10,540 INFO L225 Difference]: With dead ends: 314 [2024-11-10 04:28:10,543 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 04:28:10,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-10 04:28:10,545 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 237 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:10,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 560 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 04:28:10,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 04:28:10,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 157. [2024-11-10 04:28:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 04:28:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 232 transitions. [2024-11-10 04:28:10,576 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 232 transitions. Word has length 165 [2024-11-10 04:28:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:10,576 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 232 transitions. [2024-11-10 04:28:10,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 04:28:10,576 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 232 transitions. [2024-11-10 04:28:10,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-10 04:28:10,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:10,578 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:10,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:28:10,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:10,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:10,579 INFO L85 PathProgramCache]: Analyzing trace with hash -281607130, now seen corresponding path program 1 times [2024-11-10 04:28:10,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:10,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632668974] [2024-11-10 04:28:10,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:10,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:28:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:28:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:28:10,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:28:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:28:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:28:10,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:28:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:28:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:28:10,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:28:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:28:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:10,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:28:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:28:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 04:28:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 04:28:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 04:28:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 04:28:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 04:28:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 04:28:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 04:28:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 04:28:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 04:28:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 04:28:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 04:28:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 75 proven. 57 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-10 04:28:11,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:28:11,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632668974] [2024-11-10 04:28:11,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632668974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:28:11,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879940964] [2024-11-10 04:28:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:11,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:28:11,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:28:11,061 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 04:28:11,062 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 04:28:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:11,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 04:28:11,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:28:11,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 706 proven. 117 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-11-10 04:28:11,953 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:28:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 75 proven. 60 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-10 04:28:12,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879940964] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:28:12,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:28:12,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 10] total 21 [2024-11-10 04:28:12,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085204177] [2024-11-10 04:28:12,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:28:12,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 04:28:12,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:28:12,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 04:28:12,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2024-11-10 04:28:12,339 INFO L87 Difference]: Start difference. First operand 157 states and 232 transitions. Second operand has 21 states, 21 states have (on average 4.523809523809524) internal successors, (95), 21 states have internal predecessors, (95), 6 states have call successors, (46), 4 states have call predecessors, (46), 9 states have return successors, (49), 6 states have call predecessors, (49), 6 states have call successors, (49) [2024-11-10 04:28:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:13,130 INFO L93 Difference]: Finished difference Result 307 states and 425 transitions. [2024-11-10 04:28:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 04:28:13,131 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.523809523809524) internal successors, (95), 21 states have internal predecessors, (95), 6 states have call successors, (46), 4 states have call predecessors, (46), 9 states have return successors, (49), 6 states have call predecessors, (49), 6 states have call successors, (49) Word has length 165 [2024-11-10 04:28:13,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:13,133 INFO L225 Difference]: With dead ends: 307 [2024-11-10 04:28:13,134 INFO L226 Difference]: Without dead ends: 205 [2024-11-10 04:28:13,135 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=432, Invalid=1208, Unknown=0, NotChecked=0, Total=1640 [2024-11-10 04:28:13,136 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 378 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:13,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 671 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 04:28:13,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-10 04:28:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 185. [2024-11-10 04:28:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 126 states have (on average 1.2301587301587302) internal successors, (155), 126 states have internal predecessors, (155), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 04:28:13,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 251 transitions. [2024-11-10 04:28:13,168 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 251 transitions. Word has length 165 [2024-11-10 04:28:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:13,169 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 251 transitions. [2024-11-10 04:28:13,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.523809523809524) internal successors, (95), 21 states have internal predecessors, (95), 6 states have call successors, (46), 4 states have call predecessors, (46), 9 states have return successors, (49), 6 states have call predecessors, (49), 6 states have call successors, (49) [2024-11-10 04:28:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 251 transitions. [2024-11-10 04:28:13,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-10 04:28:13,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:13,172 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:13,192 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 04:28:13,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:28:13,374 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:13,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:13,374 INFO L85 PathProgramCache]: Analyzing trace with hash 366829200, now seen corresponding path program 1 times [2024-11-10 04:28:13,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:28:13,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20271344] [2024-11-10 04:28:13,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:13,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:28:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:28:13,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2139574660] [2024-11-10 04:28:13,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:13,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:28:13,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:28:13,456 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 04:28:13,457 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 04:28:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:28:13,555 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:28:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:28:13,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:28:13,665 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:28:13,666 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:28:13,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 04:28:13,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 04:28:13,871 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 04:28:13,977 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:28:13,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:28:13 BoogieIcfgContainer [2024-11-10 04:28:13,980 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:28:13,980 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:28:13,980 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:28:13,980 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:28:13,981 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:28:06" (3/4) ... [2024-11-10 04:28:13,982 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:28:13,983 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:28:13,984 INFO L158 Benchmark]: Toolchain (without parser) took 8153.11ms. Allocated memory was 184.5MB in the beginning and 310.4MB in the end (delta: 125.8MB). Free memory was 112.9MB in the beginning and 187.7MB in the end (delta: -74.8MB). Peak memory consumption was 52.6MB. Max. memory is 16.1GB. [2024-11-10 04:28:13,984 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 184.5MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:28:13,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.39ms. Allocated memory is still 184.5MB. Free memory was 112.7MB in the beginning and 147.5MB in the end (delta: -34.8MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2024-11-10 04:28:13,984 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.58ms. Allocated memory is still 184.5MB. Free memory was 147.5MB in the beginning and 143.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:28:13,984 INFO L158 Benchmark]: Boogie Preprocessor took 70.82ms. Allocated memory is still 184.5MB. Free memory was 143.4MB in the beginning and 138.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 04:28:13,985 INFO L158 Benchmark]: IcfgBuilder took 505.24ms. Allocated memory is still 184.5MB. Free memory was 138.3MB in the beginning and 110.9MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-10 04:28:13,985 INFO L158 Benchmark]: TraceAbstraction took 7142.17ms. Allocated memory was 184.5MB in the beginning and 310.4MB in the end (delta: 125.8MB). Free memory was 110.9MB in the beginning and 188.7MB in the end (delta: -77.8MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. [2024-11-10 04:28:13,985 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 310.4MB. Free memory was 188.7MB in the beginning and 187.7MB in the end (delta: 974.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:28:13,986 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.21ms. Allocated memory is still 184.5MB. Free memory is still 141.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.39ms. Allocated memory is still 184.5MB. Free memory was 112.7MB in the beginning and 147.5MB in the end (delta: -34.8MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.58ms. Allocated memory is still 184.5MB. Free memory was 147.5MB in the beginning and 143.4MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.82ms. Allocated memory is still 184.5MB. Free memory was 143.4MB in the beginning and 138.3MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 505.24ms. Allocated memory is still 184.5MB. Free memory was 138.3MB in the beginning and 110.9MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7142.17ms. Allocated memory was 184.5MB in the beginning and 310.4MB in the end (delta: 125.8MB). Free memory was 110.9MB in the beginning and 188.7MB in the end (delta: -77.8MB). Peak memory consumption was 48.9MB. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 310.4MB. Free memory was 188.7MB in the beginning and 187.7MB in the end (delta: 974.8kB). 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 170, overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someBinaryArithmeticDOUBLEoperation at line 59. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_5 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 1; [L26] unsigned char var_1_8 = 32; [L27] double var_1_9 = 4.6; [L28] double var_1_10 = 9.25; [L29] double var_1_11 = 1.25; [L30] unsigned char var_1_12 = 100; [L31] unsigned char var_1_13 = 64; [L32] unsigned char var_1_14 = 0; [L33] float var_1_15 = 7.5; [L34] signed long int var_1_16 = 0; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 0; [L37] unsigned char var_1_19 = 1; [L38] unsigned char var_1_20 = 0; [L39] double var_1_21 = 4.65; [L40] unsigned char var_1_22 = 0; [L41] double var_1_23 = 9999999999.1; [L42] double var_1_24 = 5.5; [L43] unsigned short int var_1_25 = 16; [L44] unsigned short int var_1_26 = 100; [L45] signed long int var_1_27 = 32; [L46] float var_1_28 = 1.95; [L47] unsigned char var_1_29 = 0; [L48] unsigned char var_1_30 = 0; [L49] unsigned long int var_1_31 = 0; [L50] double last_1_var_1_9 = 4.6; [L51] unsigned char last_1_var_1_12 = 100; [L52] unsigned char last_1_var_1_14 = 0; [L53] signed long int last_1_var_1_16 = 0; VAL [isInitial=0, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L174] isInitial = 1 [L175] FCALL initially() [L176] COND TRUE 1 [L177] CALL updateLastVariables() [L164] last_1_var_1_9 = var_1_9 [L165] last_1_var_1_12 = var_1_12 [L166] last_1_var_1_14 = var_1_14 [L167] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L177] RET updateLastVariables() [L178] CALL updateVariables() [L125] var_1_5 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L126] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L127] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L127] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L128] var_1_7 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L129] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L130] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L130] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L131] var_1_8 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L132] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L133] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L133] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L134] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L134] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L135] var_1_10 = __VERIFIER_nondet_double() [L136] 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_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L136] 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_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L137] var_1_13 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L138] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L139] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L139] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L140] var_1_18 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L141] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L142] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L142] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L143] var_1_19 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L144] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L145] CALL assume_abort_if_not(var_1_19 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L145] RET assume_abort_if_not(var_1_19 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L146] var_1_20 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L147] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L148] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L148] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L149] var_1_22 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L150] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L151] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L151] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_23=99999999991/10, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L152] var_1_23 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L153] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_24=11/2, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L154] var_1_24 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L155] RET assume_abort_if_not((var_1_24 >= 0.0F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854765600e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=100, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L156] var_1_26 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L157] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L158] CALL assume_abort_if_not(var_1_26 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L158] RET assume_abort_if_not(var_1_26 <= 65534) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=0, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L159] var_1_30 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_30 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L160] RET assume_abort_if_not(var_1_30 >= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L161] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L161] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L178] RET updateVariables() [L179] CALL step() [L57] var_1_17 = (var_1_18 || (var_1_19 && var_1_20)) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_21=93/20, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L58] COND TRUE ! var_1_22 [L59] var_1_21 = (var_1_23 - ((((7.7) > (var_1_24)) ? (7.7) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_25=16, var_1_26=0, var_1_27=32, var_1_28=39/20, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L61] var_1_25 = var_1_26 [L62] var_1_27 = var_1_25 [L63] var_1_28 = var_1_23 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L64] COND FALSE !(var_1_18 || var_1_17) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L67] COND TRUE var_1_21 >= var_1_28 [L68] var_1_29 = (! var_1_30) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L73] COND TRUE var_1_19 && ((var_1_23 + var_1_28) >= var_1_21) [L74] var_1_31 = var_1_25 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L76] signed long int stepLocal_4 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=100, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L77] COND FALSE !(\read(last_1_var_1_14)) [L88] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L90] var_1_16 = last_1_var_1_12 [L91] unsigned long int stepLocal_6 = var_1_13 % (5u + 256u); [L92] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, stepLocal_6=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L93] COND TRUE stepLocal_6 <= var_1_16 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, stepLocal_5=16, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L94] COND FALSE !(stepLocal_5 >= var_1_16) [L97] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L100] unsigned char stepLocal_0 = var_1_12; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L101] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_0=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L101] COND TRUE stepLocal_0 <= (var_1_12 ^ var_1_12) [L102] var_1_1 = (! var_1_5) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L106] unsigned char stepLocal_2 = var_1_12 < (var_1_16 / var_1_8); [L107] signed long int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_1=100, stepLocal_2=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L108] COND FALSE !(-256 >= stepLocal_1) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_2=0, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L111] COND FALSE !(stepLocal_2 || ((var_1_5 && var_1_7) && var_1_1)) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L115] unsigned char stepLocal_3 = ! var_1_5; VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_3=1, stepLocal_4=0, var_1_11=5/4, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L116] COND TRUE (var_1_7 && var_1_14) || stepLocal_3 [L117] var_1_11 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=15/2, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L119] var_1_15 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=23/5] [L120] COND TRUE ((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8) [L121] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, stepLocal_4=0, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=3] [L179] RET step() [L180] CALL, EXPR property() [L170] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=3] [L170-L171] return ((((((((var_1_12 <= (var_1_12 ^ var_1_12)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_16) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_12 < (var_1_16 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) > (var_1_12)) ? (((((var_1_16) < (var_1_12)) ? (var_1_16) : (var_1_12)))) : (var_1_12))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_14) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (last_1_var_1_14 ? ((var_1_10 >= (- last_1_var_1_9)) ? ((var_1_8 != last_1_var_1_16) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_16) ? (((var_1_13 + 16) >= var_1_16) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) last_1_var_1_12)) ; [L180] RET, EXPR property() [L180] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=3] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=100, last_1_var_1_14=0, last_1_var_1_16=0, last_1_var_1_9=23/5, var_1_10=3, var_1_11=3, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=3, var_1_16=100, var_1_17=0, var_1_18=0, var_1_19=1, var_1_1=1, var_1_20=0, var_1_22=0, var_1_23=2, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=2, var_1_29=0, var_1_30=1, var_1_31=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=101, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 6, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1013 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1004 mSDsluCounter, 2292 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1613 mSDsCounter, 272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1548 IncrementalHoareTripleChecker+Invalid, 1820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 272 mSolverCounterUnsat, 679 mSDtfsCounter, 1548 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 656 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=5, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 213 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1317 NumberOfCodeBlocks, 1317 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1143 ConstructedInterpolants, 0 QuantifiedInterpolants, 3786 SizeOfPredicates, 11 NumberOfNonLiveVariables, 407 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 7494/7728 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 04:28:14,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_fillercode_fillercodesize_ps-cn-25_file-68.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 fc81e632ae2e206eca1f9d4133845a59a7f377b1ec66d9f118cf23bdbc748cd0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:28:15,988 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:28:16,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:28:16,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:28:16,057 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:28:16,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:28:16,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:28:16,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:28:16,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:28:16,088 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:28:16,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:28:16,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:28:16,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:28:16,089 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:28:16,091 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:28:16,091 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:28:16,091 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:28:16,091 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:28:16,091 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:28:16,092 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:28:16,092 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:28:16,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:28:16,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:28:16,095 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:28:16,095 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:28:16,096 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:28:16,096 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:28:16,096 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:28:16,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:28:16,096 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:28:16,096 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:28:16,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:28:16,097 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:28:16,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:28:16,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:28:16,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:28:16,097 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:28:16,097 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:28:16,098 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:28:16,098 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:28:16,098 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:28:16,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:28:16,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:28:16,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:28:16,103 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 -> fc81e632ae2e206eca1f9d4133845a59a7f377b1ec66d9f118cf23bdbc748cd0 [2024-11-10 04:28:16,378 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:28:16,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:28:16,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:28:16,410 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:28:16,411 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:28:16,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2024-11-10 04:28:17,966 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:28:18,181 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:28:18,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2024-11-10 04:28:18,191 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69cfe5b95/02995bdc9c724bee96d1444e0f5d2cdf/FLAGfd7538f01 [2024-11-10 04:28:18,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69cfe5b95/02995bdc9c724bee96d1444e0f5d2cdf [2024-11-10 04:28:18,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:28:18,558 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:28:18,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:28:18,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:28:18,564 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:28:18,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b64529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18, skipping insertion in model container [2024-11-10 04:28:18,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:28:18,742 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_fillercode_fillercodesize_ps-cn-25_file-68.i[915,928] [2024-11-10 04:28:18,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:28:18,815 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:28:18,825 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_fillercode_fillercodesize_ps-cn-25_file-68.i[915,928] [2024-11-10 04:28:18,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:28:18,884 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:28:18,884 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18 WrapperNode [2024-11-10 04:28:18,885 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:28:18,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:28:18,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:28:18,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:28:18,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,931 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-11-10 04:28:18,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:28:18,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:28:18,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:28:18,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:28:18,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,974 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 04:28:18,974 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,974 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,989 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,996 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:18,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:28:19,003 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:28:19,003 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:28:19,003 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:28:19,004 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (1/1) ... [2024-11-10 04:28:19,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:28:19,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:28:19,035 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 04:28:19,042 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 04:28:19,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:28:19,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:28:19,114 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:28:19,114 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:28:19,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:28:19,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:28:19,221 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:28:19,222 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:28:20,657 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-10 04:28:20,657 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:28:20,667 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:28:20,668 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:28:20,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:28:20 BoogieIcfgContainer [2024-11-10 04:28:20,668 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:28:20,669 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:28:20,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:28:20,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:28:20,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:28:18" (1/3) ... [2024-11-10 04:28:20,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ac2a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:28:20, skipping insertion in model container [2024-11-10 04:28:20,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:28:18" (2/3) ... [2024-11-10 04:28:20,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ac2a8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:28:20, skipping insertion in model container [2024-11-10 04:28:20,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:28:20" (3/3) ... [2024-11-10 04:28:20,674 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-68.i [2024-11-10 04:28:20,686 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:28:20,687 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:28:20,761 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:28:20,767 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;@61250722, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:28:20,768 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:28:20,771 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 04:28:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 04:28:20,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:20,784 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:20,784 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:20,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:20,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2090090670, now seen corresponding path program 1 times [2024-11-10 04:28:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:28:20,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003644023] [2024-11-10 04:28:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:20,804 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 04:28:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:28:20,807 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 04:28:20,808 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 04:28:21,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:28:21,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:28:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2024-11-10 04:28:21,170 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:28:21,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:28:21,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003644023] [2024-11-10 04:28:21,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003644023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:21,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:21,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:28:21,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008835598] [2024-11-10 04:28:21,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:21,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:28:21,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:28:21,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:28:21,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:28:21,196 INFO L87 Difference]: Start difference. First operand has 80 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 04:28:21,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:21,232 INFO L93 Difference]: Finished difference Result 152 states and 257 transitions. [2024-11-10 04:28:21,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:28:21,235 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 160 [2024-11-10 04:28:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:21,240 INFO L225 Difference]: With dead ends: 152 [2024-11-10 04:28:21,240 INFO L226 Difference]: Without dead ends: 75 [2024-11-10 04:28:21,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 159 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 04:28:21,251 INFO L432 NwaCegarLoop]: 112 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, 112 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 04:28:21,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:28:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-10 04:28:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-10 04:28:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-10 04:28:21,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 112 transitions. [2024-11-10 04:28:21,285 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 112 transitions. Word has length 160 [2024-11-10 04:28:21,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:21,286 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 112 transitions. [2024-11-10 04:28:21,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-10 04:28:21,287 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 112 transitions. [2024-11-10 04:28:21,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-10 04:28:21,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:21,291 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:21,301 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 04:28:21,495 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 04:28:21,496 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:21,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:21,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2030854482, now seen corresponding path program 1 times [2024-11-10 04:28:21,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:28:21,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084563804] [2024-11-10 04:28:21,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:21,498 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 04:28:21,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:28:21,501 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 04:28:21,502 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 04:28:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:21,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 04:28:21,804 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:28:22,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 689 proven. 57 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-11-10 04:28:22,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:28:22,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 75 proven. 60 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-10 04:28:22,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:28:22,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084563804] [2024-11-10 04:28:22,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084563804] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:28:22,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:28:22,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-10 04:28:22,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291227907] [2024-11-10 04:28:22,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:28:22,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 04:28:22,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:28:22,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 04:28:22,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-10 04:28:22,650 INFO L87 Difference]: Start difference. First operand 75 states and 112 transitions. Second operand has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2024-11-10 04:28:23,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:23,476 INFO L93 Difference]: Finished difference Result 185 states and 266 transitions. [2024-11-10 04:28:23,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 04:28:23,479 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) Word has length 160 [2024-11-10 04:28:23,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:23,481 INFO L225 Difference]: With dead ends: 185 [2024-11-10 04:28:23,481 INFO L226 Difference]: Without dead ends: 113 [2024-11-10 04:28:23,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 306 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=193, Invalid=359, Unknown=0, NotChecked=0, Total=552 [2024-11-10 04:28:23,485 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 240 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:23,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 374 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 04:28:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-10 04:28:23,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2024-11-10 04:28:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 66 states have internal predecessors, (79), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 04:28:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 147 transitions. [2024-11-10 04:28:23,512 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 147 transitions. Word has length 160 [2024-11-10 04:28:23,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:23,512 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 147 transitions. [2024-11-10 04:28:23,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (36), 3 states have call predecessors, (36), 7 states have return successors, (37), 3 states have call predecessors, (37), 3 states have call successors, (37) [2024-11-10 04:28:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 147 transitions. [2024-11-10 04:28:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 04:28:23,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:23,517 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:23,528 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 04:28:23,717 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 04:28:23,718 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:23,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:23,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1609410124, now seen corresponding path program 1 times [2024-11-10 04:28:23,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:28:23,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630225016] [2024-11-10 04:28:23,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:23,719 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 04:28:23,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:28:23,722 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 04:28:23,735 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 04:28:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:23,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 04:28:23,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:28:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 04:28:24,282 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:28:24,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:28:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630225016] [2024-11-10 04:28:24,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630225016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:24,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:24,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 04:28:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359062951] [2024-11-10 04:28:24,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:24,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 04:28:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:28:24,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 04:28:24,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 04:28:24,296 INFO L87 Difference]: Start difference. First operand 104 states and 147 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 04:28:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:25,800 INFO L93 Difference]: Finished difference Result 355 states and 493 transitions. [2024-11-10 04:28:25,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 04:28:25,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-10 04:28:25,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:25,813 INFO L225 Difference]: With dead ends: 355 [2024-11-10 04:28:25,813 INFO L226 Difference]: Without dead ends: 271 [2024-11-10 04:28:25,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-10 04:28:25,815 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 210 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:25,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 601 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 04:28:25,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-10 04:28:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 152. [2024-11-10 04:28:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 96 states have (on average 1.21875) internal successors, (117), 96 states have internal predecessors, (117), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 04:28:25,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 213 transitions. [2024-11-10 04:28:25,856 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 213 transitions. Word has length 161 [2024-11-10 04:28:25,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:25,856 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 213 transitions. [2024-11-10 04:28:25,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 04:28:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 213 transitions. [2024-11-10 04:28:25,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-10 04:28:25,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:25,862 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:25,886 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 (4)] Ended with exit code 0 [2024-11-10 04:28:26,063 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 04:28:26,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:26,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1480327405, now seen corresponding path program 1 times [2024-11-10 04:28:26,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:28:26,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106632516] [2024-11-10 04:28:26,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:26,069 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 04:28:26,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:28:26,072 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 04:28:26,073 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 04:28:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:26,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 04:28:26,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:28:26,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-10 04:28:26,402 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:28:26,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:28:26,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106632516] [2024-11-10 04:28:26,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106632516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:28:26,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:28:26,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 04:28:26,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597016434] [2024-11-10 04:28:26,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:28:26,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 04:28:26,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:28:26,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 04:28:26,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 04:28:26,404 INFO L87 Difference]: Start difference. First operand 152 states and 213 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 04:28:26,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:28:26,748 INFO L93 Difference]: Finished difference Result 236 states and 330 transitions. [2024-11-10 04:28:26,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 04:28:26,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-10 04:28:26,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:28:26,767 INFO L225 Difference]: With dead ends: 236 [2024-11-10 04:28:26,767 INFO L226 Difference]: Without dead ends: 152 [2024-11-10 04:28:26,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 04:28:26,769 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 105 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:28:26,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 199 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 04:28:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-10 04:28:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-10 04:28:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 96 states have internal predecessors, (116), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-10 04:28:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 212 transitions. [2024-11-10 04:28:26,795 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 212 transitions. Word has length 161 [2024-11-10 04:28:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:28:26,796 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 212 transitions. [2024-11-10 04:28:26,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-10 04:28:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 212 transitions. [2024-11-10 04:28:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 04:28:26,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:28:26,798 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:28:26,810 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 (5)] Forceful destruction successful, exit code 0 [2024-11-10 04:28:26,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 04:28:26,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:28:27,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:28:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -200977545, now seen corresponding path program 1 times [2024-11-10 04:28:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:28:27,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754650624] [2024-11-10 04:28:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:27,002 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 04:28:27,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:28:27,005 INFO L229 MonitoredProcess]: Starting monitored process 6 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 04:28:27,006 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 (6)] Waiting until timeout for monitored process [2024-11-10 04:28:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:27,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 04:28:27,258 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:28:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 417 proven. 114 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-10 04:28:28,183 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:28:29,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:28:29,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754650624] [2024-11-10 04:28:29,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754650624] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:28:29,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2055991413] [2024-11-10 04:28:29,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:28:29,506 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 04:28:29,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 04:28:29,511 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 04:28:29,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-10 04:28:30,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:28:30,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 04:28:30,522 INFO L278 TraceCheckSpWp]: Computing forward predicates...