./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-pr-ci_file-26.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 9a0c37ebc273c362e4d2cb519b4c223d2a9b2256e1ef158a08ce7f4ca051bc4d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:20:40,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:20:40,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:20:40,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:20:40,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:20:40,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:20:40,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:20:40,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:20:40,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:20:40,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:20:40,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:20:40,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:20:40,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:20:40,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:20:40,840 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:20:40,841 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:20:40,841 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:20:40,841 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:20:40,842 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:20:40,842 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:20:40,842 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:20:40,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:20:40,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:20:40,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:20:40,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:20:40,846 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:20:40,846 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:20:40,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:20:40,847 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:20:40,847 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:20:40,848 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:20:40,848 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:20:40,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:20:40,849 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:20:40,849 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:20:40,849 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:20:40,850 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:20:40,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:20:40,850 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:20:40,850 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:20:40,850 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:20:40,851 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:20:40,851 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 -> 9a0c37ebc273c362e4d2cb519b4c223d2a9b2256e1ef158a08ce7f4ca051bc4d [2024-11-16 14:20:41,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:20:41,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:20:41,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:20:41,154 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:20:41,154 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:20:41,155 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-pr-ci_file-26.i [2024-11-16 14:20:42,810 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:20:43,039 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:20:43,040 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-11-16 14:20:43,059 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c4e4ac4/e444456c9ac54a038afd3baf34b931bf/FLAG304b9388b [2024-11-16 14:20:43,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44c4e4ac4/e444456c9ac54a038afd3baf34b931bf [2024-11-16 14:20:43,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:20:43,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:20:43,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:20:43,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:20:43,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:20:43,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@559849b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43, skipping insertion in model container [2024-11-16 14:20:43,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:20:43,334 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-pr-ci_file-26.i[919,932] [2024-11-16 14:20:43,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:20:43,458 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:20:43,523 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-pr-ci_file-26.i[919,932] [2024-11-16 14:20:43,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:20:43,649 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:20:43,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43 WrapperNode [2024-11-16 14:20:43,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:20:43,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:20:43,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:20:43,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:20:43,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,675 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,722 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 203 [2024-11-16 14:20:43,723 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:20:43,723 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:20:43,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:20:43,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:20:43,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,776 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-16 14:20:43,776 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,776 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,787 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,795 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:20:43,805 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:20:43,806 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:20:43,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:20:43,807 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (1/1) ... [2024-11-16 14:20:43,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:20:43,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:20:43,861 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-16 14:20:43,865 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-16 14:20:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:20:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:20:43,911 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:20:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:20:43,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:20:43,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:20:43,995 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:20:44,001 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:20:44,514 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 14:20:44,514 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:20:44,533 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:20:44,536 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:20:44,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:20:44 BoogieIcfgContainer [2024-11-16 14:20:44,537 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:20:44,539 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:20:44,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:20:44,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:20:44,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:20:43" (1/3) ... [2024-11-16 14:20:44,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e88d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:20:44, skipping insertion in model container [2024-11-16 14:20:44,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:43" (2/3) ... [2024-11-16 14:20:44,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e88d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:20:44, skipping insertion in model container [2024-11-16 14:20:44,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:20:44" (3/3) ... [2024-11-16 14:20:44,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-11-16 14:20:44,566 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:20:44,566 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:20:44,635 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:20:44,648 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;@343d67d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:20:44,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:20:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 14:20:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 14:20:44,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:20:44,678 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:20:44,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:20:44,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:20:44,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1725000070, now seen corresponding path program 1 times [2024-11-16 14:20:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:20:44,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273753492] [2024-11-16 14:20:44,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:20:44,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:20:44,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:20:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:20:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:20:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:20:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:20:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:20:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:20:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:20:45,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:20:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:20:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:20:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:20:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:20:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:20:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:20:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:20:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:20:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:20:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:20:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:20:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:20:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:20:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:20:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:20:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:20:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 14:20:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 14:20:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 14:20:45,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:45,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:20:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:20:45,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273753492] [2024-11-16 14:20:45,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273753492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:20:45,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:20:45,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:20:45,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338073985] [2024-11-16 14:20:45,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:20:45,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:20:45,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:20:45,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:20:45,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:20:45,387 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:20:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:20:45,427 INFO L93 Difference]: Finished difference Result 174 states and 309 transitions. [2024-11-16 14:20:45,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:20:45,431 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 182 [2024-11-16 14:20:45,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:20:45,441 INFO L225 Difference]: With dead ends: 174 [2024-11-16 14:20:45,442 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 14:20:45,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-16 14:20:45,451 INFO L432 NwaCegarLoop]: 134 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, 134 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-16 14:20:45,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:20:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 14:20:45,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-16 14:20:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 14:20:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2024-11-16 14:20:45,518 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 182 [2024-11-16 14:20:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:20:45,523 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2024-11-16 14:20:45,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:20:45,523 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2024-11-16 14:20:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 14:20:45,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:20:45,530 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:20:45,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:20:45,531 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:20:45,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:20:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1509970039, now seen corresponding path program 1 times [2024-11-16 14:20:45,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:20:45,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369995522] [2024-11-16 14:20:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:20:45,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:20:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:20:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:20:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:20:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:20:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:20:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:20:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:20:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:20:46,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:20:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:20:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:20:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:20:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:20:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:20:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:20:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:20:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:20:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:20:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:20:46,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:20:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:20:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:20:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:20:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:20:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:20:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 14:20:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 14:20:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 14:20:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:20:46,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:20:46,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369995522] [2024-11-16 14:20:46,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369995522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:20:46,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:20:46,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:20:46,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902161208] [2024-11-16 14:20:46,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:20:46,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:20:46,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:20:46,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:20:46,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:20:46,520 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:20:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:20:46,666 INFO L93 Difference]: Finished difference Result 252 states and 396 transitions. [2024-11-16 14:20:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:20:46,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 182 [2024-11-16 14:20:46,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:20:46,673 INFO L225 Difference]: With dead ends: 252 [2024-11-16 14:20:46,673 INFO L226 Difference]: Without dead ends: 169 [2024-11-16 14:20:46,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:20:46,678 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 92 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:20:46,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 359 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:20:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-16 14:20:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2024-11-16 14:20:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 106 states have (on average 1.3962264150943395) internal successors, (148), 106 states have internal predecessors, (148), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-16 14:20:46,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 260 transitions. [2024-11-16 14:20:46,748 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 260 transitions. Word has length 182 [2024-11-16 14:20:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:20:46,750 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 260 transitions. [2024-11-16 14:20:46,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:20:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 260 transitions. [2024-11-16 14:20:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 14:20:46,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:20:46,757 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:20:46,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:20:46,757 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:20:46,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:20:46,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2096961387, now seen corresponding path program 1 times [2024-11-16 14:20:46,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:20:46,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594487983] [2024-11-16 14:20:46,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:20:46,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:20:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:20:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:20:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:20:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:20:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:20:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:20:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:20:47,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:20:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:20:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:20:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:20:47,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:20:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:20:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:20:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:20:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:20:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:20:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:20:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:20:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:20:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:20:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:20:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:20:47,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:20:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:20:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 14:20:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 14:20:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 14:20:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:20:47,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:20:47,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594487983] [2024-11-16 14:20:47,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594487983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:20:47,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:20:47,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:20:47,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38265255] [2024-11-16 14:20:47,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:20:47,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:20:47,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:20:47,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:20:47,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:20:47,370 INFO L87 Difference]: Start difference. First operand 165 states and 260 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:20:47,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:20:47,508 INFO L93 Difference]: Finished difference Result 400 states and 626 transitions. [2024-11-16 14:20:47,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:20:47,509 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-11-16 14:20:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:20:47,515 INFO L225 Difference]: With dead ends: 400 [2024-11-16 14:20:47,516 INFO L226 Difference]: Without dead ends: 238 [2024-11-16 14:20:47,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:20:47,518 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 51 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:20:47,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 376 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:20:47,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-16 14:20:47,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 228. [2024-11-16 14:20:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 161 states have (on average 1.3975155279503106) internal successors, (225), 163 states have internal predecessors, (225), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-16 14:20:47,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 349 transitions. [2024-11-16 14:20:47,559 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 349 transitions. Word has length 183 [2024-11-16 14:20:47,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:20:47,560 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 349 transitions. [2024-11-16 14:20:47,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:20:47,561 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 349 transitions. [2024-11-16 14:20:47,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-16 14:20:47,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:20:47,568 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:20:47,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:20:47,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:20:47,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:20:47,569 INFO L85 PathProgramCache]: Analyzing trace with hash -555808006, now seen corresponding path program 1 times [2024-11-16 14:20:47,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:20:47,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070027034] [2024-11-16 14:20:47,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:20:47,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:20:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:20:47,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:20:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:20:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:20:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:20:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:20:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:20:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:20:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:20:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:20:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:20:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:20:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:20:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:20:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:20:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:20:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:20:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:20:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:20:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:20:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:20:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:20:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:20:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:47,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:20:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:20:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 14:20:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 14:20:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 14:20:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:20:48,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:20:48,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070027034] [2024-11-16 14:20:48,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070027034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:20:48,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:20:48,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 14:20:48,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27552616] [2024-11-16 14:20:48,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:20:48,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:20:48,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:20:48,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:20:48,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:20:48,037 INFO L87 Difference]: Start difference. First operand 228 states and 349 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:20:48,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:20:48,333 INFO L93 Difference]: Finished difference Result 404 states and 615 transitions. [2024-11-16 14:20:48,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 14:20:48,334 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2024-11-16 14:20:48,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:20:48,342 INFO L225 Difference]: With dead ends: 404 [2024-11-16 14:20:48,342 INFO L226 Difference]: Without dead ends: 285 [2024-11-16 14:20:48,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:20:48,347 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 163 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:20:48,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 466 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:20:48,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-16 14:20:48,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 235. [2024-11-16 14:20:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 168 states have (on average 1.3928571428571428) internal successors, (234), 170 states have internal predecessors, (234), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-16 14:20:48,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 358 transitions. [2024-11-16 14:20:48,399 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 358 transitions. Word has length 184 [2024-11-16 14:20:48,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:20:48,400 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 358 transitions. [2024-11-16 14:20:48,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:20:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 358 transitions. [2024-11-16 14:20:48,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-16 14:20:48,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:20:48,405 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:20:48,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 14:20:48,405 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:20:48,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:20:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash 797501691, now seen corresponding path program 1 times [2024-11-16 14:20:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:20:48,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025030332] [2024-11-16 14:20:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:20:48,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:20:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:20:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:20:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:20:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:20:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:20:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:20:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:20:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:20:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:20:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:20:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 14:20:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:20:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:20:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:20:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:20:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:20:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:20:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:20:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:20:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:20:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:20:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 14:20:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:20:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 14:20:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:20:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 14:20:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 14:20:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 14:20:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 14:20:48,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:20:48,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025030332] [2024-11-16 14:20:48,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025030332] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:20:48,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725760089] [2024-11-16 14:20:48,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:20:48,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:20:48,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:20:48,771 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-16 14:20:48,772 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-16 14:20:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:20:48,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 14:20:48,941 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:20:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 363 proven. 9 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2024-11-16 14:20:49,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:20:49,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 72 proven. 9 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-16 14:20:49,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725760089] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:20:49,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:20:49,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 14:20:49,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791215608] [2024-11-16 14:20:49,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:20:49,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 14:20:49,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:20:49,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 14:20:49,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:20:49,247 INFO L87 Difference]: Start difference. First operand 235 states and 358 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-16 14:20:49,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:20:49,601 INFO L93 Difference]: Finished difference Result 521 states and 789 transitions. [2024-11-16 14:20:49,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 14:20:49,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 184 [2024-11-16 14:20:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:20:49,605 INFO L225 Difference]: With dead ends: 521 [2024-11-16 14:20:49,605 INFO L226 Difference]: Without dead ends: 289 [2024-11-16 14:20:49,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 420 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 14:20:49,607 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 147 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 14:20:49,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 303 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 14:20:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-16 14:20:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 282. [2024-11-16 14:20:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 189 states have (on average 1.3333333333333333) internal successors, (252), 192 states have internal predecessors, (252), 86 states have call successors, (86), 6 states have call predecessors, (86), 6 states have return successors, (86), 83 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-16 14:20:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 424 transitions. [2024-11-16 14:20:49,662 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 424 transitions. Word has length 184 [2024-11-16 14:20:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:20:49,663 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 424 transitions. [2024-11-16 14:20:49,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-16 14:20:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 424 transitions. [2024-11-16 14:20:49,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-16 14:20:49,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:20:49,680 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:20:49,703 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-16 14:20:49,881 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-16 14:20:49,882 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:20:49,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:20:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash -61474838, now seen corresponding path program 1 times [2024-11-16 14:20:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:20:49,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512893475] [2024-11-16 14:20:49,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:20:49,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:20:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 14:20:50,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503202049] [2024-11-16 14:20:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:20:50,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:20:50,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:20:50,009 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-16 14:20:50,010 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-16 14:20:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:20:50,181 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 14:20:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:20:50,540 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 14:20:50,540 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 14:20:50,542 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 14:20:50,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 14:20:50,748 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-16 14:20:50,752 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 14:20:50,893 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 14:20:50,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:20:50 BoogieIcfgContainer [2024-11-16 14:20:50,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 14:20:50,898 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 14:20:50,898 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 14:20:50,898 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 14:20:50,899 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:20:44" (3/4) ... [2024-11-16 14:20:50,903 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 14:20:50,904 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 14:20:50,905 INFO L158 Benchmark]: Toolchain (without parser) took 7820.03ms. Allocated memory was 178.3MB in the beginning and 281.0MB in the end (delta: 102.8MB). Free memory was 109.7MB in the beginning and 160.3MB in the end (delta: -50.7MB). Peak memory consumption was 53.2MB. Max. memory is 16.1GB. [2024-11-16 14:20:50,906 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:20:50,906 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.74ms. Allocated memory is still 178.3MB. Free memory was 109.5MB in the beginning and 146.8MB in the end (delta: -37.3MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-11-16 14:20:50,906 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.92ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 142.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 14:20:50,907 INFO L158 Benchmark]: Boogie Preprocessor took 81.20ms. Allocated memory is still 178.3MB. Free memory was 142.1MB in the beginning and 136.4MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 14:20:50,907 INFO L158 Benchmark]: IcfgBuilder took 731.49ms. Allocated memory is still 178.3MB. Free memory was 136.4MB in the beginning and 109.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-16 14:20:50,907 INFO L158 Benchmark]: TraceAbstraction took 6358.49ms. Allocated memory was 178.3MB in the beginning and 281.0MB in the end (delta: 102.8MB). Free memory was 108.5MB in the beginning and 160.3MB in the end (delta: -51.8MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2024-11-16 14:20:50,907 INFO L158 Benchmark]: Witness Printer took 6.21ms. Allocated memory is still 281.0MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:20:50,910 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.74ms. Allocated memory is still 178.3MB. Free memory was 109.5MB in the beginning and 146.8MB in the end (delta: -37.3MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.92ms. Allocated memory is still 178.3MB. Free memory was 146.8MB in the beginning and 142.6MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.20ms. Allocated memory is still 178.3MB. Free memory was 142.1MB in the beginning and 136.4MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 731.49ms. Allocated memory is still 178.3MB. Free memory was 136.4MB in the beginning and 109.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6358.49ms. Allocated memory was 178.3MB in the beginning and 281.0MB in the end (delta: 102.8MB). Free memory was 108.5MB in the beginning and 160.3MB in the end (delta: -51.8MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * Witness Printer took 6.21ms. Allocated memory is still 281.0MB. Free memory is still 160.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 205. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 16; [L23] signed long int var_1_4 = -64; [L24] signed char var_1_9 = 10; [L25] unsigned char var_1_10 = 0; [L26] signed char var_1_11 = -1; [L27] unsigned short int var_1_12 = 10000; [L28] float var_1_13 = 5.4; [L29] float var_1_14 = 1.4; [L30] unsigned short int var_1_18 = 32; [L31] double var_1_20 = 1.5; [L32] double var_1_21 = 2.75; [L33] unsigned char var_1_22 = 5; [L34] unsigned short int var_1_23 = 55712; [L35] unsigned char var_1_24 = 5; [L36] signed short int var_1_25 = 10; [L37] float var_1_26 = 64.2; [L38] unsigned short int var_1_27 = 64; [L39] float var_1_33 = 2.5; [L40] unsigned long int var_1_35 = 10; [L41] unsigned long int var_1_37 = 2924974040; [L42] unsigned char var_1_38 = 1; [L43] unsigned char var_1_39 = 0; [L44] unsigned char var_1_40 = 0; [L45] unsigned char var_1_41 = 0; [L46] unsigned char var_1_44 = 0; [L47] unsigned char var_1_45 = 0; [L48] unsigned long int var_1_46 = 32; [L49] unsigned long int var_1_47 = 1000000000; [L50] unsigned long int last_1_var_1_1 = 16; [L51] signed char last_1_var_1_9 = 10; [L52] unsigned short int last_1_var_1_12 = 10000; [L53] double last_1_var_1_20 = 1.5; [L54] unsigned char last_1_var_1_22 = 5; [L55] signed short int last_1_var_1_25 = 10; VAL [isInitial=0, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=-64, var_1_9=10] [L209] isInitial = 1 [L210] FCALL initially() [L211] COND TRUE 1 [L212] CALL updateLastVariables() [L197] last_1_var_1_1 = var_1_1 [L198] last_1_var_1_9 = var_1_9 [L199] last_1_var_1_12 = var_1_12 [L200] last_1_var_1_20 = var_1_20 [L201] last_1_var_1_22 = var_1_22 [L202] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=-64, var_1_9=10] [L212] RET updateLastVariables() [L213] CALL updateVariables() [L152] var_1_4 = __VERIFIER_nondet_long() [L153] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L153] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L154] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L154] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L155] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L155] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=0, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L156] var_1_10 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L157] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L158] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L158] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=-1, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L159] var_1_11 = __VERIFIER_nondet_char() [L160] CALL assume_abort_if_not(var_1_11 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L160] RET assume_abort_if_not(var_1_11 >= -63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L161] CALL assume_abort_if_not(var_1_11 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L161] RET assume_abort_if_not(var_1_11 <= 63) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_13=27/5, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L162] var_1_13 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L163] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_14=7/5, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L164] var_1_14 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L165] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=32, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L166] var_1_18 = __VERIFIER_nondet_ushort() [L167] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L167] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L168] CALL assume_abort_if_not(var_1_18 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L168] RET assume_abort_if_not(var_1_18 <= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=11/4, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L169] var_1_21 = __VERIFIER_nondet_double() [L170] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L170] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=55712, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L171] var_1_23 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_23 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L172] RET assume_abort_if_not(var_1_23 >= 32767) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L173] CALL assume_abort_if_not(var_1_23 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L173] RET assume_abort_if_not(var_1_23 <= 65535) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=5, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L174] var_1_24 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L175] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L176] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L176] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_26=321/5, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L177] var_1_26 = __VERIFIER_nondet_float() [L178] CALL assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L178] RET assume_abort_if_not((var_1_26 >= -922337.2036854776000e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854776000e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L179] CALL assume_abort_if_not(var_1_26 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L179] RET assume_abort_if_not(var_1_26 != 0.0F) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2924974040, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L180] var_1_37 = __VERIFIER_nondet_ulong() [L181] CALL assume_abort_if_not(var_1_37 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L181] RET assume_abort_if_not(var_1_37 >= 2147483647) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L182] CALL assume_abort_if_not(var_1_37 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L182] RET assume_abort_if_not(var_1_37 <= 4294967294) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L183] var_1_39 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_39 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L184] RET assume_abort_if_not(var_1_39 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L185] CALL assume_abort_if_not(var_1_39 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L185] RET assume_abort_if_not(var_1_39 <= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=0, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L186] var_1_40 = __VERIFIER_nondet_uchar() [L187] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L187] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L188] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L188] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=0, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L189] var_1_44 = __VERIFIER_nondet_uchar() [L190] CALL assume_abort_if_not(var_1_44 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L190] RET assume_abort_if_not(var_1_44 >= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L191] CALL assume_abort_if_not(var_1_44 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L191] RET assume_abort_if_not(var_1_44 <= 1) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L192] var_1_45 = __VERIFIER_nondet_uchar() [L193] CALL assume_abort_if_not(var_1_45 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L193] RET assume_abort_if_not(var_1_45 >= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L194] CALL assume_abort_if_not(var_1_45 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L194] RET assume_abort_if_not(var_1_45 <= 0) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=10] [L213] RET updateVariables() [L214] CALL step() [L59] COND FALSE !(! var_1_10) [L66] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=6] [L68] COND TRUE var_1_11 < (var_1_12 - ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=64, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=6] [L69] COND TRUE \read(var_1_10) [L70] var_1_27 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=1, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=6] [L73] COND TRUE var_1_13 >= (- 255.45f) [L74] var_1_38 = ((! var_1_39) && var_1_40) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=1, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=6] [L80] unsigned char stepLocal_2 = var_1_10; [L81] signed long int stepLocal_1 = last_1_var_1_22; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, stepLocal_2=1, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=1, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=6] [L82] COND TRUE ((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || stepLocal_2 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_1=5, var_1_10=1, var_1_11=6, var_1_12=10000, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=1, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=6] [L83] COND FALSE !(stepLocal_1 >= last_1_var_1_12) [L86] var_1_12 = last_1_var_1_22 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=1, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=6] [L89] COND TRUE \read(var_1_44) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=1, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1000000000, var_1_4=4, var_1_9=6] [L90] COND FALSE !(\read(var_1_45)) [L95] var_1_47 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=1, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1, var_1_4=4, var_1_9=6] [L98] unsigned long int stepLocal_5 = last_1_var_1_1; [L99] signed long int stepLocal_4 = var_1_4 + last_1_var_1_9; [L100] unsigned short int stepLocal_3 = var_1_18; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, stepLocal_5=16, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=5, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=1, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1, var_1_4=4, var_1_9=6] [L101] COND FALSE !(stepLocal_5 > last_1_var_1_12) [L112] var_1_22 = var_1_24 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=-255, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=1, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1, var_1_4=4, var_1_9=6] [L114] COND FALSE !(var_1_11 > (var_1_22 * (var_1_12 + var_1_22))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_22=-255, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=1, var_1_33=5/2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1, var_1_4=4, var_1_9=6] [L117] COND FALSE !(var_1_12 < var_1_12) [L120] var_1_33 = var_1_21 VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=-255, var_1_23=-32768, var_1_24=-255, var_1_25=10, var_1_27=1, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1, var_1_4=4, var_1_9=6] [L122] COND TRUE (var_1_20 / var_1_26) > var_1_13 [L123] var_1_25 = ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=-255, var_1_23=-32768, var_1_24=-255, var_1_25=2, var_1_27=1, var_1_33=2, var_1_35=10, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1, var_1_4=4, var_1_9=6] [L127] COND TRUE \read(var_1_10) [L128] var_1_35 = ((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=-255, var_1_23=-32768, var_1_24=-255, var_1_25=2, var_1_27=1, var_1_33=2, var_1_35=32768, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1, var_1_4=4, var_1_9=6] [L136] signed long int stepLocal_0 = (var_1_25 + var_1_9) / var_1_4; VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_0=2, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=16, var_1_20=3/2, var_1_21=2, var_1_22=-255, var_1_23=-32768, var_1_24=-255, var_1_25=2, var_1_27=1, var_1_33=2, var_1_35=32768, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1, var_1_4=4, var_1_9=6] [L137] COND TRUE stepLocal_0 == var_1_25 [L138] var_1_1 = (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=3/2, var_1_21=2, var_1_22=-255, var_1_23=-32768, var_1_24=-255, var_1_25=2, var_1_27=1, var_1_33=2, var_1_35=32768, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1, var_1_4=4, var_1_9=6] [L140] COND TRUE ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < (var_1_9 % var_1_4) [L141] var_1_41 = ((! (var_1_40 && var_1_44)) || (var_1_39 && var_1_45)) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=3/2, var_1_21=2, var_1_22=-255, var_1_23=-32768, var_1_24=-255, var_1_25=2, var_1_27=1, var_1_33=2, var_1_35=32768, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=32, var_1_47=1, var_1_4=4, var_1_9=6] [L145] COND TRUE \read(var_1_10) [L146] var_1_46 = (var_1_24 + ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, stepLocal_3=0, stepLocal_4=14, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=3/2, var_1_21=2, var_1_22=-255, var_1_23=-32768, var_1_24=-255, var_1_25=2, var_1_27=1, var_1_33=2, var_1_35=32768, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=2, var_1_47=1, var_1_4=4, var_1_9=6] [L214] RET step() [L215] CALL, EXPR property() [L205-L206] return ((((((((var_1_25 + var_1_9) / var_1_4) == var_1_25) ? (var_1_1 == ((unsigned long int) (((((var_1_12) < (var_1_22)) ? (var_1_12) : (var_1_22))) + var_1_22))) : 1) && ((! var_1_10) ? ((((((last_1_var_1_22) > (last_1_var_1_25)) ? (last_1_var_1_22) : (last_1_var_1_25))) >= last_1_var_1_12) ? (var_1_9 == ((signed char) (-16 + var_1_11))) : (var_1_9 == ((signed char) var_1_11))) : (var_1_9 == ((signed char) var_1_11)))) && ((((var_1_13 - var_1_14) != ((((last_1_var_1_20) < (last_1_var_1_20)) ? (last_1_var_1_20) : (last_1_var_1_20)))) || var_1_10) ? ((last_1_var_1_22 >= last_1_var_1_12) ? (var_1_12 == ((unsigned short int) (((((last_1_var_1_22) < (last_1_var_1_22)) ? (last_1_var_1_22) : (last_1_var_1_22))) + 32))) : (var_1_12 == ((unsigned short int) last_1_var_1_22))) : 1)) && ((var_1_11 > (var_1_22 * (var_1_12 + var_1_22))) ? (var_1_20 == ((double) var_1_21)) : 1)) && ((last_1_var_1_1 > last_1_var_1_12) ? ((last_1_var_1_1 >= (var_1_4 + last_1_var_1_9)) ? ((var_1_18 == (var_1_23 - 8)) ? (var_1_22 == ((unsigned char) var_1_24)) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24))) : (var_1_22 == ((unsigned char) var_1_24)))) && (((var_1_20 / var_1_26) > var_1_13) ? (var_1_25 == ((signed short int) ((((((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) > (2)) ? (((((var_1_9) < (var_1_24)) ? (var_1_9) : (var_1_24)))) : (2))))) : (var_1_25 == ((signed short int) var_1_11))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=3/2, var_1_21=2, var_1_22=-255, var_1_23=-32768, var_1_24=-255, var_1_25=2, var_1_27=1, var_1_33=2, var_1_35=32768, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=2, var_1_47=1, var_1_4=4, var_1_9=6] [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=3/2, var_1_21=2, var_1_22=-255, var_1_23=-32768, var_1_24=-255, var_1_25=2, var_1_27=1, var_1_33=2, var_1_35=32768, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=2, var_1_47=1, var_1_4=4, var_1_9=6] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=10000, last_1_var_1_1=16, last_1_var_1_20=3/2, last_1_var_1_22=5, last_1_var_1_25=10, last_1_var_1_9=10, var_1_10=1, var_1_11=6, var_1_12=5, var_1_18=0, var_1_1=2, var_1_20=3/2, var_1_21=2, var_1_22=-255, var_1_23=-32768, var_1_24=-255, var_1_25=2, var_1_27=1, var_1_33=2, var_1_35=32768, var_1_37=2147483647, var_1_38=1, var_1_39=0, var_1_40=-255, var_1_41=0, var_1_44=1, var_1_45=0, var_1_46=2, var_1_47=1, var_1_4=4, var_1_9=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 91 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 6, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 477 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 453 mSDsluCounter, 1638 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 948 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 690 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 702 GetRequests, 683 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=5, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 5 MinimizatonAttempts, 71 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 1469 NumberOfCodeBlocks, 1469 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1276 ConstructedInterpolants, 0 QuantifiedInterpolants, 2643 SizeOfPredicates, 0 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 10557/10584 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-16 14:20:50,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.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 9a0c37ebc273c362e4d2cb519b4c223d2a9b2256e1ef158a08ce7f4ca051bc4d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:20:53,427 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:20:53,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 14:20:53,510 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:20:53,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:20:53,546 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:20:53,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:20:53,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:20:53,549 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:20:53,550 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:20:53,551 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:20:53,551 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:20:53,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:20:53,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:20:53,553 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:20:53,554 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:20:53,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:20:53,556 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:20:53,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:20:53,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:20:53,557 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:20:53,557 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:20:53,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:20:53,558 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 14:20:53,558 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 14:20:53,558 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:20:53,558 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 14:20:53,559 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:20:53,559 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:20:53,559 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:20:53,560 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:20:53,560 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:20:53,560 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:20:53,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:20:53,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:20:53,561 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:20:53,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:20:53,562 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:20:53,562 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 14:20:53,563 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 14:20:53,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:20:53,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:20:53,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:20:53,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:20:53,564 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 -> 9a0c37ebc273c362e4d2cb519b4c223d2a9b2256e1ef158a08ce7f4ca051bc4d [2024-11-16 14:20:53,965 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:20:53,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:20:54,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:20:54,002 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:20:54,002 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:20:54,004 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-pr-ci_file-26.i [2024-11-16 14:20:55,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:20:55,907 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:20:55,912 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-11-16 14:20:55,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6218a57/772eed30ad1b40448dae9d9ebb76b054/FLAG897dee1cf [2024-11-16 14:20:56,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d6218a57/772eed30ad1b40448dae9d9ebb76b054 [2024-11-16 14:20:56,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:20:56,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:20:56,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:20:56,255 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:20:56,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:20:56,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b056470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56, skipping insertion in model container [2024-11-16 14:20:56,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:20:56,505 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-pr-ci_file-26.i[919,932] [2024-11-16 14:20:56,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:20:56,597 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:20:56,611 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-pr-ci_file-26.i[919,932] [2024-11-16 14:20:56,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:20:56,674 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:20:56,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56 WrapperNode [2024-11-16 14:20:56,675 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:20:56,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:20:56,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:20:56,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:20:56,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,707 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,754 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-11-16 14:20:56,754 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:20:56,755 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:20:56,755 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:20:56,756 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:20:56,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,782 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,805 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-16 14:20:56,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,806 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,830 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,837 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:20:56,849 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:20:56,849 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:20:56,849 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:20:56,850 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (1/1) ... [2024-11-16 14:20:56,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:20:56,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:20:56,888 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-16 14:20:56,897 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-16 14:20:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:20:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 14:20:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:20:56,948 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:20:56,948 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:20:56,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:20:57,051 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:20:57,055 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:21:11,545 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 14:21:11,547 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:21:11,566 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:21:11,566 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:21:11,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:21:11 BoogieIcfgContainer [2024-11-16 14:21:11,567 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:21:11,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:21:11,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:21:11,572 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:21:11,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:20:56" (1/3) ... [2024-11-16 14:21:11,573 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d584b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:21:11, skipping insertion in model container [2024-11-16 14:21:11,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:20:56" (2/3) ... [2024-11-16 14:21:11,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d584b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:21:11, skipping insertion in model container [2024-11-16 14:21:11,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:21:11" (3/3) ... [2024-11-16 14:21:11,575 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-26.i [2024-11-16 14:21:11,593 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:21:11,593 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:21:11,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:21:11,678 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;@771bbfcc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:21:11,679 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:21:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 14:21:11,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 14:21:11,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:21:11,697 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:21:11,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:21:11,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:21:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1725000070, now seen corresponding path program 1 times [2024-11-16 14:21:11,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:21:11,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105766640] [2024-11-16 14:21:11,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:21:11,721 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-16 14:21:11,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:21:11,726 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-16 14:21:11,728 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-16 14:21:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:21:12,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 14:21:12,790 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:21:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-16 14:21:12,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:21:12,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:21:12,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105766640] [2024-11-16 14:21:12,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105766640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:21:12,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:21:12,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:21:12,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726164587] [2024-11-16 14:21:12,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:21:12,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:21:12,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:21:12,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:21:12,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:21:12,907 INFO L87 Difference]: Start difference. First operand has 91 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 61 states have internal predecessors, (88), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:21:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:21:12,949 INFO L93 Difference]: Finished difference Result 174 states and 309 transitions. [2024-11-16 14:21:12,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:21:12,955 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 182 [2024-11-16 14:21:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:21:12,966 INFO L225 Difference]: With dead ends: 174 [2024-11-16 14:21:12,967 INFO L226 Difference]: Without dead ends: 86 [2024-11-16 14:21:12,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 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-16 14:21:12,977 INFO L432 NwaCegarLoop]: 134 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, 134 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-16 14:21:12,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:21:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-16 14:21:13,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-16 14:21:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 56 states have internal predecessors, (78), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-16 14:21:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 134 transitions. [2024-11-16 14:21:13,043 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 134 transitions. Word has length 182 [2024-11-16 14:21:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:21:13,045 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 134 transitions. [2024-11-16 14:21:13,045 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-16 14:21:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 134 transitions. [2024-11-16 14:21:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 14:21:13,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:21:13,049 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:21:13,089 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-16 14:21:13,250 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-16 14:21:13,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:21:13,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:21:13,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1509970039, now seen corresponding path program 1 times [2024-11-16 14:21:13,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:21:13,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1197546210] [2024-11-16 14:21:13,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:21:13,253 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-16 14:21:13,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:21:13,255 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-16 14:21:13,256 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-16 14:21:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:21:14,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 14:21:14,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:21:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 403 proven. 69 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-11-16 14:21:18,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:21:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:21:20,347 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:21:20,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1197546210] [2024-11-16 14:21:20,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1197546210] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-16 14:21:20,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 14:21:20,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 8 [2024-11-16 14:21:20,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270896217] [2024-11-16 14:21:20,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:21:20,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:21:20,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:21:20,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:21:20,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 14:21:20,355 INFO L87 Difference]: Start difference. First operand 86 states and 134 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:21:25,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:21:29,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:21:33,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:21:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:21:33,405 INFO L93 Difference]: Finished difference Result 208 states and 324 transitions. [2024-11-16 14:21:33,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:21:33,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2024-11-16 14:21:33,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:21:33,500 INFO L225 Difference]: With dead ends: 208 [2024-11-16 14:21:33,500 INFO L226 Difference]: Without dead ends: 125 [2024-11-16 14:21:33,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 14:21:33,502 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 95 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:21:33,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 256 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 13.0s Time] [2024-11-16 14:21:33,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-16 14:21:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2024-11-16 14:21:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-16 14:21:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 185 transitions. [2024-11-16 14:21:33,527 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 185 transitions. Word has length 182 [2024-11-16 14:21:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:21:33,528 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 185 transitions. [2024-11-16 14:21:33,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:21:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 185 transitions. [2024-11-16 14:21:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-16 14:21:33,535 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:21:33,535 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 14:21:33,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 14:21:33,736 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-16 14:21:33,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:21:33,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:21:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1572670610, now seen corresponding path program 1 times [2024-11-16 14:21:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:21:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294144788] [2024-11-16 14:21:33,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:21:33,738 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-16 14:21:33,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:21:33,740 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-16 14:21:33,742 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-16 14:21:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:21:34,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 14:21:34,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:21:39,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-16 14:21:39,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:21:39,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:21:39,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294144788] [2024-11-16 14:21:39,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294144788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:21:39,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:21:39,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:21:39,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323514236] [2024-11-16 14:21:39,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:21:39,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:21:39,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:21:39,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:21:39,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:21:39,036 INFO L87 Difference]: Start difference. First operand 121 states and 185 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-16 14:21:45,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:21:49,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 14:21:53,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 14:21:57,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 14:22:01,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 14:22:06,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []