./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.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 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:06:28,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:06:28,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 01:06:28,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:06:28,119 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:06:28,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:06:28,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:06:28,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:06:28,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:06:28,144 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:06:28,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:06:28,145 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:06:28,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:06:28,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:06:28,145 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:06:28,146 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:06:28,146 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:06:28,146 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:06:28,146 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 01:06:28,146 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:06:28,146 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:06:28,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:06:28,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:06:28,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:06:28,151 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:06:28,151 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:06:28,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:06:28,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:06:28,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:06:28,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:06:28,151 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:06:28,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:06:28,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:06:28,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:06:28,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:06:28,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:06:28,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 01:06:28,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 01:06:28,153 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:06:28,153 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:06:28,153 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:06:28,153 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:06:28,153 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 -> 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d [2024-10-13 01:06:28,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:06:28,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:06:28,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:06:28,348 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:06:28,349 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:06:28,349 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-13 01:06:29,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:06:29,700 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:06:29,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-13 01:06:29,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89302e15a/4a33bd7c60824be1828453531f9460f4/FLAG5326a4b14 [2024-10-13 01:06:29,724 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89302e15a/4a33bd7c60824be1828453531f9460f4 [2024-10-13 01:06:29,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:06:29,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:06:29,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:06:29,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:06:29,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:06:29,734 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:06:29" (1/1) ... [2024-10-13 01:06:29,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f063c8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:29, skipping insertion in model container [2024-10-13 01:06:29,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:06:29" (1/1) ... [2024-10-13 01:06:29,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:06:29,881 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i[915,928] [2024-10-13 01:06:29,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:06:29,989 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:06:30,002 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i[915,928] [2024-10-13 01:06:30,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:06:30,051 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:06:30,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30 WrapperNode [2024-10-13 01:06:30,054 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:06:30,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:06:30,055 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:06:30,055 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:06:30,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (1/1) ... [2024-10-13 01:06:30,069 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (1/1) ... [2024-10-13 01:06:30,102 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2024-10-13 01:06:30,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:06:30,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:06:30,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:06:30,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:06:30,111 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (1/1) ... [2024-10-13 01:06:30,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (1/1) ... [2024-10-13 01:06:30,114 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (1/1) ... [2024-10-13 01:06:30,126 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:06:30,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (1/1) ... [2024-10-13 01:06:30,127 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (1/1) ... [2024-10-13 01:06:30,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (1/1) ... [2024-10-13 01:06:30,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (1/1) ... [2024-10-13 01:06:30,138 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (1/1) ... [2024-10-13 01:06:30,140 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (1/1) ... [2024-10-13 01:06:30,147 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:06:30,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:06:30,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:06:30,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:06:30,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (1/1) ... [2024-10-13 01:06:30,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:06:30,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:06:30,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:06:30,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:06:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:06:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:06:30,210 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:06:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 01:06:30,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:06:30,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:06:30,278 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:06:30,280 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:06:30,573 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-13 01:06:30,573 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:06:30,603 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:06:30,604 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:06:30,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:30 BoogieIcfgContainer [2024-10-13 01:06:30,605 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:06:30,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:06:30,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:06:30,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:06:30,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:06:29" (1/3) ... [2024-10-13 01:06:30,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b534806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:06:30, skipping insertion in model container [2024-10-13 01:06:30,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:30" (2/3) ... [2024-10-13 01:06:30,612 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b534806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:06:30, skipping insertion in model container [2024-10-13 01:06:30,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:30" (3/3) ... [2024-10-13 01:06:30,613 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-13 01:06:30,624 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:06:30,625 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:06:30,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:06:30,681 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;@6b242489, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:06:30,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:06:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-13 01:06:30,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-13 01:06:30,697 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:30,698 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:30,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:30,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:30,702 INFO L85 PathProgramCache]: Analyzing trace with hash 258799246, now seen corresponding path program 1 times [2024-10-13 01:06:30,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:30,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258955654] [2024-10-13 01:06:30,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:30,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:30,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:06:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:30,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:06:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:30,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:06:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:30,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:06:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:30,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:06:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:06:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:06:31,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:06:31,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:06:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:06:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:06:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:06:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:06:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:06:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:06:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:06:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:06:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:06:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:06:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:06:31,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:06:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:06:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:06:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:06:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 01:06:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:06:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:06:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:06:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:06:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:06:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:06:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 01:06:31,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:31,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258955654] [2024-10-13 01:06:31,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258955654] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:31,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:31,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 01:06:31,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605434736] [2024-10-13 01:06:31,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:31,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 01:06:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:31,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 01:06:31,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:06:31,127 INFO L87 Difference]: Start difference. First operand has 89 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 01:06:31,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:31,190 INFO L93 Difference]: Finished difference Result 175 states and 311 transitions. [2024-10-13 01:06:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 01:06:31,193 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2024-10-13 01:06:31,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:31,199 INFO L225 Difference]: With dead ends: 175 [2024-10-13 01:06:31,199 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 01:06:31,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 01:06:31,207 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:31,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 133 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:06:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 01:06:31,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-13 01:06:31,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-13 01:06:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2024-10-13 01:06:31,248 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 136 transitions. Word has length 197 [2024-10-13 01:06:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:31,248 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 136 transitions. [2024-10-13 01:06:31,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 01:06:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2024-10-13 01:06:31,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-13 01:06:31,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:31,252 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:31,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 01:06:31,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:31,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1884942792, now seen corresponding path program 1 times [2024-10-13 01:06:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:31,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973678457] [2024-10-13 01:06:31,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:31,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:06:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:06:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:06:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:06:31,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:06:31,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:06:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:06:31,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:06:31,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:06:31,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:06:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:06:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:06:31,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:06:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:06:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:06:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:06:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:06:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:06:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:06:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:06:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:06:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:06:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:06:31,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:06:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 01:06:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:06:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:06:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:06:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:06:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:06:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:06:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:31,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 01:06:31,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:31,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973678457] [2024-10-13 01:06:31,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973678457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:31,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:31,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:06:31,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438239435] [2024-10-13 01:06:31,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:31,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:06:31,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:31,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:06:31,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:06:31,795 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:31,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:31,991 INFO L93 Difference]: Finished difference Result 260 states and 407 transitions. [2024-10-13 01:06:31,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:06:31,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 197 [2024-10-13 01:06:31,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:31,994 INFO L225 Difference]: With dead ends: 260 [2024-10-13 01:06:31,995 INFO L226 Difference]: Without dead ends: 174 [2024-10-13 01:06:31,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:06:31,996 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 109 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:31,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 393 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:06:31,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-13 01:06:32,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 154. [2024-10-13 01:06:32,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 89 states have internal predecessors, (117), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-13 01:06:32,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 241 transitions. [2024-10-13 01:06:32,018 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 241 transitions. Word has length 197 [2024-10-13 01:06:32,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:32,019 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 241 transitions. [2024-10-13 01:06:32,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 241 transitions. [2024-10-13 01:06:32,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 01:06:32,021 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:32,021 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:32,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 01:06:32,022 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:32,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:32,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1930462375, now seen corresponding path program 1 times [2024-10-13 01:06:32,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:32,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610676880] [2024-10-13 01:06:32,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:32,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:06:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:06:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:06:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:06:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:06:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:06:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:06:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:06:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:06:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:06:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:06:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:06:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:06:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:06:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:06:32,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:06:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:06:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:06:32,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:06:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:06:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:06:32,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:06:32,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:06:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:06:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 01:06:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:06:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:06:32,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:06:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:06:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:06:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:06:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 01:06:32,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:32,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610676880] [2024-10-13 01:06:32,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610676880] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:32,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:32,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 01:06:32,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289507274] [2024-10-13 01:06:32,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:32,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:06:32,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:32,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:06:32,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:06:32,425 INFO L87 Difference]: Start difference. First operand 154 states and 241 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:32,703 INFO L93 Difference]: Finished difference Result 369 states and 577 transitions. [2024-10-13 01:06:32,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 01:06:32,703 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2024-10-13 01:06:32,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:32,709 INFO L225 Difference]: With dead ends: 369 [2024-10-13 01:06:32,712 INFO L226 Difference]: Without dead ends: 283 [2024-10-13 01:06:32,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:06:32,713 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 138 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:32,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 516 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:06:32,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-10-13 01:06:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 238. [2024-10-13 01:06:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 141 states have (on average 1.3333333333333333) internal successors, (188), 141 states have internal predecessors, (188), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-10-13 01:06:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 374 transitions. [2024-10-13 01:06:32,758 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 374 transitions. Word has length 198 [2024-10-13 01:06:32,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:32,758 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 374 transitions. [2024-10-13 01:06:32,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:32,758 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 374 transitions. [2024-10-13 01:06:32,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 01:06:32,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:32,761 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:32,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 01:06:32,761 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:32,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:32,761 INFO L85 PathProgramCache]: Analyzing trace with hash 919345125, now seen corresponding path program 1 times [2024-10-13 01:06:32,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:32,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407496294] [2024-10-13 01:06:32,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:32,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:32,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:06:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:06:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:06:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:06:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:06:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:06:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:06:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:06:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:06:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:06:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:06:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:06:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:06:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:06:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:06:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:06:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:06:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:06:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:06:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:06:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:06:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:06:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:06:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:06:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 01:06:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:06:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:06:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:06:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:06:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:06:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:06:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 01:06:32,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:32,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407496294] [2024-10-13 01:06:32,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407496294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:32,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:32,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:06:32,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740373466] [2024-10-13 01:06:32,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:32,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:06:32,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:32,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:06:32,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:06:32,975 INFO L87 Difference]: Start difference. First operand 238 states and 374 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:33,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:33,039 INFO L93 Difference]: Finished difference Result 548 states and 857 transitions. [2024-10-13 01:06:33,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:06:33,040 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 198 [2024-10-13 01:06:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:33,044 INFO L225 Difference]: With dead ends: 548 [2024-10-13 01:06:33,045 INFO L226 Difference]: Without dead ends: 376 [2024-10-13 01:06:33,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:06:33,047 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 100 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:33,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 251 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 01:06:33,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-13 01:06:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 372. [2024-10-13 01:06:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 222 states have (on average 1.3288288288288288) internal successors, (295), 224 states have internal predecessors, (295), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2024-10-13 01:06:33,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 581 transitions. [2024-10-13 01:06:33,124 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 581 transitions. Word has length 198 [2024-10-13 01:06:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:33,126 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 581 transitions. [2024-10-13 01:06:33,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:33,126 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 581 transitions. [2024-10-13 01:06:33,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 01:06:33,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:33,131 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:33,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 01:06:33,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:33,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:33,131 INFO L85 PathProgramCache]: Analyzing trace with hash -669002777, now seen corresponding path program 1 times [2024-10-13 01:06:33,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:33,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657175009] [2024-10-13 01:06:33,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:33,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 01:06:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 01:06:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 01:06:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 01:06:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 01:06:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 01:06:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 01:06:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 01:06:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 01:06:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 01:06:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 01:06:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 01:06:33,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 01:06:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 01:06:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 01:06:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-13 01:06:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 01:06:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-13 01:06:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 01:06:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-13 01:06:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 01:06:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-13 01:06:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-13 01:06:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-13 01:06:33,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-13 01:06:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-13 01:06:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-13 01:06:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-13 01:06:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 01:06:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 01:06:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 01:06:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 51 proven. 123 refuted. 0 times theorem prover too weak. 1686 trivial. 0 not checked. [2024-10-13 01:06:33,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:33,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657175009] [2024-10-13 01:06:33,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657175009] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:06:33,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419988044] [2024-10-13 01:06:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:33,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:33,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:06:33,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:06:33,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 01:06:33,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:33,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 01:06:33,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 947 proven. 123 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2024-10-13 01:06:34,503 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:06:34,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 51 proven. 126 refuted. 0 times theorem prover too weak. 1683 trivial. 0 not checked. [2024-10-13 01:06:34,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419988044] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 01:06:34,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 01:06:34,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2024-10-13 01:06:34,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757061293] [2024-10-13 01:06:34,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 01:06:34,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 01:06:34,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:34,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 01:06:34,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:06:34,926 INFO L87 Difference]: Start difference. First operand 372 states and 581 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2024-10-13 01:06:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:35,888 INFO L93 Difference]: Finished difference Result 1138 states and 1678 transitions. [2024-10-13 01:06:35,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-10-13 01:06:35,888 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) Word has length 198 [2024-10-13 01:06:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:35,894 INFO L225 Difference]: With dead ends: 1138 [2024-10-13 01:06:35,894 INFO L226 Difference]: Without dead ends: 989 [2024-10-13 01:06:35,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 452 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1584, Unknown=0, NotChecked=0, Total=2162 [2024-10-13 01:06:35,896 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 518 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:35,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 681 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:06:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2024-10-13 01:06:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 593. [2024-10-13 01:06:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 371 states have (on average 1.3018867924528301) internal successors, (483), 374 states have internal predecessors, (483), 199 states have call successors, (199), 22 states have call predecessors, (199), 22 states have return successors, (199), 196 states have call predecessors, (199), 199 states have call successors, (199) [2024-10-13 01:06:35,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 881 transitions. [2024-10-13 01:06:35,974 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 881 transitions. Word has length 198 [2024-10-13 01:06:35,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:35,974 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 881 transitions. [2024-10-13 01:06:35,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (56), 3 states have call predecessors, (56), 3 states have call successors, (56) [2024-10-13 01:06:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 881 transitions. [2024-10-13 01:06:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 01:06:35,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:35,976 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:35,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 01:06:36,177 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-10-13 01:06:36,178 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:36,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1255808791, now seen corresponding path program 1 times [2024-10-13 01:06:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:36,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457272095] [2024-10-13 01:06:36,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:06:36,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918133281] [2024-10-13 01:06:36,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:36,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:36,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:06:36,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:06:36,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 01:06:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:36,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-13 01:06:36,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 288 proven. 162 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-13 01:06:37,343 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:06:37,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:37,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457272095] [2024-10-13 01:06:37,888 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 01:06:37,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918133281] [2024-10-13 01:06:37,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918133281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:06:37,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:06:37,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-10-13 01:06:37,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541699901] [2024-10-13 01:06:37,889 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 01:06:37,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 01:06:37,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:37,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 01:06:37,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=237, Unknown=6, NotChecked=0, Total=342 [2024-10-13 01:06:37,890 INFO L87 Difference]: Start difference. First operand 593 states and 881 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-13 01:06:38,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:38,566 INFO L93 Difference]: Finished difference Result 1722 states and 2480 transitions. [2024-10-13 01:06:38,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 01:06:38,567 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 198 [2024-10-13 01:06:38,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:38,574 INFO L225 Difference]: With dead ends: 1722 [2024-10-13 01:06:38,574 INFO L226 Difference]: Without dead ends: 1396 [2024-10-13 01:06:38,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=324, Invalid=726, Unknown=6, NotChecked=0, Total=1056 [2024-10-13 01:06:38,576 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 163 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:38,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 902 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 01:06:38,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-10-13 01:06:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1226. [2024-10-13 01:06:38,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 792 states have (on average 1.2916666666666667) internal successors, (1023), 802 states have internal predecessors, (1023), 375 states have call successors, (375), 58 states have call predecessors, (375), 58 states have return successors, (375), 365 states have call predecessors, (375), 375 states have call successors, (375) [2024-10-13 01:06:38,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1773 transitions. [2024-10-13 01:06:38,687 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1773 transitions. Word has length 198 [2024-10-13 01:06:38,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:38,687 INFO L471 AbstractCegarLoop]: Abstraction has 1226 states and 1773 transitions. [2024-10-13 01:06:38,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (31), 3 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-13 01:06:38,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1773 transitions. [2024-10-13 01:06:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-10-13 01:06:38,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:38,690 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:38,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 01:06:38,890 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-10-13 01:06:38,891 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:38,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:38,892 INFO L85 PathProgramCache]: Analyzing trace with hash -997643353, now seen corresponding path program 1 times [2024-10-13 01:06:38,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:38,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662598902] [2024-10-13 01:06:38,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:06:38,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1688976256] [2024-10-13 01:06:38,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:38,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:38,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:06:38,974 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:06:38,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 01:06:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:39,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 01:06:39,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-13 01:06:40,444 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:06:40,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 01:06:40,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662598902] [2024-10-13 01:06:40,947 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 01:06:40,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688976256] [2024-10-13 01:06:40,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688976256] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:06:40,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:06:40,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-10-13 01:06:40,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704438853] [2024-10-13 01:06:40,947 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-13 01:06:40,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 01:06:40,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 01:06:40,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 01:06:40,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=158, Unknown=1, NotChecked=0, Total=210 [2024-10-13 01:06:40,949 INFO L87 Difference]: Start difference. First operand 1226 states and 1773 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 01:06:41,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:41,766 INFO L93 Difference]: Finished difference Result 2351 states and 3406 transitions. [2024-10-13 01:06:41,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 01:06:41,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 198 [2024-10-13 01:06:41,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:41,774 INFO L225 Difference]: With dead ends: 2351 [2024-10-13 01:06:41,774 INFO L226 Difference]: Without dead ends: 1854 [2024-10-13 01:06:41,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=466, Unknown=1, NotChecked=0, Total=650 [2024-10-13 01:06:41,777 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 134 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 74 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:41,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 949 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 630 Invalid, 6 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:06:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854 states. [2024-10-13 01:06:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1582. [2024-10-13 01:06:41,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1582 states, 1016 states have (on average 1.280511811023622) internal successors, (1301), 1028 states have internal predecessors, (1301), 487 states have call successors, (487), 78 states have call predecessors, (487), 78 states have return successors, (487), 475 states have call predecessors, (487), 487 states have call successors, (487) [2024-10-13 01:06:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1582 states to 1582 states and 2275 transitions. [2024-10-13 01:06:41,926 INFO L78 Accepts]: Start accepts. Automaton has 1582 states and 2275 transitions. Word has length 198 [2024-10-13 01:06:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:41,927 INFO L471 AbstractCegarLoop]: Abstraction has 1582 states and 2275 transitions. [2024-10-13 01:06:41,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 01:06:41,927 INFO L276 IsEmpty]: Start isEmpty. Operand 1582 states and 2275 transitions. [2024-10-13 01:06:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-13 01:06:41,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:41,930 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:41,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 01:06:42,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:42,133 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:42,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:42,134 INFO L85 PathProgramCache]: Analyzing trace with hash 914456943, now seen corresponding path program 1 times [2024-10-13 01:06:42,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 01:06:42,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476382239] [2024-10-13 01:06:42,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:42,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 01:06:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 01:06:42,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1319071708] [2024-10-13 01:06:42,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:42,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:42,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:06:42,194 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 01:06:42,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 01:06:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:06:42,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 01:06:42,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 01:06:42,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 01:06:42,471 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 01:06:42,472 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 01:06:42,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 01:06:42,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 01:06:42,680 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:42,778 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 01:06:42,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 01:06:42 BoogieIcfgContainer [2024-10-13 01:06:42,780 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 01:06:42,781 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 01:06:42,781 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 01:06:42,781 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 01:06:42,781 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:30" (3/4) ... [2024-10-13 01:06:42,783 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 01:06:42,784 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 01:06:42,784 INFO L158 Benchmark]: Toolchain (without parser) took 13057.05ms. Allocated memory was 174.1MB in the beginning and 398.5MB in the end (delta: 224.4MB). Free memory was 105.3MB in the beginning and 305.3MB in the end (delta: -200.0MB). Peak memory consumption was 25.8MB. Max. memory is 16.1GB. [2024-10-13 01:06:42,784 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:06:42,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.12ms. Allocated memory is still 174.1MB. Free memory was 105.1MB in the beginning and 139.9MB in the end (delta: -34.9MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2024-10-13 01:06:42,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.95ms. Allocated memory is still 174.1MB. Free memory was 139.9MB in the beginning and 136.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 01:06:42,785 INFO L158 Benchmark]: Boogie Preprocessor took 44.70ms. Allocated memory is still 174.1MB. Free memory was 135.8MB in the beginning and 130.2MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 01:06:42,785 INFO L158 Benchmark]: RCFGBuilder took 456.79ms. Allocated memory is still 174.1MB. Free memory was 130.2MB in the beginning and 99.4MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-13 01:06:42,785 INFO L158 Benchmark]: TraceAbstraction took 12174.36ms. Allocated memory was 174.1MB in the beginning and 398.5MB in the end (delta: 224.4MB). Free memory was 98.7MB in the beginning and 305.3MB in the end (delta: -206.6MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-10-13 01:06:42,785 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 398.5MB. Free memory is still 305.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 01:06:42,786 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.12ms. Allocated memory is still 117.4MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.12ms. Allocated memory is still 174.1MB. Free memory was 105.1MB in the beginning and 139.9MB in the end (delta: -34.9MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.95ms. Allocated memory is still 174.1MB. Free memory was 139.9MB in the beginning and 136.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.70ms. Allocated memory is still 174.1MB. Free memory was 135.8MB in the beginning and 130.2MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 456.79ms. Allocated memory is still 174.1MB. Free memory was 130.2MB in the beginning and 99.4MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 12174.36ms. Allocated memory was 174.1MB in the beginning and 398.5MB in the end (delta: 224.4MB). Free memory was 98.7MB in the beginning and 305.3MB in the end (delta: -206.6MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 398.5MB. Free memory is still 305.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 186, overapproximation of someUnaryDOUBLEoperation at line 30, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 16; [L23] signed char var_1_5 = -8; [L24] unsigned char var_1_6 = 10; [L25] unsigned char var_1_7 = 128; [L26] unsigned char var_1_8 = 1; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 0; [L29] signed short int var_1_13 = 200; [L30] float var_1_14 = -0.8; [L31] float var_1_15 = 127.25; [L32] float var_1_16 = 3.5; [L33] unsigned short int var_1_17 = 16; [L34] unsigned char var_1_19 = 1; [L35] unsigned char var_1_20 = 0; [L36] unsigned char var_1_21 = 0; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 1; [L39] signed short int var_1_24 = -32; [L40] unsigned char var_1_25 = 1; [L41] float var_1_26 = 500.65; [L42] signed long int var_1_27 = -8; [L43] unsigned long int var_1_28 = 10; [L44] signed short int var_1_29 = -256; [L45] signed char var_1_30 = 1; [L46] float var_1_31 = 7.8; [L47] float var_1_32 = 63.25; [L48] float var_1_33 = 0.4; [L49] float var_1_34 = 64.875; [L50] float var_1_35 = 1.3; [L51] unsigned short int var_1_36 = 100; [L52] signed short int last_1_var_1_1 = 16; [L53] unsigned char last_1_var_1_6 = 10; [L54] unsigned char last_1_var_1_8 = 1; [L55] signed short int last_1_var_1_13 = 200; [L190] isInitial = 1 [L191] FCALL initially() [L192] COND TRUE 1 [L193] CALL updateLastVariables() [L180] last_1_var_1_1 = var_1_1 [L181] last_1_var_1_6 = var_1_6 [L182] last_1_var_1_8 = var_1_8 [L183] last_1_var_1_13 = var_1_13 [L193] RET updateLastVariables() [L194] CALL updateVariables() [L129] var_1_5 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L130] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L131] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L131] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=128, var_1_8=1] [L132] var_1_7 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L133] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L134] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L134] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=0, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L135] var_1_11 = __VERIFIER_nondet_uchar() [L136] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L136] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L137] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L137] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L138] var_1_12 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L139] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L140] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L140] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_15=509/4, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L141] var_1_15 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L142] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_16=7/2, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L143] var_1_16 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L144] RET assume_abort_if_not((var_1_16 >= -461168.6018427382800e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L145] var_1_20 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L146] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L147] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L147] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L148] var_1_22 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L149] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L150] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L150] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=1, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L151] var_1_23 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L152] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L153] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L153] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=-32, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L154] var_1_24 = __VERIFIER_nondet_short() [L155] CALL assume_abort_if_not(var_1_24 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L155] RET assume_abort_if_not(var_1_24 >= -32768) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L156] CALL assume_abort_if_not(var_1_24 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L156] RET assume_abort_if_not(var_1_24 <= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L157] var_1_25 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_25 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L158] RET assume_abort_if_not(var_1_25 >= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L159] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L159] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=-8, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L160] var_1_27 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_27 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L161] RET assume_abort_if_not(var_1_27 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L162] CALL assume_abort_if_not(var_1_27 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L162] RET assume_abort_if_not(var_1_27 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L163] CALL assume_abort_if_not(var_1_27 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L163] RET assume_abort_if_not(var_1_27 != 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-256, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L164] var_1_29 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_29 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L165] RET assume_abort_if_not(var_1_29 >= -32768) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L166] CALL assume_abort_if_not(var_1_29 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L166] RET assume_abort_if_not(var_1_29 <= 32767) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=1, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L167] var_1_30 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L168] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L169] CALL assume_abort_if_not(var_1_30 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L169] RET assume_abort_if_not(var_1_30 <= 16) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_32=253/4, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L170] var_1_32 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L171] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_33=2/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L172] var_1_33 = __VERIFIER_nondet_float() [L173] CALL assume_abort_if_not((var_1_33 >= -461168.6018427382800e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 4611686.018427382800e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L173] RET assume_abort_if_not((var_1_33 >= -461168.6018427382800e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 4611686.018427382800e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_34=519/8, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L174] var_1_34 = __VERIFIER_nondet_float() [L175] CALL assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L175] RET assume_abort_if_not((var_1_34 >= -461168.6018427382800e+13F && var_1_34 <= -1.0e-20F) || (var_1_34 <= 4611686.018427382800e+12F && var_1_34 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_35=13/10, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L176] var_1_35 = __VERIFIER_nondet_float() [L177] CALL assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L177] RET assume_abort_if_not((var_1_35 >= -922337.2036854765600e+13F && var_1_35 <= -1.0e-20F) || (var_1_35 <= 9223372.036854765600e+12F && var_1_35 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=0, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L194] RET updateVariables() [L195] CALL step() [L59] COND TRUE var_1_22 || var_1_23 [L60] var_1_21 = ((var_1_24 > -4) || var_1_25) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=10013/20, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L62] COND TRUE ((var_1_24 + 25) % var_1_27) < 2 [L63] var_1_26 = 8.5f VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L65] EXPR var_1_29 >> var_1_30 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L65] EXPR ((var_1_27) > ((var_1_29 >> var_1_30))) ? (var_1_27) : ((var_1_29 >> var_1_30)) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=10, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L65] COND TRUE var_1_24 > ((((var_1_27) > ((var_1_29 >> var_1_30))) ? (var_1_27) : ((var_1_29 >> var_1_30)))) [L66] var_1_28 = var_1_30 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=39/5, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L68] COND TRUE var_1_27 > var_1_28 [L69] var_1_31 = (((((var_1_32 + ((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))))) > (var_1_35)) ? ((var_1_32 + ((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))))) : (var_1_35))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L73] COND FALSE !(((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) < var_1_30) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L76] signed long int stepLocal_6 = last_1_var_1_1; [L77] unsigned char stepLocal_5 = ((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_5=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L78] COND TRUE stepLocal_5 || last_1_var_1_8 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_6=16, var_1_11=1, var_1_12=0, var_1_13=200, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L79] COND FALSE !(stepLocal_6 <= last_1_var_1_6) [L82] var_1_14 = var_1_16 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L87] COND FALSE !(var_1_14 <= var_1_15) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=10, var_1_7=383, var_1_8=1] [L90] COND TRUE var_1_5 >= -2 [L91] var_1_6 = (var_1_7 - 100) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L93] unsigned char stepLocal_4 = var_1_6; [L94] signed long int stepLocal_3 = var_1_6 / var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_3=0, stepLocal_4=27, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L95] COND TRUE last_1_var_1_13 >= stepLocal_3 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_4=27, var_1_11=1, var_1_12=0, var_1_13=200, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L96] COND TRUE stepLocal_4 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5))) [L97] var_1_13 = var_1_7 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L104] unsigned char stepLocal_7 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_7=27, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L105] COND FALSE !(stepLocal_7 > var_1_6) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L108] unsigned char stepLocal_0 = var_1_6; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=27, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=16, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L109] COND TRUE \read(var_1_19) [L110] var_1_1 = ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=27, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L116] unsigned char stepLocal_2 = var_1_19 && var_1_19; [L117] unsigned char stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=27, stepLocal_1=383, stepLocal_2=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=1] [L118] COND FALSE !((49.5f <= var_1_14) && stepLocal_2) [L125] var_1_8 = var_1_12 VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, stepLocal_0=27, stepLocal_1=383, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=0] [L195] RET step() [L196] CALL, EXPR property() [L186-L187] return ((((((var_1_19 ? (var_1_1 == ((signed short int) ((((var_1_6) > (var_1_6)) ? (var_1_6) : (var_1_6))))) : ((((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) >= var_1_6) ? (var_1_1 == ((signed short int) var_1_5)) : 1)) && ((var_1_5 >= -2) ? (var_1_6 == ((unsigned char) (var_1_7 - 100))) : 1)) && (((49.5f <= var_1_14) && (var_1_19 && var_1_19)) ? ((var_1_13 < var_1_7) ? (var_1_8 == ((unsigned char) (var_1_19 || var_1_11))) : (var_1_8 == ((unsigned char) var_1_11))) : (var_1_8 == ((unsigned char) var_1_12)))) && ((last_1_var_1_13 >= (var_1_6 / var_1_7)) ? ((var_1_6 != ((((((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) > (var_1_5)) ? (((((var_1_6) > (last_1_var_1_13)) ? (var_1_6) : (last_1_var_1_13)))) : (var_1_5)))) ? (var_1_13 == ((signed short int) var_1_7)) : (var_1_13 == ((signed short int) last_1_var_1_13))) : (var_1_13 == ((signed short int) var_1_6)))) && (((((((last_1_var_1_1) < (8)) ? (last_1_var_1_1) : (8))) <= var_1_5) || last_1_var_1_8) ? ((last_1_var_1_1 <= last_1_var_1_6) ? (var_1_14 == ((float) (var_1_15 + var_1_16))) : (var_1_14 == ((float) var_1_16))) : (var_1_14 == ((float) var_1_16)))) && ((var_1_6 > var_1_6) ? (var_1_17 == ((unsigned short int) ((((25) > ((var_1_13 + var_1_6))) ? (25) : ((var_1_13 + var_1_6)))))) : 1)) && ((var_1_14 <= var_1_15) ? (var_1_19 == ((unsigned char) (var_1_12 || var_1_20))) : 1) ; [L196] RET, EXPR property() [L196] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=200, last_1_var_1_1=16, last_1_var_1_6=10, last_1_var_1_8=1, var_1_11=1, var_1_12=0, var_1_13=127, var_1_14=3, var_1_16=3, var_1_17=16, var_1_19=1, var_1_1=27, var_1_20=0, var_1_21=1, var_1_22=-255, var_1_23=-255, var_1_24=4, var_1_25=1, var_1_26=17/2, var_1_27=2, var_1_28=0, var_1_29=-1, var_1_30=0, var_1_31=2, var_1_35=0, var_1_36=100, var_1_5=26, var_1_6=27, var_1_7=383, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.0s, OverallIterations: 8, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1195 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1162 mSDsluCounter, 3825 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2823 mSDsCounter, 590 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2037 IncrementalHoareTripleChecker+Invalid, 2633 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 590 mSolverCounterUnsat, 1002 mSDtfsCounter, 2037 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1580 GetRequests, 1468 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1582occurred in iteration=7, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 907 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2376 NumberOfCodeBlocks, 2376 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1771 ConstructedInterpolants, 1 QuantifiedInterpolants, 10639 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1380 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 16122/16740 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 01:06:42,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.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 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 01:06:44,560 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 01:06:44,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 01:06:44,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 01:06:44,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 01:06:44,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 01:06:44,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 01:06:44,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 01:06:44,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 01:06:44,651 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 01:06:44,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 01:06:44,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 01:06:44,652 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 01:06:44,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 01:06:44,654 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 01:06:44,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 01:06:44,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 01:06:44,654 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 01:06:44,654 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 01:06:44,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 01:06:44,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 01:06:44,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 01:06:44,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 01:06:44,658 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 01:06:44,658 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 01:06:44,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 01:06:44,659 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 01:06:44,659 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 01:06:44,659 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 01:06:44,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 01:06:44,659 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 01:06:44,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 01:06:44,660 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 01:06:44,660 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 01:06:44,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:06:44,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 01:06:44,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 01:06:44,660 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 01:06:44,660 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 01:06:44,660 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 01:06:44,661 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 01:06:44,661 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 01:06:44,661 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 01:06:44,661 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 01:06:44,661 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 01:06:44,662 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 -> 5f62dbdf30439c22b90c0714165751cfb1215bac5efc8ba17b86c401a925f47d [2024-10-13 01:06:44,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 01:06:44,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 01:06:44,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 01:06:44,923 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 01:06:44,924 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 01:06:44,925 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-13 01:06:46,161 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 01:06:46,311 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 01:06:46,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-13 01:06:46,325 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98dc37d44/e6723d41e0c74bddb0cb51541789f5cb/FLAG05db30426 [2024-10-13 01:06:46,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98dc37d44/e6723d41e0c74bddb0cb51541789f5cb [2024-10-13 01:06:46,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 01:06:46,338 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 01:06:46,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 01:06:46,342 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 01:06:46,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 01:06:46,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567db087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46, skipping insertion in model container [2024-10-13 01:06:46,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 01:06:46,523 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i[915,928] [2024-10-13 01:06:46,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:06:46,601 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 01:06:46,613 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-42.i[915,928] [2024-10-13 01:06:46,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 01:06:46,668 INFO L204 MainTranslator]: Completed translation [2024-10-13 01:06:46,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46 WrapperNode [2024-10-13 01:06:46,669 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 01:06:46,669 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 01:06:46,670 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 01:06:46,670 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 01:06:46,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,720 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-10-13 01:06:46,720 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 01:06:46,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 01:06:46,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 01:06:46,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 01:06:46,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,740 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,761 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 01:06:46,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,773 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 01:06:46,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 01:06:46,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 01:06:46,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 01:06:46,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (1/1) ... [2024-10-13 01:06:46,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 01:06:46,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 01:06:46,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 01:06:46,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 01:06:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 01:06:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 01:06:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 01:06:46,852 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 01:06:46,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 01:06:46,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 01:06:46,936 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 01:06:46,938 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 01:06:47,441 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-13 01:06:47,441 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 01:06:47,494 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 01:06:47,496 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 01:06:47,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:47 BoogieIcfgContainer [2024-10-13 01:06:47,497 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 01:06:47,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 01:06:47,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 01:06:47,501 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 01:06:47,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 01:06:46" (1/3) ... [2024-10-13 01:06:47,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52db3bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:06:47, skipping insertion in model container [2024-10-13 01:06:47,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 01:06:46" (2/3) ... [2024-10-13 01:06:47,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52db3bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 01:06:47, skipping insertion in model container [2024-10-13 01:06:47,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 01:06:47" (3/3) ... [2024-10-13 01:06:47,504 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-42.i [2024-10-13 01:06:47,517 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 01:06:47,518 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 01:06:47,569 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 01:06:47,574 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;@1c9bb6a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 01:06:47,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 01:06:47,578 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-13 01:06:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-13 01:06:47,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:47,590 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:47,591 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:47,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:47,594 INFO L85 PathProgramCache]: Analyzing trace with hash 135550756, now seen corresponding path program 1 times [2024-10-13 01:06:47,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:06:47,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319205547] [2024-10-13 01:06:47,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:47,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:06:47,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:06:47,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:06:47,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 01:06:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:48,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 01:06:48,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 587 proven. 24 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2024-10-13 01:06:48,359 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:06:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 01:06:48,522 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:06:48,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319205547] [2024-10-13 01:06:48,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319205547] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 01:06:48,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:06:48,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-13 01:06:48,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917244302] [2024-10-13 01:06:48,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:48,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:06:48,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:06:48,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:06:48,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 01:06:48,554 INFO L87 Difference]: Start difference. First operand has 83 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 50 states have internal predecessors, (70), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:48,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:48,766 INFO L93 Difference]: Finished difference Result 229 states and 425 transitions. [2024-10-13 01:06:48,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:06:48,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-10-13 01:06:48,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:48,779 INFO L225 Difference]: With dead ends: 229 [2024-10-13 01:06:48,779 INFO L226 Difference]: Without dead ends: 147 [2024-10-13 01:06:48,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-13 01:06:48,787 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 100 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:48,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 236 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:06:48,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-13 01:06:48,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-10-13 01:06:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 86 states have internal predecessors, (115), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 01:06:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 227 transitions. [2024-10-13 01:06:48,850 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 227 transitions. Word has length 195 [2024-10-13 01:06:48,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:48,851 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 227 transitions. [2024-10-13 01:06:48,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 227 transitions. [2024-10-13 01:06:48,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-10-13 01:06:48,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:48,855 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:48,870 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 01:06:49,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:06:49,060 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:49,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash -885517598, now seen corresponding path program 1 times [2024-10-13 01:06:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:06:49,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [707073757] [2024-10-13 01:06:49,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:49,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:06:49,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:06:49,064 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:06:49,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 01:06:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:49,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 01:06:49,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 01:06:49,616 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:06:49,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:06:49,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [707073757] [2024-10-13 01:06:49,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [707073757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:49,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:49,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:06:49,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381031887] [2024-10-13 01:06:49,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:49,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 01:06:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:06:49,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 01:06:49,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 01:06:49,623 INFO L87 Difference]: Start difference. First operand 144 states and 227 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:49,885 INFO L93 Difference]: Finished difference Result 394 states and 618 transitions. [2024-10-13 01:06:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 01:06:49,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 195 [2024-10-13 01:06:49,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:49,894 INFO L225 Difference]: With dead ends: 394 [2024-10-13 01:06:49,894 INFO L226 Difference]: Without dead ends: 251 [2024-10-13 01:06:49,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:06:49,896 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 90 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:49,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 366 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 01:06:49,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-13 01:06:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 213. [2024-10-13 01:06:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 122 states have internal predecessors, (157), 87 states have call successors, (87), 4 states have call predecessors, (87), 4 states have return successors, (87), 86 states have call predecessors, (87), 87 states have call successors, (87) [2024-10-13 01:06:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 331 transitions. [2024-10-13 01:06:49,955 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 331 transitions. Word has length 195 [2024-10-13 01:06:49,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:49,958 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 331 transitions. [2024-10-13 01:06:49,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 331 transitions. [2024-10-13 01:06:49,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-13 01:06:49,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:49,982 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:49,996 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-10-13 01:06:50,182 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-10-13 01:06:50,183 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:50,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:50,184 INFO L85 PathProgramCache]: Analyzing trace with hash -435714880, now seen corresponding path program 1 times [2024-10-13 01:06:50,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:06:50,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [220719047] [2024-10-13 01:06:50,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:50,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:06:50,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:06:50,185 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-10-13 01:06:50,186 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-10-13 01:06:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:50,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 01:06:50,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:51,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 01:06:51,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:06:51,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:06:51,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [220719047] [2024-10-13 01:06:51,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [220719047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:51,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:51,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 01:06:51,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615944700] [2024-10-13 01:06:51,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:51,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:06:51,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:06:51,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:06:51,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 01:06:51,055 INFO L87 Difference]: Start difference. First operand 213 states and 331 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:51,618 INFO L93 Difference]: Finished difference Result 583 states and 914 transitions. [2024-10-13 01:06:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 01:06:51,622 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-13 01:06:51,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:51,629 INFO L225 Difference]: With dead ends: 583 [2024-10-13 01:06:51,630 INFO L226 Difference]: Without dead ends: 440 [2024-10-13 01:06:51,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-13 01:06:51,632 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 119 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:51,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 480 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 01:06:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-13 01:06:51,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 354. [2024-10-13 01:06:51,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 204 states have (on average 1.3137254901960784) internal successors, (268), 206 states have internal predecessors, (268), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2024-10-13 01:06:51,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 554 transitions. [2024-10-13 01:06:51,683 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 554 transitions. Word has length 196 [2024-10-13 01:06:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:51,684 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 554 transitions. [2024-10-13 01:06:51,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 554 transitions. [2024-10-13 01:06:51,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-13 01:06:51,685 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:51,686 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:51,702 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-10-13 01:06:51,886 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-10-13 01:06:51,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:51,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:51,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1446832130, now seen corresponding path program 1 times [2024-10-13 01:06:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:06:51,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [253336975] [2024-10-13 01:06:51,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:51,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:06:51,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:06:51,892 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-10-13 01:06:51,893 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-10-13 01:06:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:52,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 01:06:52,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:52,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 01:06:52,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:06:52,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:06:52,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [253336975] [2024-10-13 01:06:52,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [253336975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:52,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 01:06:52,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 01:06:52,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215009300] [2024-10-13 01:06:52,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:52,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 01:06:52,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:06:52,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 01:06:52,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:06:52,214 INFO L87 Difference]: Start difference. First operand 354 states and 554 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:52,335 INFO L93 Difference]: Finished difference Result 638 states and 1003 transitions. [2024-10-13 01:06:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 01:06:52,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-13 01:06:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:52,343 INFO L225 Difference]: With dead ends: 638 [2024-10-13 01:06:52,343 INFO L226 Difference]: Without dead ends: 354 [2024-10-13 01:06:52,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 01:06:52,344 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:52,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 235 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 01:06:52,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-13 01:06:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2024-10-13 01:06:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 204 states have (on average 1.2941176470588236) internal successors, (264), 206 states have internal predecessors, (264), 143 states have call successors, (143), 6 states have call predecessors, (143), 6 states have return successors, (143), 141 states have call predecessors, (143), 143 states have call successors, (143) [2024-10-13 01:06:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 550 transitions. [2024-10-13 01:06:52,379 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 550 transitions. Word has length 196 [2024-10-13 01:06:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:52,380 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 550 transitions. [2024-10-13 01:06:52,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 550 transitions. [2024-10-13 01:06:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-13 01:06:52,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:52,381 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:52,395 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 (5)] Ended with exit code 0 [2024-10-13 01:06:52,585 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-10-13 01:06:52,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:52,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:52,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2038788540, now seen corresponding path program 1 times [2024-10-13 01:06:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:06:52,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904945518] [2024-10-13 01:06:52,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:52,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:06:52,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:06:52,589 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-10-13 01:06:52,590 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-10-13 01:06:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:52,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 01:06:52,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-13 01:06:53,538 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:06:53,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:06:53,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904945518] [2024-10-13 01:06:53,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904945518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:06:53,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2016951961] [2024-10-13 01:06:53,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:53,881 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 01:06:53,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 01:06:53,884 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-10-13 01:06:53,885 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-10-13 01:06:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:54,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 01:06:54,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 01:06:55,063 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:06:55,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2016951961] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:55,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:06:55,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2024-10-13 01:06:55,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955327971] [2024-10-13 01:06:55,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:55,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 01:06:55,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:06:55,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 01:06:55,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-10-13 01:06:55,067 INFO L87 Difference]: Start difference. First operand 354 states and 550 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:06:56,632 INFO L93 Difference]: Finished difference Result 903 states and 1384 transitions. [2024-10-13 01:06:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 01:06:56,638 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-13 01:06:56,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:06:56,642 INFO L225 Difference]: With dead ends: 903 [2024-10-13 01:06:56,644 INFO L226 Difference]: Without dead ends: 760 [2024-10-13 01:06:56,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:06:56,647 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 154 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 01:06:56,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 509 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 01:06:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2024-10-13 01:06:56,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 678. [2024-10-13 01:06:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 406 states have (on average 1.3103448275862069) internal successors, (532), 412 states have internal predecessors, (532), 259 states have call successors, (259), 12 states have call predecessors, (259), 12 states have return successors, (259), 253 states have call predecessors, (259), 259 states have call successors, (259) [2024-10-13 01:06:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1050 transitions. [2024-10-13 01:06:56,707 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1050 transitions. Word has length 196 [2024-10-13 01:06:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:06:56,707 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1050 transitions. [2024-10-13 01:06:56,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:06:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1050 transitions. [2024-10-13 01:06:56,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-13 01:06:56,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:06:56,709 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:06:56,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-10-13 01:06:56,922 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 (6)] Forceful destruction successful, exit code 0 [2024-10-13 01:06:57,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:06:57,112 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:06:57,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:06:57,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1998013318, now seen corresponding path program 1 times [2024-10-13 01:06:57,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:06:57,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1054520326] [2024-10-13 01:06:57,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:57,113 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:06:57,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:06:57,116 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:06:57,117 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 (8)] Waiting until timeout for monitored process [2024-10-13 01:06:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:57,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 01:06:57,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-13 01:06:58,013 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:06:58,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:06:58,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1054520326] [2024-10-13 01:06:58,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1054520326] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:06:58,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1491828816] [2024-10-13 01:06:58,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:06:58,329 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 01:06:58,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 01:06:58,332 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 01:06:58,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-10-13 01:06:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:06:59,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 01:06:59,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:06:59,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-10-13 01:06:59,735 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 01:06:59,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1491828816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 01:06:59,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 01:06:59,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-13 01:06:59,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142704129] [2024-10-13 01:06:59,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 01:06:59,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 01:06:59,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:06:59,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 01:06:59,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-10-13 01:06:59,737 INFO L87 Difference]: Start difference. First operand 678 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:07:01,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:07:01,094 INFO L93 Difference]: Finished difference Result 1155 states and 1788 transitions. [2024-10-13 01:07:01,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 01:07:01,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 196 [2024-10-13 01:07:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:07:01,102 INFO L225 Difference]: With dead ends: 1155 [2024-10-13 01:07:01,102 INFO L226 Difference]: Without dead ends: 871 [2024-10-13 01:07:01,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 402 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-10-13 01:07:01,105 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 105 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 01:07:01,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 437 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 01:07:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2024-10-13 01:07:01,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2024-10-13 01:07:01,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 489 states have (on average 1.3067484662576687) internal successors, (639), 496 states have internal predecessors, (639), 315 states have call successors, (315), 14 states have call predecessors, (315), 14 states have return successors, (315), 308 states have call predecessors, (315), 315 states have call successors, (315) [2024-10-13 01:07:01,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1269 transitions. [2024-10-13 01:07:01,168 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1269 transitions. Word has length 196 [2024-10-13 01:07:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:07:01,171 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1269 transitions. [2024-10-13 01:07:01,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-10-13 01:07:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1269 transitions. [2024-10-13 01:07:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-13 01:07:01,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:07:01,173 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:07:01,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2024-10-13 01:07:01,385 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 (8)] Forceful destruction successful, exit code 0 [2024-10-13 01:07:01,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:07:01,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:07:01,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:07:01,574 INFO L85 PathProgramCache]: Analyzing trace with hash -425267931, now seen corresponding path program 1 times [2024-10-13 01:07:01,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:07:01,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954141658] [2024-10-13 01:07:01,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:07:01,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:07:01,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:07:01,576 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:07:01,576 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 (10)] Waiting until timeout for monitored process [2024-10-13 01:07:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:07:01,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 01:07:01,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:07:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-13 01:07:02,370 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:07:02,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 01:07:02,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954141658] [2024-10-13 01:07:02,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954141658] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:07:02,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [103123802] [2024-10-13 01:07:02,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:07:02,896 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 01:07:02,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 01:07:02,898 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-13 01:07:02,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-10-13 01:07:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:07:03,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 01:07:03,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 01:07:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 258 proven. 84 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2024-10-13 01:07:04,194 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 01:07:04,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [103123802] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 01:07:04,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 01:07:04,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-13 01:07:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679453867] [2024-10-13 01:07:04,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 01:07:04,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 01:07:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 01:07:04,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 01:07:04,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-13 01:07:04,508 INFO L87 Difference]: Start difference. First operand 819 states and 1269 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 01:07:05,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 01:07:05,294 INFO L93 Difference]: Finished difference Result 1076 states and 1631 transitions. [2024-10-13 01:07:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 01:07:05,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 197 [2024-10-13 01:07:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 01:07:05,304 INFO L225 Difference]: With dead ends: 1076 [2024-10-13 01:07:05,305 INFO L226 Difference]: Without dead ends: 750 [2024-10-13 01:07:05,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2024-10-13 01:07:05,306 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 152 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 01:07:05,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 619 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 01:07:05,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2024-10-13 01:07:05,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 662. [2024-10-13 01:07:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 391 states have (on average 1.2813299232736572) internal successors, (501), 395 states have internal predecessors, (501), 255 states have call successors, (255), 15 states have call predecessors, (255), 15 states have return successors, (255), 251 states have call predecessors, (255), 255 states have call successors, (255) [2024-10-13 01:07:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1011 transitions. [2024-10-13 01:07:05,374 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1011 transitions. Word has length 197 [2024-10-13 01:07:05,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 01:07:05,374 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1011 transitions. [2024-10-13 01:07:05,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-10-13 01:07:05,375 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1011 transitions. [2024-10-13 01:07:05,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-10-13 01:07:05,377 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 01:07:05,377 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 01:07:05,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2024-10-13 01:07:05,593 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 (10)] Forceful destruction successful, exit code 0 [2024-10-13 01:07:05,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:07:05,778 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 01:07:05,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 01:07:05,778 INFO L85 PathProgramCache]: Analyzing trace with hash -32240921, now seen corresponding path program 1 times [2024-10-13 01:07:05,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 01:07:05,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680939152] [2024-10-13 01:07:05,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 01:07:05,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 01:07:05,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 01:07:05,780 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 01:07:05,780 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 (12)] Waiting until timeout for monitored process [2024-10-13 01:07:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 01:07:06,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-13 01:07:06,071 INFO L278 TraceCheckSpWp]: Computing forward predicates...