./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.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_fillercodestructure_filler-pr-ci_file-8.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 3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:26:35,941 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:26:36,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:26:36,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:26:36,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:26:36,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:26:36,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:26:36,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:26:36,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:26:36,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:26:36,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:26:36,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:26:36,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:26:36,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:26:36,055 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:26:36,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:26:36,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:26:36,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:26:36,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:26:36,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:26:36,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:26:36,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:26:36,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:26:36,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:26:36,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:26:36,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:26:36,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:26:36,062 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:26:36,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:26:36,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:26:36,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:26:36,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:26:36,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:26:36,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:26:36,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:26:36,065 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:26:36,065 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:26:36,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:26:36,066 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:26:36,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:26:36,067 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:26:36,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:26:36,068 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 -> 3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d [2024-11-12 03:26:36,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:26:36,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:26:36,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:26:36,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:26:36,362 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:26:36,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-11-12 03:26:37,857 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:26:38,079 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:26:38,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-11-12 03:26:38,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ba1bf6b/3b885ca9c55f4bc1be6b029655fb38ce/FLAGe2bb83056 [2024-11-12 03:26:38,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2ba1bf6b/3b885ca9c55f4bc1be6b029655fb38ce [2024-11-12 03:26:38,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:26:38,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:26:38,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:26:38,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:26:38,113 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:26:38,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d5f68e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38, skipping insertion in model container [2024-11-12 03:26:38,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,151 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:26:38,310 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i[918,931] [2024-11-12 03:26:38,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:26:38,398 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:26:38,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i[918,931] [2024-11-12 03:26:38,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:26:38,471 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:26:38,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38 WrapperNode [2024-11-12 03:26:38,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:26:38,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:26:38,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:26:38,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:26:38,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,512 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,563 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 182 [2024-11-12 03:26:38,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:26:38,564 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:26:38,564 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:26:38,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:26:38,576 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,577 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,584 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,618 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 03:26:38,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,659 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,664 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:26:38,665 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:26:38,665 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:26:38,665 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:26:38,666 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (1/1) ... [2024-11-12 03:26:38,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:26:38,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:38,700 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 03:26:38,704 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 03:26:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:26:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:26:38,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:26:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:26:38,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:26:38,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:26:38,815 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:26:38,817 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:26:39,374 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 03:26:39,374 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:26:39,389 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:26:39,390 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:26:39,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:39 BoogieIcfgContainer [2024-11-12 03:26:39,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:26:39,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:26:39,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:26:39,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:26:39,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:26:38" (1/3) ... [2024-11-12 03:26:39,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dab6a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:26:39, skipping insertion in model container [2024-11-12 03:26:39,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:26:38" (2/3) ... [2024-11-12 03:26:39,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dab6a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:26:39, skipping insertion in model container [2024-11-12 03:26:39,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:39" (3/3) ... [2024-11-12 03:26:39,398 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-11-12 03:26:39,415 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:26:39,415 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:26:39,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:26:39,496 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;@eb640da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:26:39,496 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:26:39,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 59 states have internal predecessors, (91), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 03:26:39,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 03:26:39,519 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:39,521 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:26:39,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:39,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:39,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1638019198, now seen corresponding path program 1 times [2024-11-12 03:26:39,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:39,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162008739] [2024-11-12 03:26:39,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:39,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:39,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 03:26:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:26:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:26:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:26:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:26:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:26:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:26:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:26:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:26:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:26:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:26:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:26:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:26:39,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:26:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:26:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:39,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:26:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:40,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:26:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:40,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:26:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:40,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:26:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:40,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:26:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:40,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:26:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:40,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 03:26:40,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:40,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162008739] [2024-11-12 03:26:40,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162008739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:26:40,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:26:40,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:26:40,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004876186] [2024-11-12 03:26:40,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:26:40,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:26:40,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:40,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:26:40,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:26:40,082 INFO L87 Difference]: Start difference. First operand has 84 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 59 states have internal predecessors, (91), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 03:26:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:26:40,114 INFO L93 Difference]: Finished difference Result 161 states and 291 transitions. [2024-11-12 03:26:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:26:40,117 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2024-11-12 03:26:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:26:40,126 INFO L225 Difference]: With dead ends: 161 [2024-11-12 03:26:40,127 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 03:26:40,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 03:26:40,134 INFO L435 NwaCegarLoop]: 129 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, 129 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 03:26:40,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:26:40,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 03:26:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-12 03:26:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.509090909090909) internal successors, (83), 55 states have internal predecessors, (83), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 03:26:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 129 transitions. [2024-11-12 03:26:40,177 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 129 transitions. Word has length 150 [2024-11-12 03:26:40,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:26:40,178 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 129 transitions. [2024-11-12 03:26:40,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 03:26:40,179 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 129 transitions. [2024-11-12 03:26:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 03:26:40,183 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:26:40,183 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:26:40,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:26:40,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:26:40,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:26:40,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1143957380, now seen corresponding path program 1 times [2024-11-12 03:26:40,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:26:40,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420972674] [2024-11-12 03:26:40,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:40,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:26:40,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:26:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:26:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 03:26:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:26:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:26:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:26:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:26:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:26:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:26:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:26:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:26:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:26:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:26:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:26:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:41,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:26:41,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:42,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:26:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:42,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:26:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:42,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:26:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:42,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:26:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:42,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:26:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:42,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:26:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:42,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:26:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:42,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:26:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-12 03:26:42,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:26:42,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420972674] [2024-11-12 03:26:42,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420972674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:26:42,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319386823] [2024-11-12 03:26:42,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:26:42,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:26:42,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:26:42,145 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 03:26:42,147 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 03:26:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:26:42,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 03:26:42,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:26:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2024-11-12 03:26:43,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:26:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 90 proven. 39 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-12 03:26:44,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319386823] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:26:44,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:26:44,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 33 [2024-11-12 03:26:44,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924518990] [2024-11-12 03:26:44,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:26:44,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-12 03:26:44,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:26:44,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-12 03:26:44,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=846, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 03:26:44,267 INFO L87 Difference]: Start difference. First operand 80 states and 129 transitions. Second operand has 33 states, 32 states have (on average 3.59375) internal successors, (115), 31 states have internal predecessors, (115), 9 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 9 states have call predecessors, (69), 9 states have call successors, (69) [2024-11-12 03:27:02,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:27:02,004 INFO L93 Difference]: Finished difference Result 2486 states and 3703 transitions. [2024-11-12 03:27:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 336 states. [2024-11-12 03:27:02,005 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.59375) internal successors, (115), 31 states have internal predecessors, (115), 9 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 9 states have call predecessors, (69), 9 states have call successors, (69) Word has length 150 [2024-11-12 03:27:02,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:27:02,028 INFO L225 Difference]: With dead ends: 2486 [2024-11-12 03:27:02,029 INFO L226 Difference]: Without dead ends: 2409 [2024-11-12 03:27:02,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 407 SyntacticMatches, 0 SemanticMatches, 349 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55710 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=19095, Invalid=103755, Unknown=0, NotChecked=0, Total=122850 [2024-11-12 03:27:02,061 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 4865 mSDsluCounter, 2739 mSDsCounter, 0 mSdLazyCounter, 3745 mSolverCounterSat, 2540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4901 SdHoareTripleChecker+Valid, 2889 SdHoareTripleChecker+Invalid, 6285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2540 IncrementalHoareTripleChecker+Valid, 3745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:27:02,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4901 Valid, 2889 Invalid, 6285 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2540 Valid, 3745 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-12 03:27:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2024-11-12 03:27:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 1508. [2024-11-12 03:27:02,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 996 states have (on average 1.428714859437751) internal successors, (1423), 1014 states have internal predecessors, (1423), 455 states have call successors, (455), 56 states have call predecessors, (455), 56 states have return successors, (455), 437 states have call predecessors, (455), 455 states have call successors, (455) [2024-11-12 03:27:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2333 transitions. [2024-11-12 03:27:02,351 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 2333 transitions. Word has length 150 [2024-11-12 03:27:02,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:27:02,352 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 2333 transitions. [2024-11-12 03:27:02,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.59375) internal successors, (115), 31 states have internal predecessors, (115), 9 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 9 states have call predecessors, (69), 9 states have call successors, (69) [2024-11-12 03:27:02,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 2333 transitions. [2024-11-12 03:27:02,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 03:27:02,356 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:02,356 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:27:02,378 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 03:27:02,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:02,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:02,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash 334610754, now seen corresponding path program 1 times [2024-11-12 03:27:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:27:02,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387559444] [2024-11-12 03:27:02,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:27:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:27:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:27:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 03:27:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:27:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:27:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:27:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:27:03,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:27:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:27:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:27:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:27:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:27:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:27:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:27:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:27:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:27:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:27:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:27:03,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:27:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:27:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:27:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:27:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:27:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 18 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-11-12 03:27:03,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:27:03,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387559444] [2024-11-12 03:27:03,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387559444] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:03,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302659198] [2024-11-12 03:27:03,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:03,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:03,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:27:03,412 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 03:27:03,416 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 03:27:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:03,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 03:27:03,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:04,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 531 proven. 57 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-12 03:27:04,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:27:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 108 proven. 21 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-12 03:27:04,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302659198] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 03:27:04,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 03:27:04,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 11] total 29 [2024-11-12 03:27:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790335504] [2024-11-12 03:27:04,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 03:27:04,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-12 03:27:04,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:27:04,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-12 03:27:04,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=649, Unknown=0, NotChecked=0, Total=812 [2024-11-12 03:27:04,683 INFO L87 Difference]: Start difference. First operand 1508 states and 2333 transitions. Second operand has 29 states, 29 states have (on average 3.310344827586207) internal successors, (96), 27 states have internal predecessors, (96), 9 states have call successors, (53), 4 states have call predecessors, (53), 8 states have return successors, (55), 10 states have call predecessors, (55), 9 states have call successors, (55) [2024-11-12 03:27:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:27:09,966 INFO L93 Difference]: Finished difference Result 6879 states and 10210 transitions. [2024-11-12 03:27:09,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2024-11-12 03:27:09,967 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.310344827586207) internal successors, (96), 27 states have internal predecessors, (96), 9 states have call successors, (53), 4 states have call predecessors, (53), 8 states have return successors, (55), 10 states have call predecessors, (55), 9 states have call successors, (55) Word has length 150 [2024-11-12 03:27:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:27:10,008 INFO L225 Difference]: With dead ends: 6879 [2024-11-12 03:27:10,008 INFO L226 Difference]: Without dead ends: 5374 [2024-11-12 03:27:10,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 340 SyntacticMatches, 1 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7715 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3793, Invalid=15667, Unknown=0, NotChecked=0, Total=19460 [2024-11-12 03:27:10,024 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1831 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 1698 mSolverCounterSat, 1027 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1847 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 2725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1027 IncrementalHoareTripleChecker+Valid, 1698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 03:27:10,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1847 Valid, 1261 Invalid, 2725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1027 Valid, 1698 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 03:27:10,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5374 states. [2024-11-12 03:27:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5374 to 1415. [2024-11-12 03:27:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 984 states have (on average 1.4227642276422765) internal successors, (1400), 990 states have internal predecessors, (1400), 356 states have call successors, (356), 74 states have call predecessors, (356), 74 states have return successors, (356), 350 states have call predecessors, (356), 356 states have call successors, (356) [2024-11-12 03:27:10,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2112 transitions. [2024-11-12 03:27:10,359 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2112 transitions. Word has length 150 [2024-11-12 03:27:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:27:10,360 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 2112 transitions. [2024-11-12 03:27:10,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.310344827586207) internal successors, (96), 27 states have internal predecessors, (96), 9 states have call successors, (53), 4 states have call predecessors, (53), 8 states have return successors, (55), 10 states have call predecessors, (55), 9 states have call successors, (55) [2024-11-12 03:27:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2112 transitions. [2024-11-12 03:27:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 03:27:10,367 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:10,367 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:27:10,385 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 03:27:10,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-12 03:27:10,568 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:10,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1252123641, now seen corresponding path program 1 times [2024-11-12 03:27:10,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:27:10,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420727247] [2024-11-12 03:27:10,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:10,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:27:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:27:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:27:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 03:27:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:27:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:27:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:27:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:27:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:27:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:27:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:27:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:27:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:27:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:27:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:27:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:27:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:27:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:27:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:27:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:27:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:27:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:27:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:27:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:27:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 132 proven. 48 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-11-12 03:27:11,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:27:11,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420727247] [2024-11-12 03:27:11,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420727247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:11,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362520101] [2024-11-12 03:27:11,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:11,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:11,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:27:11,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:27:11,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 03:27:11,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:11,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-12 03:27:11,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 590 proven. 48 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2024-11-12 03:27:11,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 03:27:14,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362520101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 03:27:14,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 03:27:14,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 14 [2024-11-12 03:27:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634603329] [2024-11-12 03:27:14,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 03:27:14,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 03:27:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:27:14,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 03:27:14,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2024-11-12 03:27:14,137 INFO L87 Difference]: Start difference. First operand 1415 states and 2112 transitions. Second operand has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) [2024-11-12 03:27:15,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:27:15,565 INFO L93 Difference]: Finished difference Result 3728 states and 5415 transitions. [2024-11-12 03:27:15,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 03:27:15,566 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) Word has length 151 [2024-11-12 03:27:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:27:15,586 INFO L225 Difference]: With dead ends: 3728 [2024-11-12 03:27:15,586 INFO L226 Difference]: Without dead ends: 2316 [2024-11-12 03:27:15,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=250, Invalid=742, Unknown=0, NotChecked=0, Total=992 [2024-11-12 03:27:15,595 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 157 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 03:27:15,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 893 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 03:27:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2024-11-12 03:27:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 911. [2024-11-12 03:27:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 662 states have (on average 1.404833836858006) internal successors, (930), 662 states have internal predecessors, (930), 184 states have call successors, (184), 64 states have call predecessors, (184), 64 states have return successors, (184), 184 states have call predecessors, (184), 184 states have call successors, (184) [2024-11-12 03:27:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1298 transitions. [2024-11-12 03:27:15,859 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1298 transitions. Word has length 151 [2024-11-12 03:27:15,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:27:15,861 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1298 transitions. [2024-11-12 03:27:15,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 13 states have internal predecessors, (61), 5 states have call successors, (32), 4 states have call predecessors, (32), 6 states have return successors, (32), 5 states have call predecessors, (32), 5 states have call successors, (32) [2024-11-12 03:27:15,861 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1298 transitions. [2024-11-12 03:27:15,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 03:27:15,865 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:15,865 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:27:15,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-12 03:27:16,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:16,067 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:16,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:16,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2021775301, now seen corresponding path program 1 times [2024-11-12 03:27:16,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:27:16,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392087066] [2024-11-12 03:27:16,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:16,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:27:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:27:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:27:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 03:27:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:27:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 03:27:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 03:27:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 03:27:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 03:27:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:27:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 03:27:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:27:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 03:27:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:27:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 03:27:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:27:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 03:27:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:27:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 03:27:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:27:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-12 03:27:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:27:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-12 03:27:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:27:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:16,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-12 03:27:16,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:27:16,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392087066] [2024-11-12 03:27:16,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392087066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:27:16,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:27:16,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 03:27:16,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529124930] [2024-11-12 03:27:16,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:27:16,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 03:27:16,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:27:16,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 03:27:16,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:27:16,165 INFO L87 Difference]: Start difference. First operand 911 states and 1298 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 03:27:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:27:16,422 INFO L93 Difference]: Finished difference Result 2257 states and 3302 transitions. [2024-11-12 03:27:16,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 03:27:16,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 151 [2024-11-12 03:27:16,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:27:16,430 INFO L225 Difference]: With dead ends: 2257 [2024-11-12 03:27:16,431 INFO L226 Difference]: Without dead ends: 1349 [2024-11-12 03:27:16,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 03:27:16,434 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 76 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:27:16,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 260 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:27:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2024-11-12 03:27:16,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1339. [2024-11-12 03:27:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1026 states have (on average 1.4522417153996101) internal successors, (1490), 1034 states have internal predecessors, (1490), 240 states have call successors, (240), 72 states have call predecessors, (240), 72 states have return successors, (240), 232 states have call predecessors, (240), 240 states have call successors, (240) [2024-11-12 03:27:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1970 transitions. [2024-11-12 03:27:16,717 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1970 transitions. Word has length 151 [2024-11-12 03:27:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:27:16,718 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1970 transitions. [2024-11-12 03:27:16,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-12 03:27:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1970 transitions. [2024-11-12 03:27:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-12 03:27:16,720 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:16,720 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:27:16,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 03:27:16,721 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:16,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:16,721 INFO L85 PathProgramCache]: Analyzing trace with hash 984386530, now seen corresponding path program 1 times [2024-11-12 03:27:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:27:16,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872444081] [2024-11-12 03:27:16,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:16,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:27:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 03:27:16,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853011716] [2024-11-12 03:27:16,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:16,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:16,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:27:16,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 03:27:16,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 03:27:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:27:17,049 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 03:27:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 03:27:17,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 03:27:17,233 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 03:27:17,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 03:27:17,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 03:27:17,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 03:27:17,440 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-12 03:27:17,556 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 03:27:17,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 03:27:17 BoogieIcfgContainer [2024-11-12 03:27:17,560 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 03:27:17,560 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 03:27:17,560 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 03:27:17,560 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 03:27:17,561 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:26:39" (3/4) ... [2024-11-12 03:27:17,563 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 03:27:17,564 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 03:27:17,565 INFO L158 Benchmark]: Toolchain (without parser) took 39459.02ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 114.1MB in the beginning and 340.5MB in the end (delta: -226.4MB). Peak memory consumption was 237.9MB. Max. memory is 16.1GB. [2024-11-12 03:27:17,566 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:27:17,566 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.45ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 96.7MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-12 03:27:17,566 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.90ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 91.1MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 03:27:17,566 INFO L158 Benchmark]: Boogie Preprocessor took 100.04ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 82.1MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-12 03:27:17,568 INFO L158 Benchmark]: RCFGBuilder took 725.54ms. Allocated memory is still 167.8MB. Free memory was 82.1MB in the beginning and 120.1MB in the end (delta: -38.1MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2024-11-12 03:27:17,569 INFO L158 Benchmark]: TraceAbstraction took 38167.45ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 119.0MB in the beginning and 340.5MB in the end (delta: -221.5MB). Peak memory consumption was 241.7MB. Max. memory is 16.1GB. [2024-11-12 03:27:17,569 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 629.1MB. Free memory is still 340.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 03:27:17,570 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.18ms. Allocated memory is still 167.8MB. Free memory is still 130.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.45ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 96.7MB in the end (delta: 17.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.90ms. Allocated memory is still 167.8MB. Free memory was 96.7MB in the beginning and 91.1MB in the end (delta: 5.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.04ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 82.1MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 725.54ms. Allocated memory is still 167.8MB. Free memory was 82.1MB in the beginning and 120.1MB in the end (delta: -38.1MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * TraceAbstraction took 38167.45ms. Allocated memory was 167.8MB in the beginning and 629.1MB in the end (delta: 461.4MB). Free memory was 119.0MB in the beginning and 340.5MB in the end (delta: -221.5MB). Peak memory consumption was 241.7MB. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 629.1MB. Free memory is still 340.5MB. 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 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 53, overapproximation of someUnaryFLOAToperation at line 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 999999999.675; [L23] signed long int var_1_4 = -5; [L24] float var_1_5 = 7.875; [L25] float var_1_6 = 99.04; [L26] signed long int var_1_7 = -2; [L27] unsigned long int var_1_9 = 1; [L28] double var_1_10 = 63.25; [L29] unsigned char var_1_11 = 0; [L30] unsigned short int var_1_13 = 0; [L31] unsigned short int var_1_15 = 17766; [L32] unsigned short int var_1_16 = 28149; [L33] unsigned char var_1_19 = 4; [L34] unsigned char var_1_20 = 50; [L35] unsigned char var_1_21 = 64; [L36] unsigned char var_1_22 = 50; [L37] unsigned char var_1_23 = 5; [L38] unsigned char var_1_24 = 128; [L39] signed long int var_1_25 = -16; [L40] unsigned char var_1_26 = 0; [L41] signed short int var_1_27 = -4; [L42] unsigned short int var_1_33 = 2; [L43] signed long int var_1_36 = -1; [L44] float var_1_38 = 256.7; [L45] unsigned long int var_1_40 = 10; [L46] double var_1_42 = 100.5; [L47] signed char var_1_45 = 8; [L48] unsigned short int last_1_var_1_13 = 0; VAL [isInitial=0, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L175] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L138] var_1_4 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L139] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L140] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L141] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L142] var_1_5 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L143] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L144] var_1_6 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L146] var_1_10 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L147] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L148] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L148] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L149] var_1_11 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L151] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L151] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L152] var_1_15 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_15 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L153] RET assume_abort_if_not(var_1_15 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L154] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L155] var_1_16 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L156] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L157] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L158] var_1_20 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_20 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L159] RET assume_abort_if_not(var_1_20 >= 32) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L161] var_1_21 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_21 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L162] RET assume_abort_if_not(var_1_21 >= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L163] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L164] var_1_22 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L165] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_22 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L166] RET assume_abort_if_not(var_1_22 <= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L167] var_1_23 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L168] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L169] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L170] var_1_24 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_24 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L171] RET assume_abort_if_not(var_1_24 >= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L172] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L52] COND TRUE last_1_var_1_13 == (last_1_var_1_13 % var_1_4) [L53] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L55] COND TRUE \read(var_1_11) [L56] var_1_33 = ((((var_1_26) > (var_1_23)) ? (var_1_26) : (var_1_23))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=4, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L58] COND FALSE !(var_1_10 == var_1_1) [L65] var_1_19 = var_1_24 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L67] COND FALSE !(var_1_21 != (var_1_22 + var_1_19)) [L72] var_1_27 = var_1_24 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L74] COND FALSE !(var_1_19 < (var_1_21 / var_1_20)) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L81] COND FALSE !(16 < var_1_22) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L88] COND TRUE var_1_1 >= var_1_6 [L89] var_1_7 = var_1_19 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L91] COND FALSE !(var_1_20 <= var_1_13) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L98] COND FALSE !(((var_1_6 * var_1_5) / var_1_10) > var_1_1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L105] COND FALSE !(var_1_26 < ((((((((var_1_22) > (var_1_26)) ? (var_1_22) : (var_1_26)))) > (var_1_22)) ? (((((var_1_22) > (var_1_26)) ? (var_1_22) : (var_1_26)))) : (var_1_22)))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=127, var_1_9=1] [L108] COND TRUE var_1_6 <= var_1_6 [L109] var_1_42 = (((((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) < 0 ) ? -((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) : ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=2, var_1_45=8, var_1_4=-1, var_1_6=0, var_1_7=127, var_1_9=1] [L116] COND FALSE !(var_1_7 < var_1_9) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=2, var_1_45=8, var_1_4=-1, var_1_6=0, var_1_7=127, var_1_9=1] [L119] var_1_38 = var_1_5 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=8, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L120] COND TRUE (var_1_22 % var_1_15) < var_1_20 [L121] var_1_45 = ((var_1_23 - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=-16, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L125] COND FALSE !((25.3 * var_1_5) != var_1_1) [L134] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=63, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L187] RET step() [L188] CALL, EXPR property() [L178-L179] return (((((((last_1_var_1_13 == (last_1_var_1_13 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((var_1_1 >= var_1_6) ? (var_1_7 == ((signed long int) var_1_19)) : 1)) && ((((var_1_6 * var_1_5) / var_1_10) > var_1_1) ? (var_1_11 ? (var_1_9 == ((unsigned long int) var_1_26)) : (var_1_9 == ((unsigned long int) var_1_26))) : 1)) && ((var_1_7 < var_1_9) ? (var_1_13 == ((unsigned short int) (var_1_26 + (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - (var_1_19 + var_1_19))))) : 1)) && ((var_1_10 == var_1_1) ? (var_1_11 ? (var_1_19 == ((unsigned char) (((32 + var_1_20) + var_1_21) - (var_1_22 + var_1_23)))) : (var_1_19 == ((unsigned char) (var_1_24 - var_1_23)))) : (var_1_19 == ((unsigned char) var_1_24)))) && (((25.3 * var_1_5) != var_1_1) ? (var_1_11 ? ((var_1_15 <= var_1_13) ? (var_1_25 == ((signed long int) var_1_26)) : 1) : (var_1_25 == ((signed long int) var_1_22))) : (var_1_25 == ((signed long int) var_1_20)))) && ((var_1_19 < (var_1_21 / var_1_20)) ? ((var_1_19 > var_1_19) ? (var_1_26 == ((unsigned char) ((((((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) > (var_1_23)) ? (((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) : (var_1_23))))) : (var_1_26 == ((unsigned char) var_1_22))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=63, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=63, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=16384, var_1_16=16383, var_1_19=-129, var_1_20=-449, var_1_21=-129, var_1_22=0, var_1_23=63, var_1_24=-129, var_1_25=63, var_1_26=0, var_1_27=127, var_1_33=63, var_1_36=-1, var_1_38=3, var_1_40=10, var_1_42=2, var_1_45=63, var_1_4=-1, var_1_5=3, var_1_6=0, var_1_7=127, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.0s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6995 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6929 mSDsluCounter, 5432 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4725 mSDsCounter, 3609 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6299 IncrementalHoareTripleChecker+Invalid, 9908 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3609 mSolverCounterUnsat, 707 mSDtfsCounter, 6299 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1609 GetRequests, 1090 SyntacticMatches, 1 SemanticMatches, 518 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 63622 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1508occurred in iteration=2, InterpolantAutomatonStates: 491, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 6275 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 1505 NumberOfCodeBlocks, 1505 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1493 ConstructedInterpolants, 0 QuantifiedInterpolants, 5858 SizeOfPredicates, 24 NumberOfNonLiveVariables, 1044 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 9832/10120 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 03:27:17,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.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 3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:27:19,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:27:19,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 03:27:19,949 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:27:19,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:27:19,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:27:19,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:27:19,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:27:19,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:27:19,980 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:27:19,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:27:19,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:27:19,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:27:19,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:27:19,983 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:27:19,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:27:19,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:27:19,984 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:27:19,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:27:19,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:27:19,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:27:19,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:27:19,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:27:19,987 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 03:27:19,988 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 03:27:19,988 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:27:19,988 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 03:27:19,988 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:27:19,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:27:19,988 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:27:19,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:27:19,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:27:19,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:27:19,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:27:19,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:27:19,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:27:19,990 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:27:19,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:27:19,992 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 03:27:19,993 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 03:27:19,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:27:19,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:27:19,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:27:19,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:27:19,994 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 -> 3030444f88f9a17418da1dc67b4b4ded6b77914f13db39467d146bf41ea08d3d [2024-11-12 03:27:20,346 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:27:20,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:27:20,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:27:20,380 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:27:20,381 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:27:20,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-11-12 03:27:21,977 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:27:22,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:27:22,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-11-12 03:27:22,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b7237c1/3e2a2d3706584b458d7ac9761e82aa39/FLAG04edc9566 [2024-11-12 03:27:22,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3b7237c1/3e2a2d3706584b458d7ac9761e82aa39 [2024-11-12 03:27:22,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:27:22,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:27:22,583 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:27:22,583 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:27:22,588 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:27:22,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:27:22" (1/1) ... [2024-11-12 03:27:22,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebae2ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:22, skipping insertion in model container [2024-11-12 03:27:22,593 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:27:22" (1/1) ... [2024-11-12 03:27:22,621 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:27:22,821 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i[918,931] [2024-11-12 03:27:22,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:27:22,935 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:27:22,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i[918,931] [2024-11-12 03:27:23,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:27:23,035 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:27:23,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23 WrapperNode [2024-11-12 03:27:23,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:27:23,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:27:23,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:27:23,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:27:23,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (1/1) ... [2024-11-12 03:27:23,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (1/1) ... [2024-11-12 03:27:23,100 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-12 03:27:23,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:27:23,104 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:27:23,104 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:27:23,105 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:27:23,117 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (1/1) ... [2024-11-12 03:27:23,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (1/1) ... [2024-11-12 03:27:23,127 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (1/1) ... [2024-11-12 03:27:23,140 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 03:27:23,140 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (1/1) ... [2024-11-12 03:27:23,141 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (1/1) ... [2024-11-12 03:27:23,158 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (1/1) ... [2024-11-12 03:27:23,168 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (1/1) ... [2024-11-12 03:27:23,176 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (1/1) ... [2024-11-12 03:27:23,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (1/1) ... [2024-11-12 03:27:23,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:27:23,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:27:23,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:27:23,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:27:23,190 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (1/1) ... [2024-11-12 03:27:23,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:27:23,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:27:23,222 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 03:27:23,225 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 03:27:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:27:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 03:27:23,268 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:27:23,268 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:27:23,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:27:23,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:27:23,351 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:27:23,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:27:44,056 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-12 03:27:44,056 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:27:44,068 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:27:44,068 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:27:44,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:27:44 BoogieIcfgContainer [2024-11-12 03:27:44,069 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:27:44,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:27:44,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:27:44,073 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:27:44,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:27:22" (1/3) ... [2024-11-12 03:27:44,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746a7f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:27:44, skipping insertion in model container [2024-11-12 03:27:44,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:27:23" (2/3) ... [2024-11-12 03:27:44,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746a7f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:27:44, skipping insertion in model container [2024-11-12 03:27:44,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:27:44" (3/3) ... [2024-11-12 03:27:44,075 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-8.i [2024-11-12 03:27:44,090 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:27:44,090 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:27:44,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:27:44,159 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;@68986b35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:27:44,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:27:44,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 55 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 03:27:44,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 03:27:44,174 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:44,175 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:27:44,175 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:44,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:44,180 INFO L85 PathProgramCache]: Analyzing trace with hash -630852230, now seen corresponding path program 1 times [2024-11-12 03:27:44,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:27:44,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056987362] [2024-11-12 03:27:44,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:44,193 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 03:27:44,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:27:44,196 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 03:27:44,198 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 03:27:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:45,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 03:27:45,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 03:27:45,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2024-11-12 03:27:45,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 03:27:45,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 03:27:45,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056987362] [2024-11-12 03:27:45,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056987362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:27:45,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:27:45,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:27:45,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381333555] [2024-11-12 03:27:45,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:27:45,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:27:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 03:27:45,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:27:45,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:27:45,399 INFO L87 Difference]: Start difference. First operand has 80 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 55 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 03:27:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:27:45,442 INFO L93 Difference]: Finished difference Result 153 states and 277 transitions. [2024-11-12 03:27:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:27:45,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2024-11-12 03:27:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:27:45,456 INFO L225 Difference]: With dead ends: 153 [2024-11-12 03:27:45,456 INFO L226 Difference]: Without dead ends: 76 [2024-11-12 03:27:45,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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 03:27:45,465 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:27:45,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:27:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-12 03:27:45,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-12 03:27:45,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 51 states have internal predecessors, (76), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-12 03:27:45,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 122 transitions. [2024-11-12 03:27:45,505 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 122 transitions. Word has length 150 [2024-11-12 03:27:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:27:45,505 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 122 transitions. [2024-11-12 03:27:45,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-12 03:27:45,506 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 122 transitions. [2024-11-12 03:27:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-12 03:27:45,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:27:45,509 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:27:45,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 03:27:45,710 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 03:27:45,710 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:27:45,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:27:45,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1124914048, now seen corresponding path program 1 times [2024-11-12 03:27:45,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 03:27:45,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492998254] [2024-11-12 03:27:45,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:27:45,713 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 03:27:45,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 03:27:45,715 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 03:27:45,716 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 03:27:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:27:46,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 03:27:46,832 INFO L279 TraceCheckSpWp]: Computing forward predicates...