./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.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 e5b330e68c043ac4746408eb41aca0051f406a21955b86ac6890b77c68015b10 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:54:19,181 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:54:19,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 04:54:19,266 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:54:19,267 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:54:19,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:54:19,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:54:19,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:54:19,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:54:19,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:54:19,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:54:19,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:54:19,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:54:19,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:54:19,293 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:54:19,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:54:19,293 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:54:19,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:54:19,294 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 04:54:19,294 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:54:19,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:54:19,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:54:19,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:54:19,296 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:54:19,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:54:19,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:54:19,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:54:19,297 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:54:19,298 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:54:19,298 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:54:19,298 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:54:19,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:54:19,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:54:19,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:54:19,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:54:19,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:54:19,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 04:54:19,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 04:54:19,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:54:19,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:54:19,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:54:19,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:54:19,302 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 -> e5b330e68c043ac4746408eb41aca0051f406a21955b86ac6890b77c68015b10 [2024-11-10 04:54:19,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:54:19,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:54:19,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:54:19,616 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:54:19,616 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:54:19,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i [2024-11-10 04:54:21,139 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:54:21,335 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:54:21,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i [2024-11-10 04:54:21,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/649d2cb8b/66404b8276db4c51a2257a509d47bde6/FLAG6a47a8be4 [2024-11-10 04:54:21,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/649d2cb8b/66404b8276db4c51a2257a509d47bde6 [2024-11-10 04:54:21,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:54:21,374 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:54:21,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:54:21,375 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:54:21,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:54:21,380 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:21,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fff41b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21, skipping insertion in model container [2024-11-10 04:54:21,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:21,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:54:21,609 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i[919,932] [2024-11-10 04:54:21,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:54:21,705 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:54:21,716 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i[919,932] [2024-11-10 04:54:21,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:54:21,785 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:54:21,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21 WrapperNode [2024-11-10 04:54:21,786 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:54:21,787 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:54:21,787 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:54:21,787 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:54:21,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:21,805 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:21,895 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2024-11-10 04:54:21,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:54:21,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:54:21,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:54:21,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:54:21,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:21,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:21,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:21,964 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:54:21,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:21,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:21,981 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:21,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:21,991 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:21,998 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:22,006 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:54:22,007 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:54:22,008 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:54:22,009 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:54:22,010 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (1/1) ... [2024-11-10 04:54:22,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:54:22,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:54:22,045 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 04:54:22,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 04:54:22,101 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:54:22,101 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:54:22,102 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:54:22,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 04:54:22,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:54:22,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:54:22,205 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:54:22,207 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:54:22,688 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 04:54:22,689 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:54:22,719 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:54:22,720 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:54:22,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:54:22 BoogieIcfgContainer [2024-11-10 04:54:22,721 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:54:22,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:54:22,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:54:22,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:54:22,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:54:21" (1/3) ... [2024-11-10 04:54:22,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570ee677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:54:22, skipping insertion in model container [2024-11-10 04:54:22,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:21" (2/3) ... [2024-11-10 04:54:22,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570ee677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:54:22, skipping insertion in model container [2024-11-10 04:54:22,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:54:22" (3/3) ... [2024-11-10 04:54:22,732 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i [2024-11-10 04:54:22,749 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:54:22,749 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:54:22,808 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:54:22,814 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;@46d730ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:54:22,814 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:54:22,819 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:54:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 04:54:22,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:22,837 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:22,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:22,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:22,845 INFO L85 PathProgramCache]: Analyzing trace with hash 924688779, now seen corresponding path program 1 times [2024-11-10 04:54:22,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:22,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809324965] [2024-11-10 04:54:22,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:54:23,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:54:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:54:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:54:23,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:54:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:54:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:54:23,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:54:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:54:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:54:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:54:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:54:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:54:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:54:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:54:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:54:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:54:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:54:23,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:54:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:54:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:54:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:54:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:54:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:54:23,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:54:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:54:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:54:23,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:54:23,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809324965] [2024-11-10 04:54:23,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809324965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:23,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:23,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:54:23,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600995646] [2024-11-10 04:54:23,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:23,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:54:23,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:54:23,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:54:23,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:54:23,400 INFO L87 Difference]: Start difference. First operand has 99 states, 70 states have (on average 1.5) internal successors, (105), 71 states have internal predecessors, (105), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:54:23,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:23,450 INFO L93 Difference]: Finished difference Result 190 states and 333 transitions. [2024-11-10 04:54:23,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:54:23,454 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 176 [2024-11-10 04:54:23,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:23,463 INFO L225 Difference]: With dead ends: 190 [2024-11-10 04:54:23,463 INFO L226 Difference]: Without dead ends: 94 [2024-11-10 04:54:23,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:54:23,470 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:23,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:54:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-10 04:54:23,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-10 04:54:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:54:23,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 146 transitions. [2024-11-10 04:54:23,526 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 146 transitions. Word has length 176 [2024-11-10 04:54:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:23,527 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 146 transitions. [2024-11-10 04:54:23,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:54:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 146 transitions. [2024-11-10 04:54:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 04:54:23,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:23,533 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:23,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 04:54:23,533 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:23,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:23,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1261688201, now seen corresponding path program 1 times [2024-11-10 04:54:23,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:23,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124300547] [2024-11-10 04:54:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:23,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:54:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:54:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:54:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:54:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:54:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:54:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:54:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:54:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:54:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:54:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:54:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:54:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:54:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:54:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:54:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:54:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:54:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:54:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:54:23,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:54:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:54:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:54:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:54:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:54:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:54:23,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:54:23,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:23,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:54:23,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:54:23,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124300547] [2024-11-10 04:54:23,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124300547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:23,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:23,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:54:23,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903184426] [2024-11-10 04:54:23,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:23,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:54:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:54:23,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:54:23,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:54:23,989 INFO L87 Difference]: Start difference. First operand 94 states and 146 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:54:24,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:24,084 INFO L93 Difference]: Finished difference Result 247 states and 384 transitions. [2024-11-10 04:54:24,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:54:24,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-10 04:54:24,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:24,095 INFO L225 Difference]: With dead ends: 247 [2024-11-10 04:54:24,096 INFO L226 Difference]: Without dead ends: 156 [2024-11-10 04:54:24,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:54:24,098 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 74 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 302 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.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:24,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 302 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:54:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-10 04:54:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2024-11-10 04:54:24,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 113 states have (on average 1.4513274336283186) internal successors, (164), 114 states have internal predecessors, (164), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 04:54:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 236 transitions. [2024-11-10 04:54:24,141 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 236 transitions. Word has length 176 [2024-11-10 04:54:24,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:24,142 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 236 transitions. [2024-11-10 04:54:24,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:54:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 236 transitions. [2024-11-10 04:54:24,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 04:54:24,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:24,149 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:24,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 04:54:24,150 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:24,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1290317352, now seen corresponding path program 1 times [2024-11-10 04:54:24,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:24,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254802710] [2024-11-10 04:54:24,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:24,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:54:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:54:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:54:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:54:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:54:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:54:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:54:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:54:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:54:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:54:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:54:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:54:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:54:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:54:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:54:24,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:54:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:54:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:54:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:54:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:54:24,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:54:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:54:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:54:24,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:54:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:54:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:54:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:54:24,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:54:24,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254802710] [2024-11-10 04:54:24,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254802710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:24,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:24,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:54:24,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002264799] [2024-11-10 04:54:24,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:24,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:54:24,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:54:24,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:54:24,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:54:24,540 INFO L87 Difference]: Start difference. First operand 152 states and 236 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:54:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:24,669 INFO L93 Difference]: Finished difference Result 372 states and 579 transitions. [2024-11-10 04:54:24,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:54:24,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-10 04:54:24,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:24,678 INFO L225 Difference]: With dead ends: 372 [2024-11-10 04:54:24,678 INFO L226 Difference]: Without dead ends: 223 [2024-11-10 04:54:24,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:54:24,681 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 55 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:24,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 292 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:54:24,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-10 04:54:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 160. [2024-11-10 04:54:24,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.4545454545454546) internal successors, (176), 122 states have internal predecessors, (176), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-10 04:54:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 248 transitions. [2024-11-10 04:54:24,735 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 248 transitions. Word has length 176 [2024-11-10 04:54:24,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:24,737 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 248 transitions. [2024-11-10 04:54:24,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:54:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 248 transitions. [2024-11-10 04:54:24,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-10 04:54:24,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:24,741 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:24,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 04:54:24,742 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:24,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:24,742 INFO L85 PathProgramCache]: Analyzing trace with hash 881493127, now seen corresponding path program 1 times [2024-11-10 04:54:24,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:24,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400498303] [2024-11-10 04:54:24,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:24,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:54:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:54:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:54:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:54:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:54:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:54:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:54:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:54:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:54:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:54:24,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:54:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:54:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:54:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:54:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:54:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:54:24,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:54:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:54:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:54:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:54:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:54:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:54:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:24,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:54:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:54:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:54:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:54:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:54:25,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:54:25,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400498303] [2024-11-10 04:54:25,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400498303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:25,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:25,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:54:25,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832876915] [2024-11-10 04:54:25,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:25,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:54:25,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:54:25,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:54:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:54:25,018 INFO L87 Difference]: Start difference. First operand 160 states and 248 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:54:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:25,106 INFO L93 Difference]: Finished difference Result 388 states and 599 transitions. [2024-11-10 04:54:25,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:54:25,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-10 04:54:25,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:25,111 INFO L225 Difference]: With dead ends: 388 [2024-11-10 04:54:25,114 INFO L226 Difference]: Without dead ends: 231 [2024-11-10 04:54:25,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:54:25,120 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 49 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:25,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 273 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 04:54:25,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-10 04:54:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 226. [2024-11-10 04:54:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 184 states have internal predecessors, (268), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-10 04:54:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 348 transitions. [2024-11-10 04:54:25,147 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 348 transitions. Word has length 176 [2024-11-10 04:54:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:25,147 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 348 transitions. [2024-11-10 04:54:25,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:54:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 348 transitions. [2024-11-10 04:54:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-10 04:54:25,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:25,155 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:25,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 04:54:25,156 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:25,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:25,156 INFO L85 PathProgramCache]: Analyzing trace with hash 214796424, now seen corresponding path program 1 times [2024-11-10 04:54:25,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:25,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792353955] [2024-11-10 04:54:25,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:25,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 04:54:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 04:54:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 04:54:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 04:54:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 04:54:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 04:54:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-10 04:54:25,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 04:54:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 04:54:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 04:54:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 04:54:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 04:54:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 04:54:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 04:54:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 04:54:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 04:54:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 04:54:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 04:54:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-10 04:54:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 04:54:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-10 04:54:25,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 04:54:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-10 04:54:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 04:54:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-10 04:54:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 04:54:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:25,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 42 proven. 33 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:54:25,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 04:54:25,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792353955] [2024-11-10 04:54:25,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792353955] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 04:54:25,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613891015] [2024-11-10 04:54:25,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:25,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:54:25,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:54:25,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:54:25,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 04:54:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:26,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-10 04:54:26,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:54:27,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 682 proven. 60 refuted. 0 times theorem prover too weak. 558 trivial. 0 not checked. [2024-11-10 04:54:27,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:54:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 84 proven. 63 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2024-11-10 04:54:27,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613891015] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:54:27,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 04:54:27,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 11] total 24 [2024-11-10 04:54:27,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678933167] [2024-11-10 04:54:27,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 04:54:27,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 04:54:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 04:54:27,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 04:54:27,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552 [2024-11-10 04:54:27,966 INFO L87 Difference]: Start difference. First operand 226 states and 348 transitions. Second operand has 24 states, 23 states have (on average 5.956521739130435) internal successors, (137), 23 states have internal predecessors, (137), 6 states have call successors, (78), 4 states have call predecessors, (78), 8 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2024-11-10 04:54:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:30,891 INFO L93 Difference]: Finished difference Result 1739 states and 2606 transitions. [2024-11-10 04:54:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2024-11-10 04:54:30,892 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.956521739130435) internal successors, (137), 23 states have internal predecessors, (137), 6 states have call successors, (78), 4 states have call predecessors, (78), 8 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) Word has length 177 [2024-11-10 04:54:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:30,904 INFO L225 Difference]: With dead ends: 1739 [2024-11-10 04:54:30,904 INFO L226 Difference]: Without dead ends: 1516 [2024-11-10 04:54:30,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1876 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1438, Invalid=4414, Unknown=0, NotChecked=0, Total=5852 [2024-11-10 04:54:30,911 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 1751 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1793 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:30,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1793 Valid, 1299 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 04:54:30,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2024-11-10 04:54:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 741. [2024-11-10 04:54:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 586 states have (on average 1.4863481228668942) internal successors, (871), 593 states have internal predecessors, (871), 136 states have call successors, (136), 18 states have call predecessors, (136), 18 states have return successors, (136), 129 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-10 04:54:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1143 transitions. [2024-11-10 04:54:30,991 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1143 transitions. Word has length 177 [2024-11-10 04:54:30,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:30,991 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1143 transitions. [2024-11-10 04:54:30,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.956521739130435) internal successors, (137), 23 states have internal predecessors, (137), 6 states have call successors, (78), 4 states have call predecessors, (78), 8 states have return successors, (78), 6 states have call predecessors, (78), 6 states have call successors, (78) [2024-11-10 04:54:30,992 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1143 transitions. [2024-11-10 04:54:30,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-10 04:54:30,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:30,994 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:31,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 04:54:31,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:54:31,196 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:31,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:31,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1911533816, now seen corresponding path program 1 times [2024-11-10 04:54:31,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 04:54:31,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779861049] [2024-11-10 04:54:31,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:31,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 04:54:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 04:54:31,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1428318945] [2024-11-10 04:54:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:31,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 04:54:31,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:54:31,333 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 04:54:31,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 04:54:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:54:31,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 04:54:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 04:54:31,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 04:54:31,695 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 04:54:31,698 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 04:54:31,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 04:54:31,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 04:54:31,905 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 04:54:32,034 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 04:54:32,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 04:54:32 BoogieIcfgContainer [2024-11-10 04:54:32,039 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 04:54:32,040 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 04:54:32,040 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 04:54:32,041 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 04:54:32,042 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:54:22" (3/4) ... [2024-11-10 04:54:32,045 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 04:54:32,046 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 04:54:32,047 INFO L158 Benchmark]: Toolchain (without parser) took 10673.17ms. Allocated memory was 142.6MB in the beginning and 270.5MB in the end (delta: 127.9MB). Free memory was 87.6MB in the beginning and 194.6MB in the end (delta: -107.0MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2024-11-10 04:54:32,047 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 142.6MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 04:54:32,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.24ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 69.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 04:54:32,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.50ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 69.4MB in the beginning and 156.4MB in the end (delta: -87.0MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2024-11-10 04:54:32,048 INFO L158 Benchmark]: Boogie Preprocessor took 109.99ms. Allocated memory is still 186.6MB. Free memory was 156.4MB in the beginning and 150.4MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 04:54:32,048 INFO L158 Benchmark]: IcfgBuilder took 713.88ms. Allocated memory is still 186.6MB. Free memory was 150.4MB in the beginning and 118.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-10 04:54:32,049 INFO L158 Benchmark]: TraceAbstraction took 9315.82ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 118.9MB in the beginning and 195.6MB in the end (delta: -76.7MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2024-11-10 04:54:32,049 INFO L158 Benchmark]: Witness Printer took 6.46ms. Allocated memory is still 270.5MB. Free memory was 195.6MB in the beginning and 194.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 04:54:32,051 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.25ms. Allocated memory is still 142.6MB. Free memory is still 102.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.24ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 69.4MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 109.50ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 69.4MB in the beginning and 156.4MB in the end (delta: -87.0MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.99ms. Allocated memory is still 186.6MB. Free memory was 156.4MB in the beginning and 150.4MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 713.88ms. Allocated memory is still 186.6MB. Free memory was 150.4MB in the beginning and 118.9MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9315.82ms. Allocated memory was 186.6MB in the beginning and 270.5MB in the end (delta: 83.9MB). Free memory was 118.9MB in the beginning and 195.6MB in the end (delta: -76.7MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. * Witness Printer took 6.46ms. Allocated memory is still 270.5MB. Free memory was 195.6MB in the beginning and 194.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 182, overapproximation of someBinaryDOUBLEComparisonOperation at line 182. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 256; [L23] unsigned short int var_1_2 = 51640; [L24] unsigned short int var_1_3 = 5; [L25] float var_1_7 = 128.8; [L26] unsigned char var_1_8 = 2; [L27] float var_1_9 = 256.5; [L28] float var_1_10 = 7.25; [L29] signed char var_1_11 = 64; [L30] signed char var_1_12 = -16; [L31] double var_1_13 = 0.9; [L32] unsigned char var_1_14 = 1; [L33] double var_1_15 = 0.0; [L34] double var_1_16 = 1.275; [L35] unsigned short int var_1_17 = 8; [L36] unsigned short int var_1_18 = 35331; [L37] signed char var_1_19 = -128; [L38] double var_1_20 = 0.0; [L39] double var_1_21 = 0.0; [L40] signed char var_1_22 = -8; [L41] signed char var_1_23 = 50; [L42] signed long int var_1_27 = 32; [L43] unsigned char var_1_28 = 64; [L44] signed char var_1_29 = 100; [L45] signed char var_1_30 = -1; [L46] signed char var_1_31 = 10; [L47] signed char var_1_32 = 5; [L48] signed char var_1_33 = 1; [L49] unsigned short int var_1_34 = 32; [L50] signed long int var_1_36 = -8; [L51] float last_1_var_1_10 = 7.25; [L52] double last_1_var_1_13 = 0.9; [L53] unsigned short int last_1_var_1_17 = 8; [L54] signed char last_1_var_1_19 = -128; VAL [isInitial=0, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=51640, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L176] last_1_var_1_10 = var_1_10 [L177] last_1_var_1_13 = var_1_13 [L178] last_1_var_1_17 = var_1_17 [L179] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=51640, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L133] var_1_2 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_2 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L134] RET assume_abort_if_not(var_1_2 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L135] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L135] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=5, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L136] var_1_3 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L137] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] CALL assume_abort_if_not(var_1_3 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L138] RET assume_abort_if_not(var_1_3 <= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=2, var_1_9=513/2] [L139] var_1_8 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L140] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L141] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L141] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_9=513/2] [L142] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=513/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=513/2] [L142] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=513/2] [L143] var_1_9 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L144] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=-16, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L145] var_1_12 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L146] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L147] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L147] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=1, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L148] var_1_14 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L149] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L150] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L150] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_15=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L151] var_1_15 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L152] RET assume_abort_if_not((var_1_15 >= 2305843.009213691390e+12F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_16=51/40, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L153] var_1_16 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L154] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=35331, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L155] var_1_18 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_18 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L156] RET assume_abort_if_not(var_1_18 >= 32767) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L157] CALL assume_abort_if_not(var_1_18 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L157] RET assume_abort_if_not(var_1_18 <= 65534) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_20=0, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L158] var_1_20 = __VERIFIER_nondet_double() [L159] CALL assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L159] RET assume_abort_if_not((var_1_20 >= 4611686.018427387900e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_21=0, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L160] var_1_21 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L161] RET assume_abort_if_not((var_1_21 >= 4611686.018427387900e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=-8, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L162] var_1_22 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_22 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L163] RET assume_abort_if_not(var_1_22 >= -127) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L164] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L164] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=-1, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L165] var_1_30 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_30 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L166] RET assume_abort_if_not(var_1_30 >= -126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L167] CALL assume_abort_if_not(var_1_30 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L167] RET assume_abort_if_not(var_1_30 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=10, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L168] var_1_31 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L169] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L170] CALL assume_abort_if_not(var_1_31 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L170] RET assume_abort_if_not(var_1_31 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=1, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L171] var_1_33 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L172] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L173] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L173] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L190] RET updateVariables() [L191] CALL step() [L58] signed long int stepLocal_2 = var_1_3 + last_1_var_1_19; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L59] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=-128, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L70] COND TRUE var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16)) [L71] var_1_19 = ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=8, var_1_18=-98305, var_1_19=1, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L75] var_1_17 = (var_1_18 - var_1_3) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=29/4, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257] [L76] COND TRUE (var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10) [L77] var_1_10 = var_1_9 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L79] COND TRUE var_1_10 >= var_1_10 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=64, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L80] COND TRUE var_1_9 < var_1_10 [L81] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=256, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L84] COND TRUE (var_1_2 - var_1_3) > var_1_17 [L85] var_1_1 = (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L89] signed long int stepLocal_1 = var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))); [L90] unsigned short int stepLocal_0 = var_1_3; VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_1=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L91] COND FALSE !((var_1_19 / var_1_8) < stepLocal_1) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L98] COND TRUE (~ (- var_1_3)) < var_1_2 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L99] COND FALSE !(var_1_2 < -64) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=32, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L103] COND TRUE var_1_8 > var_1_19 [L104] var_1_27 = ((((var_1_8) > (var_1_22)) ? (var_1_8) : (var_1_22))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=255, var_1_28=64, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L106] COND TRUE var_1_17 <= (((((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) < 0 ) ? -((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) : ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))))) [L107] var_1_28 = 4 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=100, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L109] COND TRUE var_1_12 <= 16 [L110] var_1_29 = (((((var_1_30) < 0 ) ? -(var_1_30) : (var_1_30))) - var_1_31) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=5, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L112] COND TRUE var_1_11 >= var_1_1 [L113] var_1_32 = ((((4) < (((((var_1_22) < ((var_1_31 - var_1_33))) ? (var_1_22) : ((var_1_31 - var_1_33)))))) ? (4) : (((((var_1_22) < ((var_1_31 - var_1_33))) ? (var_1_22) : ((var_1_31 - var_1_33))))))) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L117] EXPR var_1_17 & var_1_11 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L117] EXPR (var_1_17 & var_1_11) ^ var_1_12 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L117] EXPR var_1_19 & var_1_33 VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L117] COND FALSE !(((var_1_17 & var_1_11) ^ var_1_12) < (var_1_19 & var_1_33)) [L122] EXPR var_1_3 & (~ var_1_17) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L122] COND TRUE (var_1_3 & (~ var_1_17)) <= var_1_3 [L123] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, stepLocal_0=0, stepLocal_2=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return ((((((((var_1_2 - var_1_3) > var_1_17) ? (var_1_1 == ((signed long int) (((((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) < (var_1_17)) ? ((((((var_1_11 + var_1_3)) < (var_1_2)) ? ((var_1_11 + var_1_3)) : (var_1_2)))) : (var_1_17))))) : (var_1_1 == ((signed long int) 0))) && (((var_1_19 / var_1_8) < (var_1_1 / ((((2) < (var_1_2)) ? (2) : (var_1_2))))) ? ((var_1_1 >= var_1_3) ? (var_1_7 == ((float) 0.75f)) : (var_1_7 == ((float) var_1_9))) : 1)) && (((var_1_17 >= var_1_17) || (var_1_9 > last_1_var_1_10)) ? (var_1_10 == ((float) var_1_9)) : 1)) && ((var_1_10 >= var_1_10) ? ((var_1_9 < var_1_10) ? (var_1_11 == ((signed char) var_1_12)) : 1) : 1)) && (var_1_14 ? ((last_1_var_1_13 <= var_1_9) ? (var_1_13 == ((double) var_1_9)) : ((((((last_1_var_1_17) < ((var_1_2 * last_1_var_1_17))) ? (last_1_var_1_17) : ((var_1_2 * last_1_var_1_17)))) == (var_1_3 + last_1_var_1_19)) ? (var_1_13 == ((double) 8.75)) : (var_1_13 == ((double) (16.5 + ((var_1_15 - 49.35) - var_1_16)))))) : 1)) && (var_1_17 == ((unsigned short int) (var_1_18 - var_1_3)))) && ((var_1_13 > ((var_1_20 - var_1_15) - (var_1_21 - var_1_16))) ? (var_1_19 == ((signed char) ((((var_1_12) > (var_1_22)) ? (var_1_12) : (var_1_22))))) : (var_1_19 == ((signed char) var_1_12))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=29/4, last_1_var_1_13=9/10, last_1_var_1_17=8, last_1_var_1_19=-128, var_1_10=2, var_1_11=0, var_1_12=0, var_1_13=9/10, var_1_14=0, var_1_17=32767, var_1_18=-98305, var_1_19=1, var_1_1=0, var_1_22=1, var_1_23=50, var_1_27=255, var_1_28=4, var_1_29=0, var_1_2=32768, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=0, var_1_34=32, var_1_36=-8, var_1_3=0, var_1_7=644/5, var_1_8=-257, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1971 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1929 mSDsluCounter, 2308 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1541 mSDsCounter, 297 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1215 IncrementalHoareTripleChecker+Invalid, 1512 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 297 mSolverCounterUnsat, 767 mSDtfsCounter, 1215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 721 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1876 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=741occurred in iteration=5, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 847 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1414 NumberOfCodeBlocks, 1414 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1228 ConstructedInterpolants, 0 QuantifiedInterpolants, 3689 SizeOfPredicates, 6 NumberOfNonLiveVariables, 421 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 8944/9100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 04:54:32,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.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 e5b330e68c043ac4746408eb41aca0051f406a21955b86ac6890b77c68015b10 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 04:54:34,468 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 04:54:34,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 04:54:34,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 04:54:34,557 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 04:54:34,593 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 04:54:34,594 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 04:54:34,594 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 04:54:34,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 04:54:34,595 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 04:54:34,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 04:54:34,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 04:54:34,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 04:54:34,598 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 04:54:34,598 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 04:54:34,598 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 04:54:34,598 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 04:54:34,599 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 04:54:34,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 04:54:34,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 04:54:34,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 04:54:34,602 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 04:54:34,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 04:54:34,603 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 04:54:34,603 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 04:54:34,603 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 04:54:34,604 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 04:54:34,604 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 04:54:34,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 04:54:34,604 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 04:54:34,605 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 04:54:34,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 04:54:34,605 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 04:54:34,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 04:54:34,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:54:34,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 04:54:34,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 04:54:34,610 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 04:54:34,611 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 04:54:34,612 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 04:54:34,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 04:54:34,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 04:54:34,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 04:54:34,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 04:54:34,613 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 -> e5b330e68c043ac4746408eb41aca0051f406a21955b86ac6890b77c68015b10 [2024-11-10 04:54:34,969 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 04:54:34,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 04:54:34,997 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 04:54:34,998 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 04:54:34,999 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 04:54:35,001 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i [2024-11-10 04:54:36,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 04:54:36,918 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 04:54:36,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i [2024-11-10 04:54:36,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb0372d9/a703c2b608df4008ae95cef9883ef270/FLAGf0f4eb124 [2024-11-10 04:54:36,954 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb0372d9/a703c2b608df4008ae95cef9883ef270 [2024-11-10 04:54:36,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 04:54:36,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 04:54:36,962 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 04:54:36,962 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 04:54:36,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 04:54:36,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:36" (1/1) ... [2024-11-10 04:54:36,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38263b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:36, skipping insertion in model container [2024-11-10 04:54:36,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 04:54:36" (1/1) ... [2024-11-10 04:54:37,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 04:54:37,214 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i[919,932] [2024-11-10 04:54:37,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:54:37,337 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 04:54:37,351 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i[919,932] [2024-11-10 04:54:37,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 04:54:37,430 INFO L204 MainTranslator]: Completed translation [2024-11-10 04:54:37,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37 WrapperNode [2024-11-10 04:54:37,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 04:54:37,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 04:54:37,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 04:54:37,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 04:54:37,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (1/1) ... [2024-11-10 04:54:37,459 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (1/1) ... [2024-11-10 04:54:37,498 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 186 [2024-11-10 04:54:37,503 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 04:54:37,504 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 04:54:37,504 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 04:54:37,504 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 04:54:37,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (1/1) ... [2024-11-10 04:54:37,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (1/1) ... [2024-11-10 04:54:37,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (1/1) ... [2024-11-10 04:54:37,540 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 04:54:37,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (1/1) ... [2024-11-10 04:54:37,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (1/1) ... [2024-11-10 04:54:37,559 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (1/1) ... [2024-11-10 04:54:37,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (1/1) ... [2024-11-10 04:54:37,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (1/1) ... [2024-11-10 04:54:37,564 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (1/1) ... [2024-11-10 04:54:37,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 04:54:37,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 04:54:37,569 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 04:54:37,569 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 04:54:37,570 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (1/1) ... [2024-11-10 04:54:37,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 04:54:37,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 04:54:37,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-11-10 04:54:37,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-11-10 04:54:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 04:54:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 04:54:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 04:54:37,664 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 04:54:37,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 04:54:37,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 04:54:37,753 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 04:54:37,756 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 04:54:53,528 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 04:54:53,529 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 04:54:53,544 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 04:54:53,545 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 04:54:53,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:54:53 BoogieIcfgContainer [2024-11-10 04:54:53,545 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 04:54:53,547 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 04:54:53,547 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 04:54:53,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 04:54:53,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 04:54:36" (1/3) ... [2024-11-10 04:54:53,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abf714c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:54:53, skipping insertion in model container [2024-11-10 04:54:53,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 04:54:37" (2/3) ... [2024-11-10 04:54:53,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7abf714c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 04:54:53, skipping insertion in model container [2024-11-10 04:54:53,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 04:54:53" (3/3) ... [2024-11-10 04:54:53,554 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-37.i [2024-11-10 04:54:53,569 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 04:54:53,569 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 04:54:53,638 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 04:54:53,645 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;@1f73f238, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 04:54:53,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 04:54:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:54:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 04:54:53,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:53,671 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:53,672 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:53,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:53,679 INFO L85 PathProgramCache]: Analyzing trace with hash 176922642, now seen corresponding path program 1 times [2024-11-10 04:54:53,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:54:53,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086644551] [2024-11-10 04:54:53,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:53,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:54:53,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:54:53,702 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:54:53,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 04:54:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:54,391 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 04:54:54,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:54:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2024-11-10 04:54:54,463 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:54:54,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:54:54,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086644551] [2024-11-10 04:54:54,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086644551] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:54:54,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:54:54,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 04:54:54,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694174093] [2024-11-10 04:54:54,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:54:54,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 04:54:54,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:54:54,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 04:54:54,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:54:54,511 INFO L87 Difference]: Start difference. First operand has 86 states, 57 states have (on average 1.456140350877193) internal successors, (83), 58 states have internal predecessors, (83), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:54:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:54:54,558 INFO L93 Difference]: Finished difference Result 163 states and 287 transitions. [2024-11-10 04:54:54,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 04:54:54,562 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-11-10 04:54:54,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:54:54,572 INFO L225 Difference]: With dead ends: 163 [2024-11-10 04:54:54,573 INFO L226 Difference]: Without dead ends: 80 [2024-11-10 04:54:54,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 04:54:54,585 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:54:54,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 04:54:54,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-10 04:54:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-10 04:54:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 52 states have (on average 1.3461538461538463) internal successors, (70), 52 states have internal predecessors, (70), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:54:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 122 transitions. [2024-11-10 04:54:54,633 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 122 transitions. Word has length 172 [2024-11-10 04:54:54,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:54:54,634 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 122 transitions. [2024-11-10 04:54:54,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 04:54:54,634 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 122 transitions. [2024-11-10 04:54:54,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-10 04:54:54,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:54:54,638 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:54:54,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 04:54:54,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:54:54,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:54:54,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:54:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1059741455, now seen corresponding path program 1 times [2024-11-10 04:54:54,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:54:54,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [821498585] [2024-11-10 04:54:54,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:54:54,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:54:54,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:54:54,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:54:54,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 04:54:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:54:55,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 04:54:55,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:55:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 21 proven. 576 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 04:55:03,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 04:55:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 21 proven. 54 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-10 04:55:05,660 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:55:05,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [821498585] [2024-11-10 04:55:05,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [821498585] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 04:55:05,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 04:55:05,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-11-10 04:55:05,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306336708] [2024-11-10 04:55:05,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 04:55:05,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 04:55:05,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:55:05,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 04:55:05,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-10 04:55:05,668 INFO L87 Difference]: Start difference. First operand 80 states and 122 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-11-10 04:55:13,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:55:17,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:55:18,582 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-11-10 04:55:20,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:55:24,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:55:28,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:55:31,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:55:31,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:55:31,832 INFO L93 Difference]: Finished difference Result 163 states and 246 transitions. [2024-11-10 04:55:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 04:55:31,892 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) Word has length 172 [2024-11-10 04:55:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:55:31,894 INFO L225 Difference]: With dead ends: 163 [2024-11-10 04:55:31,894 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 04:55:31,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2024-11-10 04:55:31,897 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 177 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 110 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.0s IncrementalHoareTripleChecker+Time [2024-11-10 04:55:31,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 185 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 177 Invalid, 3 Unknown, 0 Unchecked, 25.0s Time] [2024-11-10 04:55:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 04:55:31,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2024-11-10 04:55:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-10 04:55:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2024-11-10 04:55:31,920 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 172 [2024-11-10 04:55:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:55:31,923 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2024-11-10 04:55:31,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (52), 3 states have call predecessors, (52), 5 states have return successors, (52), 4 states have call predecessors, (52), 4 states have call successors, (52) [2024-11-10 04:55:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2024-11-10 04:55:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 04:55:31,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:31,931 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:55:31,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 04:55:32,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:32,133 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:32,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash 887662935, now seen corresponding path program 1 times [2024-11-10 04:55:32,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:55:32,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479374901] [2024-11-10 04:55:32,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:32,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:32,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:55:32,136 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:55:32,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 04:55:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:32,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 04:55:32,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:55:32,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:55:32,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:55:32,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:55:32,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479374901] [2024-11-10 04:55:32,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479374901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:55:32,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:55:32,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:55:32,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825575695] [2024-11-10 04:55:32,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:55:32,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:55:32,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:55:32,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:55:32,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:55:32,752 INFO L87 Difference]: Start difference. First operand 84 states and 124 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:55:37,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:55:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:55:37,564 INFO L93 Difference]: Finished difference Result 182 states and 268 transitions. [2024-11-10 04:55:37,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:55:37,565 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-10 04:55:37,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:55:37,567 INFO L225 Difference]: With dead ends: 182 [2024-11-10 04:55:37,567 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 04:55:37,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:55:37,569 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 55 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-10 04:55:37,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 217 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2024-11-10 04:55:37,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 04:55:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-11-10 04:55:37,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 63 states have (on average 1.253968253968254) internal successors, (79), 64 states have internal predecessors, (79), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-10 04:55:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 145 transitions. [2024-11-10 04:55:37,590 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 145 transitions. Word has length 173 [2024-11-10 04:55:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:55:37,591 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 145 transitions. [2024-11-10 04:55:37,592 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:55:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 145 transitions. [2024-11-10 04:55:37,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 04:55:37,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:37,594 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:55:37,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 04:55:37,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:37,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:37,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:37,796 INFO L85 PathProgramCache]: Analyzing trace with hash -2053994664, now seen corresponding path program 1 times [2024-11-10 04:55:37,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:55:37,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471061791] [2024-11-10 04:55:37,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:37,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:37,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:55:37,801 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:55:37,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 04:55:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 04:55:38,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 04:55:38,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 04:55:38,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-10 04:55:38,584 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 04:55:38,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 04:55:38,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471061791] [2024-11-10 04:55:38,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471061791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 04:55:38,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 04:55:38,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 04:55:38,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710308581] [2024-11-10 04:55:38,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 04:55:38,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 04:55:38,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 04:55:38,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 04:55:38,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:55:38,588 INFO L87 Difference]: Start difference. First operand 100 states and 145 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:55:42,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:55:46,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 04:55:46,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 04:55:46,874 INFO L93 Difference]: Finished difference Result 241 states and 343 transitions. [2024-11-10 04:55:46,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 04:55:46,875 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-10 04:55:46,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 04:55:46,879 INFO L225 Difference]: With dead ends: 241 [2024-11-10 04:55:46,879 INFO L226 Difference]: Without dead ends: 156 [2024-11-10 04:55:46,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 04:55:46,882 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 52 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2024-11-10 04:55:46,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 2 Unknown, 0 Unchecked, 8.3s Time] [2024-11-10 04:55:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-10 04:55:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2024-11-10 04:55:46,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 102 states have (on average 1.2745098039215685) internal successors, (130), 104 states have internal predecessors, (130), 43 states have call successors, (43), 6 states have call predecessors, (43), 6 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-10 04:55:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2024-11-10 04:55:46,916 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 173 [2024-11-10 04:55:46,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 04:55:46,918 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2024-11-10 04:55:46,919 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-10 04:55:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2024-11-10 04:55:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-10 04:55:46,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 04:55:46,923 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 04:55:46,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 04:55:47,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:47,124 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 04:55:47,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 04:55:47,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2025365513, now seen corresponding path program 1 times [2024-11-10 04:55:47,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 04:55:47,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179748610] [2024-11-10 04:55:47,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 04:55:47,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 04:55:47,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 04:55:47,128 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 04:55:47,129 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