./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_fillercodestructure_filler-pr-co_file-15.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_fillercodestructure_filler-pr-co_file-15.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 044a7cdd6251fe9eb07c20450214da5314c7c35ebd124f60b50f79c201faf819 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:28:23,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:28:23,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:28:23,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:28:23,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:28:23,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:28:23,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:28:23,866 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:28:23,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:28:23,867 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:28:23,869 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:28:23,869 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:28:23,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:28:23,870 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:28:23,872 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:28:23,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:28:23,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:28:23,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:28:23,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:28:23,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:28:23,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:28:23,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:28:23,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:28:23,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:28:23,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:28:23,877 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:28:23,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:28:23,877 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:28:23,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:28:23,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:28:23,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:28:23,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:28:23,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:28:23,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:28:23,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:28:23,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:28:23,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:28:23,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:28:23,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:28:23,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:28:23,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:28:23,881 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:28:23,881 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 -> 044a7cdd6251fe9eb07c20450214da5314c7c35ebd124f60b50f79c201faf819 [2024-10-13 02:28:24,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:28:24,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:28:24,170 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:28:24,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:28:24,171 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:28:24,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2024-10-13 02:28:25,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:28:25,848 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:28:25,850 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2024-10-13 02:28:25,862 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7affcd687/d926c26c1a064413983f1b89355a56ac/FLAG1f428c5eb [2024-10-13 02:28:25,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7affcd687/d926c26c1a064413983f1b89355a56ac [2024-10-13 02:28:25,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:28:25,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:28:25,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:28:25,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:28:25,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:28:25,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:28:25" (1/1) ... [2024-10-13 02:28:25,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@431956a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:25, skipping insertion in model container [2024-10-13 02:28:25,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:28:25" (1/1) ... [2024-10-13 02:28:25,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:28:26,091 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_fillercodestructure_filler-pr-co_file-15.i[919,932] [2024-10-13 02:28:26,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:28:26,165 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:28:26,174 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_fillercodestructure_filler-pr-co_file-15.i[919,932] [2024-10-13 02:28:26,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:28:26,238 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:28:26,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26 WrapperNode [2024-10-13 02:28:26,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:28:26,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:28:26,244 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:28:26,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:28:26,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (1/1) ... [2024-10-13 02:28:26,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (1/1) ... [2024-10-13 02:28:26,300 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2024-10-13 02:28:26,301 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:28:26,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:28:26,305 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:28:26,305 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:28:26,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (1/1) ... [2024-10-13 02:28:26,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (1/1) ... [2024-10-13 02:28:26,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (1/1) ... [2024-10-13 02:28:26,350 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 02:28:26,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (1/1) ... [2024-10-13 02:28:26,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (1/1) ... [2024-10-13 02:28:26,364 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (1/1) ... [2024-10-13 02:28:26,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (1/1) ... [2024-10-13 02:28:26,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (1/1) ... [2024-10-13 02:28:26,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (1/1) ... [2024-10-13 02:28:26,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:28:26,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:28:26,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:28:26,374 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:28:26,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (1/1) ... [2024-10-13 02:28:26,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:28:26,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:28:26,408 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 02:28:26,411 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 02:28:26,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:28:26,450 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:28:26,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:28:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:28:26,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:28:26,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:28:26,528 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:28:26,531 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:28:26,890 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 02:28:26,891 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:28:26,936 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:28:26,936 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:28:26,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:28:26 BoogieIcfgContainer [2024-10-13 02:28:26,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:28:26,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:28:26,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:28:26,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:28:26,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:28:25" (1/3) ... [2024-10-13 02:28:26,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256858c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:28:26, skipping insertion in model container [2024-10-13 02:28:26,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:26" (2/3) ... [2024-10-13 02:28:26,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@256858c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:28:26, skipping insertion in model container [2024-10-13 02:28:26,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:28:26" (3/3) ... [2024-10-13 02:28:26,946 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2024-10-13 02:28:26,963 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:28:26,964 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:28:27,044 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:28:27,054 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;@16b7219b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:28:27,054 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:28:27,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 02:28:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 02:28:27,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:27,091 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:28:27,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:27,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:27,096 INFO L85 PathProgramCache]: Analyzing trace with hash 403408339, now seen corresponding path program 1 times [2024-10-13 02:28:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:27,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528296056] [2024-10-13 02:28:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:27,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:28:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:28:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:28:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:28:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:28:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:28:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:28:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:28:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:28:27,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:28:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:28:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:28:27,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:28:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:28:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:28:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:28:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:28:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:28:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:28:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:28:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:28:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:28:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:28:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:28:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:28:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:28:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 02:28:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:28:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:28:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:28:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 02:28:28,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:28:28,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528296056] [2024-10-13 02:28:28,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528296056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:28:28,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:28:28,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:28:28,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500019691] [2024-10-13 02:28:28,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:28:28,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:28:28,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:28:28,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:28:28,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:28:28,077 INFO L87 Difference]: Start difference. First operand has 89 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:28:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:28,383 INFO L93 Difference]: Finished difference Result 259 states and 481 transitions. [2024-10-13 02:28:28,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:28:28,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-10-13 02:28:28,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:28,402 INFO L225 Difference]: With dead ends: 259 [2024-10-13 02:28:28,403 INFO L226 Difference]: Without dead ends: 171 [2024-10-13 02:28:28,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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 02:28:28,414 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 80 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:28:28,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 370 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:28:28,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-10-13 02:28:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 140. [2024-10-13 02:28:28,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 02:28:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 217 transitions. [2024-10-13 02:28:28,503 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 217 transitions. Word has length 190 [2024-10-13 02:28:28,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:28,506 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 217 transitions. [2024-10-13 02:28:28,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:28:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 217 transitions. [2024-10-13 02:28:28,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 02:28:28,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:28,513 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:28:28,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:28:28,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:28,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:28,515 INFO L85 PathProgramCache]: Analyzing trace with hash 591694506, now seen corresponding path program 1 times [2024-10-13 02:28:28,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:28,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196313490] [2024-10-13 02:28:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:28,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:28:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:28:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:28:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:28:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:28:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:28:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:28:28,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:28:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:28:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:28:28,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:28:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:28:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:28:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:28:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:28:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:28:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:28:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:28:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:28:28,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:28:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:28:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:28,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:28:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:28:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:28:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:28:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:28:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 02:28:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:28:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:28:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:28:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 02:28:29,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:28:29,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196313490] [2024-10-13 02:28:29,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196313490] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:28:29,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:28:29,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:28:29,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678340851] [2024-10-13 02:28:29,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:28:29,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:28:29,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:28:29,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:28:29,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:28:29,030 INFO L87 Difference]: Start difference. First operand 140 states and 217 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:28:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:29,235 INFO L93 Difference]: Finished difference Result 324 states and 494 transitions. [2024-10-13 02:28:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:28:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2024-10-13 02:28:29,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:29,240 INFO L225 Difference]: With dead ends: 324 [2024-10-13 02:28:29,240 INFO L226 Difference]: Without dead ends: 240 [2024-10-13 02:28:29,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:28:29,243 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 118 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:28:29,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 348 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:28:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-13 02:28:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 203. [2024-10-13 02:28:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 124 states have (on average 1.282258064516129) internal successors, (159), 125 states have internal predecessors, (159), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-13 02:28:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 307 transitions. [2024-10-13 02:28:29,286 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 307 transitions. Word has length 191 [2024-10-13 02:28:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:29,287 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 307 transitions. [2024-10-13 02:28:29,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:28:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 307 transitions. [2024-10-13 02:28:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 02:28:29,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:29,292 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:28:29,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:28:29,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:29,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1097249236, now seen corresponding path program 1 times [2024-10-13 02:28:29,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163290806] [2024-10-13 02:28:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:28:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:28:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:28:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:28:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:28:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:28:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:28:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:28:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:28:29,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:28:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:28:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:28:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:28:29,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:28:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:28:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:28:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:28:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:28:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:28:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:28:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:28:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:28:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:28:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:28:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:28:29,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:28:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 02:28:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:28:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:28:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:28:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 02:28:29,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:28:29,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163290806] [2024-10-13 02:28:29,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163290806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:28:29,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:28:29,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:28:29,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610548135] [2024-10-13 02:28:29,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:28:29,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:28:29,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:28:29,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:28:29,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:28:29,625 INFO L87 Difference]: Start difference. First operand 203 states and 307 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:28:29,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:29,729 INFO L93 Difference]: Finished difference Result 436 states and 664 transitions. [2024-10-13 02:28:29,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:28:29,730 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2024-10-13 02:28:29,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:29,738 INFO L225 Difference]: With dead ends: 436 [2024-10-13 02:28:29,738 INFO L226 Difference]: Without dead ends: 293 [2024-10-13 02:28:29,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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 02:28:29,740 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 63 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:28:29,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 260 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:28:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-13 02:28:29,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 288. [2024-10-13 02:28:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 177 states have (on average 1.265536723163842) internal successors, (224), 178 states have internal predecessors, (224), 104 states have call successors, (104), 6 states have call predecessors, (104), 6 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2024-10-13 02:28:29,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 432 transitions. [2024-10-13 02:28:29,790 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 432 transitions. Word has length 191 [2024-10-13 02:28:29,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:29,790 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 432 transitions. [2024-10-13 02:28:29,791 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:28:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 432 transitions. [2024-10-13 02:28:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 02:28:29,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:29,793 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:28:29,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:28:29,794 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:29,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash 580894310, now seen corresponding path program 1 times [2024-10-13 02:28:29,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:29,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312085275] [2024-10-13 02:28:29,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:29,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:28:30,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:28:30,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:28:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:28:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:28:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:28:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:28:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:28:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:28:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:28:30,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:28:30,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:28:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:28:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:28:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:28:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:28:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:28:30,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:28:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:28:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:28:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:28:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:28:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:28:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:28:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:28:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:28:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 02:28:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:28:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:28:30,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:28:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-13 02:28:30,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:28:30,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312085275] [2024-10-13 02:28:30,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312085275] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:28:30,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188142846] [2024-10-13 02:28:30,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:30,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:28:30,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:28:30,181 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 02:28:30,182 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 02:28:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:30,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 02:28:30,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:28:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2024-10-13 02:28:30,915 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:28:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 66 proven. 21 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-13 02:28:31,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188142846] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:28:31,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 02:28:31,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 9] total 19 [2024-10-13 02:28:31,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040003997] [2024-10-13 02:28:31,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 02:28:31,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 02:28:31,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:28:31,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 02:28:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-10-13 02:28:31,301 INFO L87 Difference]: Start difference. First operand 288 states and 432 transitions. Second operand has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2024-10-13 02:28:33,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:33,182 INFO L93 Difference]: Finished difference Result 1141 states and 1671 transitions. [2024-10-13 02:28:33,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-13 02:28:33,183 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) Word has length 192 [2024-10-13 02:28:33,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:33,189 INFO L225 Difference]: With dead ends: 1141 [2024-10-13 02:28:33,189 INFO L226 Difference]: Without dead ends: 878 [2024-10-13 02:28:33,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 436 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=690, Invalid=2390, Unknown=0, NotChecked=0, Total=3080 [2024-10-13 02:28:33,192 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 765 mSDsluCounter, 674 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:28:33,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [783 Valid, 769 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 02:28:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2024-10-13 02:28:33,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 556. [2024-10-13 02:28:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 339 states have (on average 1.168141592920354) internal successors, (396), 343 states have internal predecessors, (396), 192 states have call successors, (192), 24 states have call predecessors, (192), 24 states have return successors, (192), 188 states have call predecessors, (192), 192 states have call successors, (192) [2024-10-13 02:28:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 780 transitions. [2024-10-13 02:28:33,300 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 780 transitions. Word has length 192 [2024-10-13 02:28:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:33,301 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 780 transitions. [2024-10-13 02:28:33,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.684210526315789) internal successors, (127), 19 states have internal predecessors, (127), 6 states have call successors, (90), 3 states have call predecessors, (90), 6 states have return successors, (90), 6 states have call predecessors, (90), 6 states have call successors, (90) [2024-10-13 02:28:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 780 transitions. [2024-10-13 02:28:33,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-13 02:28:33,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:33,304 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:28:33,323 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 02:28:33,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:28:33,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:33,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash -395216780, now seen corresponding path program 1 times [2024-10-13 02:28:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:33,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976547913] [2024-10-13 02:28:33,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:33,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:28:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:28:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:28:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:28:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:28:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:28:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:28:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:28:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:28:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:28:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:28:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 02:28:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 02:28:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 02:28:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:28:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 02:28:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:28:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 02:28:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:28:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 02:28:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:28:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-13 02:28:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:28:33,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-13 02:28:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:28:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:28:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 02:28:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:28:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-10-13 02:28:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-13 02:28:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 02:28:33,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:28:33,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976547913] [2024-10-13 02:28:33,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976547913] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:28:33,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:28:33,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:28:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17578835] [2024-10-13 02:28:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:28:33,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:28:33,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:28:33,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:28:33,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:28:33,634 INFO L87 Difference]: Start difference. First operand 556 states and 780 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:28:33,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:33,733 INFO L93 Difference]: Finished difference Result 824 states and 1150 transitions. [2024-10-13 02:28:33,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:28:33,734 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 193 [2024-10-13 02:28:33,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:33,738 INFO L225 Difference]: With dead ends: 824 [2024-10-13 02:28:33,738 INFO L226 Difference]: Without dead ends: 495 [2024-10-13 02:28:33,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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 02:28:33,740 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 108 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:28:33,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 125 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:28:33,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-10-13 02:28:33,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 327. [2024-10-13 02:28:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 196 states have (on average 1.1173469387755102) internal successors, (219), 197 states have internal predecessors, (219), 112 states have call successors, (112), 18 states have call predecessors, (112), 18 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-13 02:28:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 443 transitions. [2024-10-13 02:28:33,799 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 443 transitions. Word has length 193 [2024-10-13 02:28:33,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:33,799 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 443 transitions. [2024-10-13 02:28:33,799 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:28:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 443 transitions. [2024-10-13 02:28:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-13 02:28:33,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:33,801 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:28:33,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:28:33,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:33,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:33,802 INFO L85 PathProgramCache]: Analyzing trace with hash -395157198, now seen corresponding path program 1 times [2024-10-13 02:28:33,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:28:33,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372283342] [2024-10-13 02:28:33,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:33,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:28:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:28:33,882 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:28:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:28:34,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:28:34,027 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:28:34,027 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:28:34,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:28:34,033 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 02:28:34,183 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:28:34,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:28:34 BoogieIcfgContainer [2024-10-13 02:28:34,187 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:28:34,188 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:28:34,188 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:28:34,188 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:28:34,189 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:28:26" (3/4) ... [2024-10-13 02:28:34,191 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:28:34,192 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:28:34,192 INFO L158 Benchmark]: Toolchain (without parser) took 8313.38ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 144.7MB in the beginning and 91.8MB in the end (delta: 52.8MB). Peak memory consumption was 133.0MB. Max. memory is 16.1GB. [2024-10-13 02:28:34,193 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory was 83.3MB in the beginning and 83.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:28:34,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.51ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 127.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 02:28:34,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.09ms. Allocated memory is still 176.2MB. Free memory was 127.4MB in the beginning and 124.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:28:34,193 INFO L158 Benchmark]: Boogie Preprocessor took 67.54ms. Allocated memory is still 176.2MB. Free memory was 124.5MB in the beginning and 121.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 02:28:34,194 INFO L158 Benchmark]: RCFGBuilder took 563.98ms. Allocated memory is still 176.2MB. Free memory was 121.1MB in the beginning and 94.5MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 02:28:34,194 INFO L158 Benchmark]: TraceAbstraction took 7248.17ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 93.8MB in the beginning and 91.8MB in the end (delta: 2.0MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. [2024-10-13 02:28:34,194 INFO L158 Benchmark]: Witness Printer took 4.11ms. Allocated memory is still 255.9MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:28:34,196 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 121.6MB. Free memory was 83.3MB in the beginning and 83.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.51ms. Allocated memory is still 176.2MB. Free memory was 144.7MB in the beginning and 127.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.09ms. Allocated memory is still 176.2MB. Free memory was 127.4MB in the beginning and 124.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.54ms. Allocated memory is still 176.2MB. Free memory was 124.5MB in the beginning and 121.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 563.98ms. Allocated memory is still 176.2MB. Free memory was 121.1MB in the beginning and 94.5MB in the end (delta: 26.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 7248.17ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 93.8MB in the beginning and 91.8MB in the end (delta: 2.0MB). Peak memory consumption was 82.7MB. Max. memory is 16.1GB. * Witness Printer took 4.11ms. Allocated memory is still 255.9MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 211, overapproximation of someBinaryArithmeticDOUBLEoperation at line 68, overapproximation of someUnaryDOUBLEoperation at line 68, overapproximation of someBinaryDOUBLEComparisonOperation at line 211. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed short int var_1_26 = 10; [L43] signed short int var_1_32 = 0; [L44] signed short int var_1_33 = 10; [L45] signed long int var_1_34 = -10; [L46] double var_1_36 = 4.85; [L47] double var_1_37 = 2.5; [L48] double var_1_38 = 15.75; [L49] signed char var_1_39 = -100; [L50] signed char var_1_40 = 1; [L51] signed short int var_1_41 = -32; [L52] signed char var_1_42 = 4; [L53] signed char var_1_43 = -8; [L54] signed short int var_1_44 = -25; [L55] signed char last_1_var_1_10 = -5; [L56] signed long int last_1_var_1_21 = 1; [L57] signed long int last_1_var_1_25 = -4; [L215] isInitial = 1 [L216] FCALL initially() [L217] COND TRUE 1 [L218] CALL updateLastVariables() [L206] last_1_var_1_10 = var_1_10 [L207] last_1_var_1_21 = var_1_21 [L208] last_1_var_1_25 = var_1_25 [L218] RET updateLastVariables() [L219] CALL updateVariables() [L155] var_1_3 = __VERIFIER_nondet_float() [L156] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L156] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L157] var_1_4 = __VERIFIER_nondet_float() [L158] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L158] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L159] var_1_7 = __VERIFIER_nondet_short() [L160] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L160] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L161] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L161] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=64, var_1_9=256] [L162] var_1_8 = __VERIFIER_nondet_short() [L163] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=256] [L163] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=256] [L164] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=256] [L164] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=256] [L165] var_1_9 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L166] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L167] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L167] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L168] var_1_11 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L169] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L170] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L170] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L171] var_1_13 = __VERIFIER_nondet_float() [L172] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L172] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L173] var_1_14 = __VERIFIER_nondet_float() [L174] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L174] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L175] var_1_15 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L176] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L177] var_1_16 = __VERIFIER_nondet_double() [L178] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L178] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L179] var_1_20 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L180] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L181] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L181] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L182] var_1_22 = __VERIFIER_nondet_short() [L183] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L183] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L184] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L184] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L185] var_1_23 = __VERIFIER_nondet_short() [L186] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L186] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L187] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L187] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=0, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L188] var_1_32 = __VERIFIER_nondet_short() [L189] CALL assume_abort_if_not(var_1_32 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L189] RET assume_abort_if_not(var_1_32 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L190] CALL assume_abort_if_not(var_1_32 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L190] RET assume_abort_if_not(var_1_32 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=10, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L191] var_1_33 = __VERIFIER_nondet_short() [L192] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L192] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L193] CALL assume_abort_if_not(var_1_33 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L193] RET assume_abort_if_not(var_1_33 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_37=5/2, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L194] var_1_37 = __VERIFIER_nondet_double() [L195] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L195] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L196] var_1_38 = __VERIFIER_nondet_double() [L197] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L197] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=1, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L198] var_1_40 = __VERIFIER_nondet_char() [L199] CALL assume_abort_if_not(var_1_40 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L199] RET assume_abort_if_not(var_1_40 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L200] CALL assume_abort_if_not(var_1_40 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L200] RET assume_abort_if_not(var_1_40 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L201] var_1_43 = __VERIFIER_nondet_char() [L202] CALL assume_abort_if_not(var_1_43 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L202] RET assume_abort_if_not(var_1_43 >= -126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L203] CALL assume_abort_if_not(var_1_43 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L203] RET assume_abort_if_not(var_1_43 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L219] RET updateVariables() [L220] CALL step() [L61] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L62] COND TRUE var_1_11 <= last_1_var_1_25 [L63] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L66] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L67] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L68] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-25, var_1_7=0, var_1_8=-1, var_1_9=16383] [L72] COND TRUE (! var_1_19) || var_1_19 [L73] var_1_44 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L85] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L86] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L93] var_1_34 = ((((128) < (((((var_1_10) > ((-5 + var_1_17))) ? (var_1_10) : ((-5 + var_1_17)))))) ? (128) : (((((var_1_10) > ((-5 + var_1_17))) ? (var_1_10) : ((-5 + var_1_17))))))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L94] COND FALSE !(var_1_33 <= var_1_10) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-4, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L97] COND FALSE !(\read(var_1_19)) [L100] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L102] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L103] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=10, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L106] COND FALSE !(var_1_17 >= 25) [L117] var_1_26 = var_1_17 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L121] COND FALSE !(\read(var_1_19)) [L124] var_1_36 = ((((var_1_37) > (var_1_38)) ? (var_1_37) : (var_1_38))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=-100, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L126] var_1_39 = var_1_40 [L127] unsigned char stepLocal_0 = var_1_12 > var_1_12; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_0=1, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L128] COND TRUE var_1_19 || stepLocal_0 [L129] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L133] signed long int stepLocal_3 = var_1_22 + var_1_11; [L134] signed long int stepLocal_2 = (var_1_22 - var_1_23) - var_1_9; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-16384, stepLocal_3=16256, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L135] COND FALSE !(\read(var_1_20)) [L148] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-16384, stepLocal_3=16256, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L150] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-16384, stepLocal_3=16256, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L220] RET step() [L221] CALL, EXPR property() [L211-L212] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; [L221] RET, EXPR property() [L221] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-127, var_1_11=-127, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=16384, var_1_25=-127, var_1_26=-5, var_1_32=32766, var_1_33=32766, var_1_34=-10, var_1_36=10000000006, var_1_37=10000000006, var_1_38=10000000006, var_1_39=0, var_1_40=0, var_1_41=-32, var_1_42=4, var_1_43=126, var_1_44=-127, var_1_7=0, var_1_8=-1, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 6, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1152 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1134 mSDsluCounter, 1872 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1220 mSDsCounter, 600 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1413 IncrementalHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 600 mSolverCounterUnsat, 652 mSDtfsCounter, 1413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 747 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 821 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=556occurred in iteration=4, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 563 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1342 NumberOfCodeBlocks, 1342 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1334 ConstructedInterpolants, 0 QuantifiedInterpolants, 3159 SizeOfPredicates, 7 NumberOfNonLiveVariables, 449 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 12096/12180 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 02:28:34,230 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_fillercodestructure_filler-pr-co_file-15.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 044a7cdd6251fe9eb07c20450214da5314c7c35ebd124f60b50f79c201faf819 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:28:36,396 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:28:36,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:28:36,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:28:36,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:28:36,513 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:28:36,514 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:28:36,514 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:28:36,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:28:36,515 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:28:36,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:28:36,516 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:28:36,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:28:36,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:28:36,517 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:28:36,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:28:36,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:28:36,521 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:28:36,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:28:36,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:28:36,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:28:36,524 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:28:36,524 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:28:36,525 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:28:36,525 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:28:36,525 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:28:36,526 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:28:36,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:28:36,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:28:36,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:28:36,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:28:36,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:28:36,529 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:28:36,530 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:28:36,530 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:28:36,531 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:28:36,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:28:36,532 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:28:36,532 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:28:36,532 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:28:36,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:28:36,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:28:36,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:28:36,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:28:36,533 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:28:36,533 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 -> 044a7cdd6251fe9eb07c20450214da5314c7c35ebd124f60b50f79c201faf819 [2024-10-13 02:28:36,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:28:36,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:28:36,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:28:36,909 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:28:36,910 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:28:36,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2024-10-13 02:28:38,388 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:28:38,416 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-13 02:28:38,611 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:28:38,612 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2024-10-13 02:28:38,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17b7a96cf/4cca53b65bb047fb8e9aeee139584d5c/FLAG146019fb4 [2024-10-13 02:28:38,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17b7a96cf/4cca53b65bb047fb8e9aeee139584d5c [2024-10-13 02:28:38,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:28:38,969 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:28:38,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:28:38,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:28:38,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:28:38,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:38,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584670db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:38, skipping insertion in model container [2024-10-13 02:28:38,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:28:38" (1/1) ... [2024-10-13 02:28:39,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:28:39,198 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_fillercodestructure_filler-pr-co_file-15.i[919,932] [2024-10-13 02:28:39,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:28:39,317 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:28:39,330 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_fillercodestructure_filler-pr-co_file-15.i[919,932] [2024-10-13 02:28:39,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:28:39,410 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:28:39,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39 WrapperNode [2024-10-13 02:28:39,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:28:39,412 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:28:39,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:28:39,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:28:39,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (1/1) ... [2024-10-13 02:28:39,436 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (1/1) ... [2024-10-13 02:28:39,477 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 215 [2024-10-13 02:28:39,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:28:39,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:28:39,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:28:39,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:28:39,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (1/1) ... [2024-10-13 02:28:39,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (1/1) ... [2024-10-13 02:28:39,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (1/1) ... [2024-10-13 02:28:39,534 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 02:28:39,534 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (1/1) ... [2024-10-13 02:28:39,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (1/1) ... [2024-10-13 02:28:39,551 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (1/1) ... [2024-10-13 02:28:39,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (1/1) ... [2024-10-13 02:28:39,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (1/1) ... [2024-10-13 02:28:39,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (1/1) ... [2024-10-13 02:28:39,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:28:39,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:28:39,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:28:39,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:28:39,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (1/1) ... [2024-10-13 02:28:39,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:28:39,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:28:39,615 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 02:28:39,618 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 02:28:39,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:28:39,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:28:39,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:28:39,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:28:39,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:28:39,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:28:39,791 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:28:39,794 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:28:43,217 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 02:28:43,217 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:28:43,282 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:28:43,282 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:28:43,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:28:43 BoogieIcfgContainer [2024-10-13 02:28:43,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:28:43,285 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:28:43,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:28:43,289 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:28:43,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:28:38" (1/3) ... [2024-10-13 02:28:43,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb8da8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:28:43, skipping insertion in model container [2024-10-13 02:28:43,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:28:39" (2/3) ... [2024-10-13 02:28:43,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb8da8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:28:43, skipping insertion in model container [2024-10-13 02:28:43,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:28:43" (3/3) ... [2024-10-13 02:28:43,294 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-15.i [2024-10-13 02:28:43,323 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:28:43,323 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:28:43,393 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:28:43,400 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;@5e9a9ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:28:43,400 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:28:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 02:28:43,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-13 02:28:43,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:43,423 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:28:43,424 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:43,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:43,430 INFO L85 PathProgramCache]: Analyzing trace with hash 403408339, now seen corresponding path program 1 times [2024-10-13 02:28:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:28:43,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841460062] [2024-10-13 02:28:43,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:43,447 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 02:28:43,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:28:43,451 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 02:28:43,452 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 02:28:43,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:44,016 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 02:28:44,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:28:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 02:28:46,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:28:46,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:28:46,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841460062] [2024-10-13 02:28:46,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841460062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:28:46,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:28:46,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:28:46,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616333378] [2024-10-13 02:28:46,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:28:46,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:28:46,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:28:46,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:28:46,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:28:46,045 INFO L87 Difference]: Start difference. First operand has 89 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:28:48,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:28:49,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:28:49,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:28:49,760 INFO L93 Difference]: Finished difference Result 258 states and 480 transitions. [2024-10-13 02:28:49,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:28:49,779 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 190 [2024-10-13 02:28:49,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:28:49,788 INFO L225 Difference]: With dead ends: 258 [2024-10-13 02:28:49,788 INFO L226 Difference]: Without dead ends: 170 [2024-10-13 02:28:49,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:28:49,794 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 74 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-13 02:28:49,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 372 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-13 02:28:49,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-10-13 02:28:49,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 140. [2024-10-13 02:28:49,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 02:28:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 217 transitions. [2024-10-13 02:28:49,893 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 217 transitions. Word has length 190 [2024-10-13 02:28:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:28:49,897 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 217 transitions. [2024-10-13 02:28:49,897 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, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:28:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 217 transitions. [2024-10-13 02:28:49,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 02:28:49,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:28:49,903 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:28:49,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 02:28:50,103 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 02:28:50,104 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:28:50,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:28:50,105 INFO L85 PathProgramCache]: Analyzing trace with hash 591694506, now seen corresponding path program 1 times [2024-10-13 02:28:50,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:28:50,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569188587] [2024-10-13 02:28:50,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:28:50,106 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 02:28:50,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:28:50,109 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 02:28:50,110 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 02:28:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:28:50,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 02:28:50,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:28:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 02:28:52,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:28:52,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:28:52,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569188587] [2024-10-13 02:28:52,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569188587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:28:52,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:28:52,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:28:52,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708581586] [2024-10-13 02:28:52,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:28:52,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:28:52,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:28:52,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:28:52,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:28:52,568 INFO L87 Difference]: Start difference. First operand 140 states and 217 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:28:53,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:28:56,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:29:07,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 02:29:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:29:08,494 INFO L93 Difference]: Finished difference Result 308 states and 481 transitions. [2024-10-13 02:29:08,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:29:08,508 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 191 [2024-10-13 02:29:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:29:08,511 INFO L225 Difference]: With dead ends: 308 [2024-10-13 02:29:08,511 INFO L226 Difference]: Without dead ends: 224 [2024-10-13 02:29:08,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:29:08,514 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 118 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2024-10-13 02:29:08,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 338 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 15.5s Time] [2024-10-13 02:29:08,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-10-13 02:29:08,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 143. [2024-10-13 02:29:08,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 80 states have (on average 1.25) internal successors, (100), 80 states have internal predecessors, (100), 60 states have call successors, (60), 2 states have call predecessors, (60), 2 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 02:29:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 220 transitions. [2024-10-13 02:29:08,565 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 220 transitions. Word has length 191 [2024-10-13 02:29:08,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:29:08,566 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 220 transitions. [2024-10-13 02:29:08,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:29:08,566 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 220 transitions. [2024-10-13 02:29:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-10-13 02:29:08,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:29:08,569 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:29:08,595 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 02:29:08,773 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 02:29:08,774 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:29:08,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:29:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash -996653396, now seen corresponding path program 1 times [2024-10-13 02:29:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:29:08,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815461734] [2024-10-13 02:29:08,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:29:08,776 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 02:29:08,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:29:08,779 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 02:29:08,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 (4)] Waiting until timeout for monitored process [2024-10-13 02:29:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:29:09,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:29:09,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:29:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 896 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-10-13 02:29:10,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:29:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-13 02:29:11,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:29:11,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815461734] [2024-10-13 02:29:11,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815461734] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:29:11,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:29:11,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-13 02:29:11,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804536550] [2024-10-13 02:29:11,360 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:29:11,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 02:29:11,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:29:11,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 02:29:11,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:29:11,363 INFO L87 Difference]: Start difference. First operand 143 states and 220 transitions. Second operand has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-13 02:29:15,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:29:17,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:29:17,112 INFO L93 Difference]: Finished difference Result 329 states and 498 transitions. [2024-10-13 02:29:17,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 02:29:17,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) Word has length 191 [2024-10-13 02:29:17,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:29:17,128 INFO L225 Difference]: With dead ends: 329 [2024-10-13 02:29:17,128 INFO L226 Difference]: Without dead ends: 242 [2024-10-13 02:29:17,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 373 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2024-10-13 02:29:17,131 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 444 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:29:17,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 394 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-13 02:29:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-10-13 02:29:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 148. [2024-10-13 02:29:17,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 83 states have internal predecessors, (102), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 02:29:17,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2024-10-13 02:29:17,188 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 191 [2024-10-13 02:29:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:29:17,190 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2024-10-13 02:29:17,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.636363636363637) internal successors, (84), 11 states have internal predecessors, (84), 4 states have call successors, (60), 3 states have call predecessors, (60), 5 states have return successors, (60), 4 states have call predecessors, (60), 4 states have call successors, (60) [2024-10-13 02:29:17,190 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2024-10-13 02:29:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-13 02:29:17,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:29:17,193 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:29:17,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-13 02:29:17,394 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 02:29:17,394 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:29:17,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:29:17,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2016687313, now seen corresponding path program 1 times [2024-10-13 02:29:17,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:29:17,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342435321] [2024-10-13 02:29:17,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:29:17,396 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 02:29:17,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:29:17,399 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 02:29:17,405 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 02:29:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:29:17,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 02:29:17,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:29:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 899 proven. 42 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2024-10-13 02:29:18,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:29:18,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 45 proven. 42 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-10-13 02:29:18,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:29:18,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342435321] [2024-10-13 02:29:18,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342435321] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 02:29:18,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:29:18,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-10-13 02:29:18,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355210099] [2024-10-13 02:29:18,615 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:29:18,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 02:29:18,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:29:18,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 02:29:18,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 02:29:18,617 INFO L87 Difference]: Start difference. First operand 148 states and 222 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-13 02:29:20,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:29:20,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:29:20,770 INFO L93 Difference]: Finished difference Result 249 states and 364 transitions. [2024-10-13 02:29:20,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 02:29:20,787 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 192 [2024-10-13 02:29:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:29:20,789 INFO L225 Difference]: With dead ends: 249 [2024-10-13 02:29:20,789 INFO L226 Difference]: Without dead ends: 161 [2024-10-13 02:29:20,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 375 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-13 02:29:20,792 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 103 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:29:20,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 185 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-13 02:29:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-13 02:29:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2024-10-13 02:29:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 86 states have internal predecessors, (94), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 02:29:20,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 214 transitions. [2024-10-13 02:29:20,832 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 214 transitions. Word has length 192 [2024-10-13 02:29:20,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:29:20,833 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 214 transitions. [2024-10-13 02:29:20,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-10-13 02:29:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 214 transitions. [2024-10-13 02:29:20,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 02:29:20,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:29:20,838 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:29:20,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 02:29:21,039 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 02:29:21,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:29:21,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:29:21,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1200864503, now seen corresponding path program 1 times [2024-10-13 02:29:21,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:29:21,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1841260748] [2024-10-13 02:29:21,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:29:21,040 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 02:29:21,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:29:21,042 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 02:29:21,043 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 02:29:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:29:21,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 02:29:21,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:29:22,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2024-10-13 02:29:22,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:29:22,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:29:22,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1841260748] [2024-10-13 02:29:22,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1841260748] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:29:22,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [422130805] [2024-10-13 02:29:22,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:29:22,619 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 02:29:22,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 02:29:22,621 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 02:29:22,622 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 02:29:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:29:23,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 02:29:23,100 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:29:23,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-10-13 02:29:23,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:29:23,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [422130805] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:29:23,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 02:29:23,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-13 02:29:23,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925037641] [2024-10-13 02:29:23,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:29:23,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:29:23,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:29:23,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:29:23,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-13 02:29:23,234 INFO L87 Difference]: Start difference. First operand 153 states and 214 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:29:24,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:29:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:29:24,557 INFO L93 Difference]: Finished difference Result 245 states and 340 transitions. [2024-10-13 02:29:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:29:24,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 194 [2024-10-13 02:29:24,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:29:24,581 INFO L225 Difference]: With dead ends: 245 [2024-10-13 02:29:24,581 INFO L226 Difference]: Without dead ends: 153 [2024-10-13 02:29:24,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-13 02:29:24,583 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:29:24,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 326 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 02:29:24,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-13 02:29:24,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-10-13 02:29:24,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 86 states have (on average 1.0813953488372092) internal successors, (93), 86 states have internal predecessors, (93), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 02:29:24,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 213 transitions. [2024-10-13 02:29:24,618 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 213 transitions. Word has length 194 [2024-10-13 02:29:24,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:29:24,619 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 213 transitions. [2024-10-13 02:29:24,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-10-13 02:29:24,619 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 213 transitions. [2024-10-13 02:29:24,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 02:29:24,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:29:24,621 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:29:24,631 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 02:29:24,833 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 02:29:25,022 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 02:29:25,023 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:29:25,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:29:25,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1319095431, now seen corresponding path program 1 times [2024-10-13 02:29:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:29:25,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1921948720] [2024-10-13 02:29:25,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:29:25,024 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 02:29:25,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:29:25,027 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 02:29:25,028 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 02:29:25,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:29:25,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-13 02:29:25,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:29:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2024-10-13 02:29:26,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:29:27,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:29:27,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1921948720] [2024-10-13 02:29:27,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1921948720] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:29:27,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1062564789] [2024-10-13 02:29:27,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:29:27,192 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-13 02:29:27,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-13 02:29:27,196 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 02:29:27,197 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 02:29:28,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:29:28,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 02:29:28,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:29:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 689 proven. 21 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2024-10-13 02:29:29,511 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:29:29,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1062564789] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 02:29:29,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 02:29:29,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-13 02:29:29,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747165971] [2024-10-13 02:29:29,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 02:29:29,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 02:29:29,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:29:29,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 02:29:29,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-13 02:29:29,641 INFO L87 Difference]: Start difference. First operand 153 states and 213 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 02:29:33,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:29:36,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:29:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:29:36,634 INFO L93 Difference]: Finished difference Result 359 states and 477 transitions. [2024-10-13 02:29:36,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 02:29:36,658 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 194 [2024-10-13 02:29:36,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:29:36,660 INFO L225 Difference]: With dead ends: 359 [2024-10-13 02:29:36,661 INFO L226 Difference]: Without dead ends: 270 [2024-10-13 02:29:36,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 426 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2024-10-13 02:29:36,662 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 302 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:29:36,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 545 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2024-10-13 02:29:36,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-10-13 02:29:36,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 237. [2024-10-13 02:29:36,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 142 states have (on average 1.0845070422535212) internal successors, (154), 143 states have internal predecessors, (154), 82 states have call successors, (82), 12 states have call predecessors, (82), 12 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2024-10-13 02:29:36,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 318 transitions. [2024-10-13 02:29:36,700 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 318 transitions. Word has length 194 [2024-10-13 02:29:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:29:36,700 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 318 transitions. [2024-10-13 02:29:36,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-10-13 02:29:36,701 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 318 transitions. [2024-10-13 02:29:36,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-10-13 02:29:36,703 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:29:36,703 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:29:36,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-10-13 02:29:36,915 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 02:29:37,103 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 02:29:37,104 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:29:37,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:29:37,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1964754615, now seen corresponding path program 1 times [2024-10-13 02:29:37,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:29:37,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142032027] [2024-10-13 02:29:37,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:29:37,106 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 02:29:37,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:29:37,108 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 02:29:37,109 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 02:29:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:29:37,407 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 02:29:37,412 INFO L278 TraceCheckSpWp]: Computing forward predicates...