./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.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 ea47bb0050149eccadb69630e06c0319f913c75b08e9058f28d8d379ef84ce69 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:58:03,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:58:03,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:58:03,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:58:03,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:58:03,544 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:58:03,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:58:03,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:58:03,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:58:03,547 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:58:03,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:58:03,549 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:58:03,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:58:03,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:58:03,550 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:58:03,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:58:03,554 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:58:03,554 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:58:03,555 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:58:03,555 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:58:03,555 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:58:03,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:58:03,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:58:03,556 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:58:03,556 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:58:03,556 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:58:03,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:58:03,557 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:58:03,557 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:58:03,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:58:03,557 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:58:03,557 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:58:03,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:58:03,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:58:03,558 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:58:03,558 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:58:03,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:58:03,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:58:03,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:58:03,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:58:03,561 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:58:03,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:58:03,561 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 -> ea47bb0050149eccadb69630e06c0319f913c75b08e9058f28d8d379ef84ce69 [2024-11-12 01:58:03,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:58:03,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:58:03,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:58:03,823 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:58:03,823 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:58:03,824 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i [2024-11-12 01:58:05,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:58:05,502 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:58:05,503 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i [2024-11-12 01:58:05,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e7502177/8003968db2ba4847b05206e5d57f660e/FLAG8bf5c5a46 [2024-11-12 01:58:05,530 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e7502177/8003968db2ba4847b05206e5d57f660e [2024-11-12 01:58:05,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:58:05,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:58:05,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:58:05,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:58:05,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:58:05,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:05,545 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15289958 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05, skipping insertion in model container [2024-11-12 01:58:05,545 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:05,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:58:05,794 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i[915,928] [2024-11-12 01:58:05,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:58:05,892 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:58:05,907 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i[915,928] [2024-11-12 01:58:05,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:58:05,953 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:58:05,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05 WrapperNode [2024-11-12 01:58:05,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:58:05,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:58:05,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:58:05,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:58:05,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:05,973 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:06,006 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 195 [2024-11-12 01:58:06,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:58:06,007 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:58:06,007 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:58:06,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:58:06,020 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:06,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:06,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:06,043 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-12 01:58:06,043 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:06,044 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:06,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:06,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:06,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:06,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:06,059 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:58:06,060 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:58:06,060 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:58:06,060 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:58:06,061 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (1/1) ... [2024-11-12 01:58:06,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:58:06,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:58:06,100 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-12 01:58:06,103 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-12 01:58:06,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:58:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:58:06,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:58:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:58:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:58:06,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:58:06,236 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:58:06,238 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:58:06,549 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-12 01:58:06,549 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:58:06,561 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:58:06,561 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:58:06,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:58:06 BoogieIcfgContainer [2024-11-12 01:58:06,561 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:58:06,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:58:06,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:58:06,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:58:06,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:58:05" (1/3) ... [2024-11-12 01:58:06,568 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a212291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:58:06, skipping insertion in model container [2024-11-12 01:58:06,568 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:05" (2/3) ... [2024-11-12 01:58:06,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a212291 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:58:06, skipping insertion in model container [2024-11-12 01:58:06,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:58:06" (3/3) ... [2024-11-12 01:58:06,570 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-38.i [2024-11-12 01:58:06,584 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:58:06,585 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:58:06,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:58:06,642 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;@1ea7db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:58:06,642 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:58:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 52 states have internal predecessors, (70), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 01:58:06,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-12 01:58:06,659 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:58:06,660 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:58:06,660 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:58:06,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:58:06,666 INFO L85 PathProgramCache]: Analyzing trace with hash -198340891, now seen corresponding path program 1 times [2024-11-12 01:58:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:58:06,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738475229] [2024-11-12 01:58:06,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:58:06,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:58:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:58:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:58:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:58:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:58:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:58:07,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:58:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:58:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:58:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:58:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:58:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:58:07,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:58:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:58:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:58:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:58:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 01:58:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 01:58:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:58:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:58:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:58:07,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 01:58:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:58:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 01:58:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:58:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 01:58:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:58:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:58:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-12 01:58:07,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:58:07,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738475229] [2024-11-12 01:58:07,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738475229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:58:07,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:58:07,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:58:07,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666680936] [2024-11-12 01:58:07,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:58:07,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:58:07,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:58:07,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:58:07,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:58:07,262 INFO L87 Difference]: Start difference. First operand has 81 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 52 states have internal predecessors, (70), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-12 01:58:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:58:07,302 INFO L93 Difference]: Finished difference Result 155 states and 269 transitions. [2024-11-12 01:58:07,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:58:07,304 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 171 [2024-11-12 01:58:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:58:07,313 INFO L225 Difference]: With dead ends: 155 [2024-11-12 01:58:07,314 INFO L226 Difference]: Without dead ends: 77 [2024-11-12 01:58:07,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-12 01:58:07,323 INFO L435 NwaCegarLoop]: 117 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, 117 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-12 01:58:07,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:58:07,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-12 01:58:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-12 01:58:07,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 01:58:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-12 01:58:07,369 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 171 [2024-11-12 01:58:07,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:58:07,373 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-12 01:58:07,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-12 01:58:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2024-11-12 01:58:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-12 01:58:07,378 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:58:07,379 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:58:07,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:58:07,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:58:07,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:58:07,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1535051473, now seen corresponding path program 1 times [2024-11-12 01:58:07,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:58:07,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418123459] [2024-11-12 01:58:07,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:58:07,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:58:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:58:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:58:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:58:08,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:58:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:58:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:58:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:58:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:58:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:58:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:58:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:58:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:58:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:58:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:58:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:58:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 01:58:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 01:58:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:58:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:58:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:58:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 01:58:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:58:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 01:58:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:58:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 01:58:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:58:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:58:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-12 01:58:08,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:58:08,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418123459] [2024-11-12 01:58:08,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418123459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:58:08,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:58:08,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:58:08,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005206241] [2024-11-12 01:58:08,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:58:08,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:58:08,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:58:08,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:58:08,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:58:08,160 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 01:58:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:58:08,466 INFO L93 Difference]: Finished difference Result 294 states and 450 transitions. [2024-11-12 01:58:08,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:58:08,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 171 [2024-11-12 01:58:08,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:58:08,474 INFO L225 Difference]: With dead ends: 294 [2024-11-12 01:58:08,477 INFO L226 Difference]: Without dead ends: 220 [2024-11-12 01:58:08,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 01:58:08,479 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 236 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:58:08,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 459 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:58:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-12 01:58:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 149. [2024-11-12 01:58:08,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 92 states have (on average 1.315217391304348) internal successors, (121), 92 states have internal predecessors, (121), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 01:58:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 229 transitions. [2024-11-12 01:58:08,536 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 229 transitions. Word has length 171 [2024-11-12 01:58:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:58:08,537 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 229 transitions. [2024-11-12 01:58:08,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 01:58:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 229 transitions. [2024-11-12 01:58:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-12 01:58:08,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:58:08,543 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:58:08,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:58:08,543 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:58:08,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:58:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1509186116, now seen corresponding path program 1 times [2024-11-12 01:58:08,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:58:08,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256706990] [2024-11-12 01:58:08,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:58:08,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:58:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:58:08,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:58:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:58:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:58:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:58:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:58:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:58:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:58:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:58:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:58:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:58:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:58:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:58:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:58:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:58:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 01:58:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 01:58:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:58:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:58:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:58:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 01:58:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:58:08,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 01:58:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:58:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:08,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 01:58:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:58:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:58:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-12 01:58:09,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:58:09,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256706990] [2024-11-12 01:58:09,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256706990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:58:09,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:58:09,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 01:58:09,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722220974] [2024-11-12 01:58:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:58:09,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:58:09,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:58:09,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:58:09,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:58:09,022 INFO L87 Difference]: Start difference. First operand 149 states and 229 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 01:58:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:58:09,317 INFO L93 Difference]: Finished difference Result 479 states and 739 transitions. [2024-11-12 01:58:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 01:58:09,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 172 [2024-11-12 01:58:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:58:09,321 INFO L225 Difference]: With dead ends: 479 [2024-11-12 01:58:09,321 INFO L226 Difference]: Without dead ends: 333 [2024-11-12 01:58:09,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 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-12 01:58:09,324 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 103 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 01:58:09,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 398 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 01:58:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-12 01:58:09,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 295. [2024-11-12 01:58:09,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 182 states have (on average 1.3186813186813187) internal successors, (240), 182 states have internal predecessors, (240), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-12 01:58:09,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 456 transitions. [2024-11-12 01:58:09,384 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 456 transitions. Word has length 172 [2024-11-12 01:58:09,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:58:09,384 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 456 transitions. [2024-11-12 01:58:09,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 01:58:09,385 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 456 transitions. [2024-11-12 01:58:09,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-12 01:58:09,387 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:58:09,387 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:58:09,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:58:09,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:58:09,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:58:09,391 INFO L85 PathProgramCache]: Analyzing trace with hash 498068866, now seen corresponding path program 1 times [2024-11-12 01:58:09,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:58:09,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950815496] [2024-11-12 01:58:09,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:58:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:58:09,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:58:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:58:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:58:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 01:58:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:58:09,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 01:58:09,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 01:58:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 01:58:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 01:58:09,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 01:58:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 01:58:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 01:58:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 01:58:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 01:58:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 01:58:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 01:58:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 01:58:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 01:58:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 01:58:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 01:58:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 01:58:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 01:58:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 01:58:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-12 01:58:09,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 01:58:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-12 01:58:09,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-12 01:58:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:09,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-12 01:58:09,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:58:09,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950815496] [2024-11-12 01:58:09,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950815496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 01:58:09,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863220520] [2024-11-12 01:58:09,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:58:09,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:58:09,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:58:09,928 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-12 01:58:09,929 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-12 01:58:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:10,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 01:58:10,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:58:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 722 proven. 42 refuted. 0 times theorem prover too weak. 640 trivial. 0 not checked. [2024-11-12 01:58:10,647 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 01:58:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-12 01:58:11,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863220520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 01:58:11,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 01:58:11,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 17 [2024-11-12 01:58:11,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111599087] [2024-11-12 01:58:11,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 01:58:11,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 01:58:11,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:58:11,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 01:58:11,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-12 01:58:11,039 INFO L87 Difference]: Start difference. First operand 295 states and 456 transitions. Second operand has 17 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 7 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 7 states have call predecessors, (81), 7 states have call successors, (81) [2024-11-12 01:58:11,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:58:11,932 INFO L93 Difference]: Finished difference Result 721 states and 1102 transitions. [2024-11-12 01:58:11,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 01:58:11,935 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 7 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 7 states have call predecessors, (81), 7 states have call successors, (81) Word has length 172 [2024-11-12 01:58:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:58:11,939 INFO L225 Difference]: With dead ends: 721 [2024-11-12 01:58:11,940 INFO L226 Difference]: Without dead ends: 429 [2024-11-12 01:58:11,941 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=226, Invalid=530, Unknown=0, NotChecked=0, Total=756 [2024-11-12 01:58:11,942 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 428 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 01:58:11,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 628 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 01:58:11,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-12 01:58:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 329. [2024-11-12 01:58:12,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 214 states have (on average 1.3504672897196262) internal successors, (289), 214 states have internal predecessors, (289), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-12 01:58:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 505 transitions. [2024-11-12 01:58:12,031 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 505 transitions. Word has length 172 [2024-11-12 01:58:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:58:12,032 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 505 transitions. [2024-11-12 01:58:12,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 6.125) internal successors, (98), 17 states have internal predecessors, (98), 7 states have call successors, (81), 3 states have call predecessors, (81), 6 states have return successors, (81), 7 states have call predecessors, (81), 7 states have call successors, (81) [2024-11-12 01:58:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 505 transitions. [2024-11-12 01:58:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-12 01:58:12,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:58:12,035 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:58:12,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:58:12,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:58:12,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:58:12,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:58:12,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1321490229, now seen corresponding path program 1 times [2024-11-12 01:58:12,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:58:12,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997371069] [2024-11-12 01:58:12,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:58:12,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:58:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:58:12,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [945596768] [2024-11-12 01:58:12,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:58:12,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:58:12,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:58:12,301 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-12 01:58:12,303 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-12 01:58:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:58:12,434 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:58:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:58:12,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:58:12,633 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:58:12,634 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:58:12,655 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-12 01:58:12,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:58:12,840 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-12 01:58:12,962 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:58:12,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:58:12 BoogieIcfgContainer [2024-11-12 01:58:12,965 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:58:12,966 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:58:12,966 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:58:12,966 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:58:12,966 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:58:06" (3/4) ... [2024-11-12 01:58:12,969 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:58:12,970 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:58:12,971 INFO L158 Benchmark]: Toolchain (without parser) took 7435.66ms. Allocated memory was 157.3MB in the beginning and 253.8MB in the end (delta: 96.5MB). Free memory was 91.3MB in the beginning and 136.4MB in the end (delta: -45.1MB). Peak memory consumption was 52.2MB. Max. memory is 16.1GB. [2024-11-12 01:58:12,971 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:58:12,971 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.26ms. Allocated memory is still 157.3MB. Free memory was 91.3MB in the beginning and 122.9MB in the end (delta: -31.7MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-11-12 01:58:12,971 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.80ms. Allocated memory is still 157.3MB. Free memory was 122.4MB in the beginning and 119.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:58:12,972 INFO L158 Benchmark]: Boogie Preprocessor took 51.51ms. Allocated memory is still 157.3MB. Free memory was 119.9MB in the beginning and 116.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:58:12,972 INFO L158 Benchmark]: RCFGBuilder took 501.87ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 95.1MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 01:58:12,972 INFO L158 Benchmark]: TraceAbstraction took 6401.56ms. Allocated memory was 157.3MB in the beginning and 253.8MB in the end (delta: 96.5MB). Free memory was 94.7MB in the beginning and 136.4MB in the end (delta: -41.7MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2024-11-12 01:58:12,973 INFO L158 Benchmark]: Witness Printer took 4.41ms. Allocated memory is still 253.8MB. Free memory is still 136.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:58:12,974 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 96.5MB. Free memory is still 51.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.26ms. Allocated memory is still 157.3MB. Free memory was 91.3MB in the beginning and 122.9MB in the end (delta: -31.7MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.80ms. Allocated memory is still 157.3MB. Free memory was 122.4MB in the beginning and 119.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.51ms. Allocated memory is still 157.3MB. Free memory was 119.9MB in the beginning and 116.7MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 501.87ms. Allocated memory is still 157.3MB. Free memory was 116.7MB in the beginning and 95.1MB in the end (delta: 21.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6401.56ms. Allocated memory was 157.3MB in the beginning and 253.8MB in the end (delta: 96.5MB). Free memory was 94.7MB in the beginning and 136.4MB in the end (delta: -41.7MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. * Witness Printer took 4.41ms. Allocated memory is still 253.8MB. Free memory is still 136.4MB. 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 146, overapproximation of shiftRight at line 63, overapproximation of someUnaryDOUBLEoperation at line 45, overapproximation of someBinaryDOUBLEComparisonOperation at line 154. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_6 = 0; [L25] unsigned char var_1_7 = 0; [L26] unsigned short int var_1_8 = 4; [L27] signed long int var_1_11 = 100; [L28] signed long int var_1_12 = 8; [L29] unsigned short int var_1_13 = 128; [L30] double var_1_14 = 64.5; [L31] signed short int var_1_15 = 4; [L32] signed long int var_1_16 = -8; [L33] double var_1_17 = 255.5; [L34] double var_1_18 = 0.6; [L35] double var_1_19 = 1000000000000.5; [L36] double var_1_20 = 999999.25; [L37] signed short int var_1_21 = -64; [L38] signed char var_1_25 = -128; [L39] signed char var_1_26 = -8; [L40] unsigned char var_1_27 = 32; [L41] unsigned char var_1_28 = 64; [L42] unsigned char var_1_29 = 0; [L43] signed long int var_1_30 = 256; [L44] unsigned short int var_1_31 = 10; [L45] float var_1_32 = -0.4; [L46] float var_1_33 = 255.8; [L47] double var_1_34 = 9.875; [L48] signed short int var_1_35 = 2; [L49] unsigned short int last_1_var_1_8 = 4; [L50] signed short int last_1_var_1_21 = -64; [L51] signed char last_1_var_1_25 = -128; VAL [isInitial=0, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L158] isInitial = 1 [L159] FCALL initially() [L160] COND TRUE 1 [L161] CALL updateLastVariables() [L149] last_1_var_1_8 = var_1_8 [L150] last_1_var_1_21 = var_1_21 [L151] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=4] [L161] RET updateLastVariables() [L162] CALL updateVariables() [L105] var_1_4 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L106] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L107] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L107] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=0, var_1_7=0, var_1_8=4] [L108] var_1_6 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_7=0, var_1_8=4] [L109] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_7=0, var_1_8=4] [L110] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L110] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=100, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L111] var_1_11 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_11 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L112] RET assume_abort_if_not(var_1_11 >= -1) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L113] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L113] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=8, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L114] var_1_12 = __VERIFIER_nondet_long() [L115] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L115] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L116] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L116] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=128, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L117] var_1_13 = __VERIFIER_nondet_ushort() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L119] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L119] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=4, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L120] var_1_15 = __VERIFIER_nondet_short() [L121] CALL assume_abort_if_not(var_1_15 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L121] RET assume_abort_if_not(var_1_15 >= -32768) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L122] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L122] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L123] CALL assume_abort_if_not(var_1_15 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L123] RET assume_abort_if_not(var_1_15 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=-8, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L124] var_1_16 = __VERIFIER_nondet_long() [L125] CALL assume_abort_if_not(var_1_16 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L125] RET assume_abort_if_not(var_1_16 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L126] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L126] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L127] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L127] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_17=511/2, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L128] var_1_17 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L129] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_18=3/5, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L130] var_1_18 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L131] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_19=2000000000001/2, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L132] var_1_19 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L133] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_20=3999997/4, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L134] var_1_20 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L135] RET assume_abort_if_not((var_1_20 >= 0.0F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-8, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L136] var_1_26 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L137] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L138] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L138] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=64, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L139] var_1_28 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L140] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L141] CALL assume_abort_if_not(var_1_28 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L141] RET assume_abort_if_not(var_1_28 <= 254) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=256, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L142] var_1_30 = __VERIFIER_nondet_long() [L143] CALL assume_abort_if_not(var_1_30 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L143] RET assume_abort_if_not(var_1_30 >= -2147483648) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L144] CALL assume_abort_if_not(var_1_30 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L144] RET assume_abort_if_not(var_1_30 <= 2147483647) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_33=1279/5, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L145] var_1_33 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L146] RET assume_abort_if_not((var_1_33 >= -922337.2036854765600e+13F && var_1_33 <= -1.0e-20F) || (var_1_33 <= 9223372.036854765600e+12F && var_1_33 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=32, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L162] RET updateVariables() [L163] CALL step() [L55] var_1_27 = var_1_28 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L56] COND TRUE (var_1_27 + var_1_28) < ((((var_1_30) < (128)) ? (var_1_30) : (128))) [L57] var_1_29 = var_1_28 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=10, var_1_34=79/8, var_1_35=2, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L59] var_1_31 = var_1_28 [L60] var_1_32 = var_1_33 [L61] var_1_34 = var_1_33 [L62] var_1_35 = var_1_27 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L63] EXPR last_1_var_1_8 >> var_1_15 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-64, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L63] COND TRUE (last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15) [L64] var_1_21 = (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L68] signed long int stepLocal_1 = ((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12; [L69] signed long int stepLocal_0 = last_1_var_1_21 + last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, stepLocal_1=0, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=4] [L70] COND FALSE !((last_1_var_1_21 * last_1_var_1_21) < stepLocal_1) [L75] var_1_8 = var_1_13 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L77] COND TRUE ! (var_1_21 > var_1_8) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-128, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L78] COND TRUE \read(var_1_4) [L79] var_1_25 = var_1_26 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=129/2, var_1_15=8, var_1_16=64, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L82] COND FALSE !((8 / var_1_15) < (64 / var_1_16)) [L89] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L91] COND TRUE (- var_1_14) <= var_1_14 [L92] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L100] COND TRUE var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14)))) [L101] var_1_7 = (var_1_1 && (! 1)) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, stepLocal_0=-128, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L163] RET step() [L164] CALL, EXPR property() [L154] EXPR ((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25))) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L154-L155] return (((((((- var_1_14) <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_4)) : ((var_1_14 <= var_1_14) ? (var_1_1 == ((unsigned char) var_1_6)) : (var_1_1 == ((unsigned char) var_1_4)))) && ((var_1_14 < ((((var_1_14) > ((128.5 * var_1_14))) ? (var_1_14) : ((128.5 * var_1_14))))) ? (var_1_7 == ((unsigned char) (var_1_1 && (! 1)))) : 1)) && (((last_1_var_1_21 * last_1_var_1_21) < (((((-1) > (var_1_11)) ? (-1) : (var_1_11))) - var_1_12)) ? (((last_1_var_1_21 + last_1_var_1_21) < var_1_12) ? (var_1_8 == ((unsigned short int) var_1_13)) : 1) : (var_1_8 == ((unsigned short int) var_1_13)))) && (((8 / var_1_15) < (64 / var_1_16)) ? ((var_1_8 >= var_1_15) ? (var_1_14 == ((double) (var_1_17 - var_1_18))) : (var_1_14 == ((double) (var_1_18 - (64.25 + ((((var_1_19) > (var_1_20)) ? (var_1_19) : (var_1_20)))))))) : (var_1_14 == ((double) var_1_18)))) && (((last_1_var_1_8 + 4u) <= (last_1_var_1_8 >> var_1_15)) ? (var_1_21 == ((signed short int) (((((last_1_var_1_25 + last_1_var_1_25)) < (last_1_var_1_25)) ? ((last_1_var_1_25 + last_1_var_1_25)) : (last_1_var_1_25))))) : (var_1_21 == ((signed short int) last_1_var_1_25)))) && ((! (var_1_21 > var_1_8)) ? (var_1_4 ? (var_1_25 == ((signed char) var_1_26)) : 1) : 1) ; [L164] RET, EXPR property() [L164] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=-64, last_1_var_1_25=-128, last_1_var_1_8=4, var_1_11=0, var_1_12=0, var_1_13=0, var_1_14=3, var_1_15=8, var_1_16=64, var_1_18=3, var_1_1=1, var_1_21=-256, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=128, var_1_31=0, var_1_32=2, var_1_33=2, var_1_34=2, var_1_35=0, var_1_4=1, var_1_6=-256, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 791 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 767 mSDsluCounter, 1602 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1139 mSDsCounter, 445 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 951 IncrementalHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 445 mSolverCounterUnsat, 463 mSDtfsCounter, 951 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 621 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=4, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 209 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1204 NumberOfCodeBlocks, 1204 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1024 ConstructedInterpolants, 0 QuantifiedInterpolants, 3286 SizeOfPredicates, 2 NumberOfNonLiveVariables, 408 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 8298/8424 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-12 01:58:13,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.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 ea47bb0050149eccadb69630e06c0319f913c75b08e9058f28d8d379ef84ce69 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:58:15,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:58:15,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:58:15,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:58:15,304 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:58:15,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:58:15,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:58:15,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:58:15,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:58:15,338 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:58:15,338 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:58:15,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:58:15,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:58:15,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:58:15,341 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:58:15,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:58:15,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:58:15,342 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:58:15,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:58:15,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:58:15,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:58:15,348 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:58:15,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:58:15,348 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:58:15,349 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:58:15,349 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:58:15,349 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:58:15,349 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:58:15,350 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:58:15,350 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:58:15,350 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:58:15,350 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:58:15,351 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:58:15,351 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:58:15,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:58:15,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:58:15,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:58:15,354 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:58:15,354 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:58:15,354 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:58:15,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:58:15,355 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:58:15,355 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:58:15,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:58:15,356 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 -> ea47bb0050149eccadb69630e06c0319f913c75b08e9058f28d8d379ef84ce69 [2024-11-12 01:58:15,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:58:15,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:58:15,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:58:15,722 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:58:15,723 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:58:15,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i [2024-11-12 01:58:17,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:58:17,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:58:17,500 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i [2024-11-12 01:58:17,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2b15b21/a25f3f77b21b4fcea23b32497c1d02d4/FLAG5bf0c3d16 [2024-11-12 01:58:17,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec2b15b21/a25f3f77b21b4fcea23b32497c1d02d4 [2024-11-12 01:58:17,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:58:17,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:58:17,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:58:17,531 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:58:17,535 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:58:17,545 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:17,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378b8dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17, skipping insertion in model container [2024-11-12 01:58:17,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:17,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:58:17,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i[915,928] [2024-11-12 01:58:17,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:58:17,818 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:58:17,832 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-38.i[915,928] [2024-11-12 01:58:17,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:58:17,901 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:58:17,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17 WrapperNode [2024-11-12 01:58:17,902 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:58:17,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:58:17,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:58:17,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:58:17,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:17,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:17,957 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-12 01:58:17,961 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:58:17,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:58:17,962 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:58:17,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:58:17,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:17,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:17,983 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:18,005 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-12 01:58:18,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:18,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:18,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:18,032 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:18,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:18,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:18,049 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:58:18,050 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:58:18,050 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:58:18,050 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:58:18,051 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (1/1) ... [2024-11-12 01:58:18,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:58:18,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:58:18,087 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-12 01:58:18,091 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-12 01:58:18,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:58:18,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:58:18,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:58:18,150 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:58:18,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:58:18,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:58:18,229 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:58:18,231 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:58:23,511 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 01:58:23,511 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:58:23,524 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:58:23,526 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:58:23,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:58:23 BoogieIcfgContainer [2024-11-12 01:58:23,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:58:23,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:58:23,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:58:23,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:58:23,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:58:17" (1/3) ... [2024-11-12 01:58:23,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53113ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:58:23, skipping insertion in model container [2024-11-12 01:58:23,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:58:17" (2/3) ... [2024-11-12 01:58:23,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53113ab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:58:23, skipping insertion in model container [2024-11-12 01:58:23,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:58:23" (3/3) ... [2024-11-12 01:58:23,534 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-38.i [2024-11-12 01:58:23,551 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:58:23,552 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:58:23,620 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:58:23,626 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;@40de1e82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:58:23,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:58:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 01:58:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 01:58:23,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:58:23,650 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:58:23,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:58:23,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:58:23,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2042334349, now seen corresponding path program 1 times [2024-11-12 01:58:23,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:58:23,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [56933116] [2024-11-12 01:58:23,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:58:23,671 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-12 01:58:23,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:58:23,674 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-12 01:58:23,695 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-12 01:58:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:24,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:58:24,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:58:24,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 584 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-11-12 01:58:24,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:58:24,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:58:24,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [56933116] [2024-11-12 01:58:24,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [56933116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:58:24,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:58:24,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:58:24,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224424128] [2024-11-12 01:58:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:58:24,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:58:24,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:58:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:58:24,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:58:24,287 INFO L87 Difference]: Start difference. First operand has 74 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-12 01:58:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:58:24,319 INFO L93 Difference]: Finished difference Result 141 states and 249 transitions. [2024-11-12 01:58:24,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:58:24,322 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 168 [2024-11-12 01:58:24,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:58:24,328 INFO L225 Difference]: With dead ends: 141 [2024-11-12 01:58:24,328 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 01:58:24,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 167 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-12 01:58:24,334 INFO L435 NwaCegarLoop]: 106 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, 106 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-12 01:58:24,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:58:24,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 01:58:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-12 01:58:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-12 01:58:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-12 01:58:24,371 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 168 [2024-11-12 01:58:24,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:58:24,371 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-12 01:58:24,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-12 01:58:24,372 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-12 01:58:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-12 01:58:24,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:58:24,375 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:58:24,390 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-12 01:58:24,576 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-12 01:58:24,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:58:24,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:58:24,577 INFO L85 PathProgramCache]: Analyzing trace with hash 622902277, now seen corresponding path program 1 times [2024-11-12 01:58:24,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:58:24,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071343466] [2024-11-12 01:58:24,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:58:24,578 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-12 01:58:24,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:58:24,581 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-12 01:58:24,582 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-12 01:58:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:25,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 01:58:25,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:58:26,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-12 01:58:26,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:58:26,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:58:26,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071343466] [2024-11-12 01:58:26,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071343466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:58:26,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:58:26,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 01:58:26,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492695313] [2024-11-12 01:58:26,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:58:26,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 01:58:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:58:26,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 01:58:26,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 01:58:26,561 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 01:58:30,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:58:32,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:58:34,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:58:34,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:58:34,358 INFO L93 Difference]: Finished difference Result 317 states and 484 transitions. [2024-11-12 01:58:34,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 01:58:34,360 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 168 [2024-11-12 01:58:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:58:34,365 INFO L225 Difference]: With dead ends: 317 [2024-11-12 01:58:34,365 INFO L226 Difference]: Without dead ends: 250 [2024-11-12 01:58:34,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 01:58:34,367 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 174 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-12 01:58:34,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 570 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2024-11-12 01:58:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-12 01:58:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 135. [2024-11-12 01:58:34,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 78 states have internal predecessors, (99), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-12 01:58:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 207 transitions. [2024-11-12 01:58:34,427 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 207 transitions. Word has length 168 [2024-11-12 01:58:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:58:34,429 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 207 transitions. [2024-11-12 01:58:34,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-12 01:58:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 207 transitions. [2024-11-12 01:58:34,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-12 01:58:34,433 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:58:34,434 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 01:58:34,458 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 01:58:34,634 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-12 01:58:34,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:58:34,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:58:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash 273138733, now seen corresponding path program 1 times [2024-11-12 01:58:34,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:58:34,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556092578] [2024-11-12 01:58:34,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:58:34,636 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-12 01:58:34,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:58:34,640 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-12 01:58:34,641 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-12 01:58:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:58:35,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-12 01:58:35,090 INFO L279 TraceCheckSpWp]: Computing forward predicates...