./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.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 7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:27:44,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:27:44,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:27:44,448 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:27:44,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:27:44,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:27:44,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:27:44,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:27:44,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:27:44,477 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:27:44,477 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:27:44,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:27:44,478 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:27:44,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:27:44,480 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:27:44,481 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:27:44,481 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:27:44,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:27:44,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:27:44,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:27:44,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:27:44,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:27:44,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:27:44,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:27:44,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:27:44,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:27:44,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:27:44,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:27:44,484 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:27:44,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:27:44,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:27:44,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:27:44,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:27:44,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:27:44,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:27:44,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:27:44,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:27:44,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:27:44,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:27:44,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:27:44,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:27:44,493 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:27:44,493 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 -> 7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5 [2024-11-16 12:27:44,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:27:44,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:27:44,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:27:44,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:27:44,735 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:27:44,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i [2024-11-16 12:27:45,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:27:46,159 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:27:46,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i [2024-11-16 12:27:46,172 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c5687025/e0f394e2d5b44c1496ecd3d5f14e878e/FLAGc28d4332f [2024-11-16 12:27:46,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c5687025/e0f394e2d5b44c1496ecd3d5f14e878e [2024-11-16 12:27:46,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:27:46,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:27:46,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:27:46,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:27:46,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:27:46,200 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,201 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6838e634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46, skipping insertion in model container [2024-11-16 12:27:46,201 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:27:46,379 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_codestructure_steplocals_file-46.i[917,930] [2024-11-16 12:27:46,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:27:46,464 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:27:46,475 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_codestructure_steplocals_file-46.i[917,930] [2024-11-16 12:27:46,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:27:46,524 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:27:46,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46 WrapperNode [2024-11-16 12:27:46,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:27:46,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:27:46,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:27:46,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:27:46,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,610 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-11-16 12:27:46,611 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:27:46,611 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:27:46,611 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:27:46,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:27:46,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,643 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:27:46,643 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,643 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,651 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,655 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:27:46,663 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:27:46,663 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:27:46,663 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:27:46,664 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (1/1) ... [2024-11-16 12:27:46,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:27:46,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:27:46,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:27:46,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:27:46,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:27:46,743 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:27:46,744 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:27:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:27:46,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:27:46,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:27:46,826 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:27:46,828 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:27:47,121 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L128: havoc property_#t~bitwise18#1;havoc property_#t~bitwise19#1;havoc property_#t~short20#1; [2024-11-16 12:27:47,161 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-16 12:27:47,162 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:27:47,187 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:27:47,187 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:27:47,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:27:47 BoogieIcfgContainer [2024-11-16 12:27:47,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:27:47,190 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:27:47,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:27:47,194 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:27:47,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:27:46" (1/3) ... [2024-11-16 12:27:47,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ade8a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:27:47, skipping insertion in model container [2024-11-16 12:27:47,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:46" (2/3) ... [2024-11-16 12:27:47,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ade8a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:27:47, skipping insertion in model container [2024-11-16 12:27:47,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:27:47" (3/3) ... [2024-11-16 12:27:47,197 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-46.i [2024-11-16 12:27:47,210 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:27:47,210 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:27:47,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:27:47,267 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;@35804c38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:27:47,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:27:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 12:27:47,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 12:27:47,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:27:47,281 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:27:47,281 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:27:47,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:27:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash -760320313, now seen corresponding path program 1 times [2024-11-16 12:27:47,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:27:47,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425022022] [2024-11-16 12:27:47,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:27:47,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:27:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:27:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:27:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:27:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:27:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:27:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:27:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:27:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:27:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:27:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:27:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:27:47,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:27:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:27:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:27:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:27:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:27:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:27:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:27:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:27:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:27:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:27:47,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:27:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 12:27:47,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:27:47,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425022022] [2024-11-16 12:27:47,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425022022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:27:47,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:27:47,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:27:47,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189182256] [2024-11-16 12:27:47,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:27:47,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:27:47,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:27:47,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:27:47,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:27:47,632 INFO L87 Difference]: Start difference. First operand has 79 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 12:27:47,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:27:47,666 INFO L93 Difference]: Finished difference Result 150 states and 253 transitions. [2024-11-16 12:27:47,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:27:47,669 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 143 [2024-11-16 12:27:47,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:27:47,675 INFO L225 Difference]: With dead ends: 150 [2024-11-16 12:27:47,676 INFO L226 Difference]: Without dead ends: 74 [2024-11-16 12:27:47,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:27:47,683 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:27:47,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:27:47,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-16 12:27:47,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-16 12:27:47,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 12:27:47,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2024-11-16 12:27:47,784 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 143 [2024-11-16 12:27:47,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:27:47,785 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2024-11-16 12:27:47,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 12:27:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2024-11-16 12:27:47,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 12:27:47,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:27:47,791 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:27:47,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:27:47,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:27:47,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:27:47,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1093427531, now seen corresponding path program 1 times [2024-11-16 12:27:47,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:27:47,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623682106] [2024-11-16 12:27:47,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:27:47,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:27:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:27:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:27:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:27:57,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:27:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:27:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:27:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:27:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:27:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:27:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:27:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:27:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:27:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:27:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:27:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:27:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:27:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:27:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:27:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:27:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:27:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:27:57,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:27:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:57,281 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 12:27:57,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:27:57,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623682106] [2024-11-16 12:27:57,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623682106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:27:57,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:27:57,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:27:57,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126509060] [2024-11-16 12:27:57,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:27:57,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:27:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:27:57,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:27:57,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:27:57,286 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:27:59,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:27:59,229 INFO L93 Difference]: Finished difference Result 242 states and 345 transitions. [2024-11-16 12:27:59,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:27:59,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-16 12:27:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:27:59,233 INFO L225 Difference]: With dead ends: 242 [2024-11-16 12:27:59,233 INFO L226 Difference]: Without dead ends: 171 [2024-11-16 12:27:59,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:27:59,234 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 218 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:27:59,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 410 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 12:27:59,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-16 12:27:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 99. [2024-11-16 12:27:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 71 states have internal predecessors, (92), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 12:27:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2024-11-16 12:27:59,249 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 144 [2024-11-16 12:27:59,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:27:59,250 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2024-11-16 12:27:59,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:27:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2024-11-16 12:27:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-16 12:27:59,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:27:59,251 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:27:59,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:27:59,252 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:27:59,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:27:59,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1386830538, now seen corresponding path program 1 times [2024-11-16 12:27:59,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:27:59,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541128806] [2024-11-16 12:27:59,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:27:59,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:27:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:27:59,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188309343] [2024-11-16 12:27:59,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:27:59,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:27:59,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:27:59,306 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:27:59,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 12:27:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:27:59,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 12:27:59,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:28:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 320 proven. 96 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-11-16 12:28:00,019 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:28:00,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:28:00,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541128806] [2024-11-16 12:28:00,771 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 12:28:00,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188309343] [2024-11-16 12:28:00,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188309343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:28:00,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 12:28:00,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-16 12:28:00,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602735098] [2024-11-16 12:28:00,772 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 12:28:00,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 12:28:00,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:28:00,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 12:28:00,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-16 12:28:00,773 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-16 12:28:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:28:02,073 INFO L93 Difference]: Finished difference Result 286 states and 401 transitions. [2024-11-16 12:28:02,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-16 12:28:02,074 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 144 [2024-11-16 12:28:02,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:28:02,075 INFO L225 Difference]: With dead ends: 286 [2024-11-16 12:28:02,075 INFO L226 Difference]: Without dead ends: 198 [2024-11-16 12:28:02,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2024-11-16 12:28:02,077 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 338 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 12:28:02,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 353 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 12:28:02,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-16 12:28:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 183. [2024-11-16 12:28:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 126 states have (on average 1.2619047619047619) internal successors, (159), 128 states have internal predecessors, (159), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 12:28:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 255 transitions. [2024-11-16 12:28:02,106 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 255 transitions. Word has length 144 [2024-11-16 12:28:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:28:02,106 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 255 transitions. [2024-11-16 12:28:02,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.6) internal successors, (46), 9 states have internal predecessors, (46), 3 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-11-16 12:28:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 255 transitions. [2024-11-16 12:28:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 12:28:02,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:28:02,108 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:28:02,122 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-16 12:28:02,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:28:02,309 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:28:02,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:28:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1502318005, now seen corresponding path program 1 times [2024-11-16 12:28:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:28:02,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584690730] [2024-11-16 12:28:02,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:28:02,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:28:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:28:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:28:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:28:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:28:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:28:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:28:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:28:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:28:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:28:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:28:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:28:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:28:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:28:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:28:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:28:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 12:28:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:28:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 12:28:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:28:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:28:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 12:28:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 12:28:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-16 12:28:13,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:28:13,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584690730] [2024-11-16 12:28:13,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584690730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:28:13,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:28:13,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:28:13,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896188895] [2024-11-16 12:28:13,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:28:13,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:28:13,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:28:13,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:28:13,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:28:13,365 INFO L87 Difference]: Start difference. First operand 183 states and 255 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:28:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:28:18,333 INFO L93 Difference]: Finished difference Result 452 states and 624 transitions. [2024-11-16 12:28:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 12:28:18,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-16 12:28:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:28:18,338 INFO L225 Difference]: With dead ends: 452 [2024-11-16 12:28:18,338 INFO L226 Difference]: Without dead ends: 280 [2024-11-16 12:28:18,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:28:18,339 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 274 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 12:28:18,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 362 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 12:28:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-16 12:28:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 196. [2024-11-16 12:28:18,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 139 states have (on average 1.2733812949640289) internal successors, (177), 141 states have internal predecessors, (177), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 12:28:18,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 273 transitions. [2024-11-16 12:28:18,378 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 273 transitions. Word has length 145 [2024-11-16 12:28:18,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:28:18,379 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 273 transitions. [2024-11-16 12:28:18,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-16 12:28:18,379 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 273 transitions. [2024-11-16 12:28:18,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-16 12:28:18,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:28:18,380 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:28:18,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:28:18,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:28:18,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:28:18,381 INFO L85 PathProgramCache]: Analyzing trace with hash -2007876630, now seen corresponding path program 1 times [2024-11-16 12:28:18,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:28:18,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935405385] [2024-11-16 12:28:18,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:28:18,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:28:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:28:18,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1091029013] [2024-11-16 12:28:18,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:28:18,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:28:18,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:28:18,427 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:28:18,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 12:28:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:28:18,706 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:28:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:28:18,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:28:18,805 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:28:18,807 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:28:18,816 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-16 12:28:19,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:28:19,016 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 12:28:19,090 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:28:19,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:28:19 BoogieIcfgContainer [2024-11-16 12:28:19,095 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:28:19,096 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:28:19,096 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:28:19,096 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:28:19,096 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:27:47" (3/4) ... [2024-11-16 12:28:19,099 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:28:19,100 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:28:19,100 INFO L158 Benchmark]: Toolchain (without parser) took 32908.20ms. Allocated memory was 159.4MB in the beginning and 448.8MB in the end (delta: 289.4MB). Free memory was 86.4MB in the beginning and 380.2MB in the end (delta: -293.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:28:19,100 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:28:19,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 330.32ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 70.1MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 12:28:19,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.17ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 70.1MB in the beginning and 167.5MB in the end (delta: -97.4MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2024-11-16 12:28:19,102 INFO L158 Benchmark]: Boogie Preprocessor took 50.65ms. Allocated memory is still 199.2MB. Free memory was 167.4MB in the beginning and 161.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 12:28:19,102 INFO L158 Benchmark]: IcfgBuilder took 525.47ms. Allocated memory is still 199.2MB. Free memory was 161.2MB in the beginning and 132.8MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-16 12:28:19,103 INFO L158 Benchmark]: TraceAbstraction took 31905.15ms. Allocated memory was 199.2MB in the beginning and 448.8MB in the end (delta: 249.6MB). Free memory was 131.8MB in the beginning and 380.2MB in the end (delta: -248.4MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. [2024-11-16 12:28:19,103 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 448.8MB. Free memory is still 380.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:28:19,104 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 159.4MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 330.32ms. Allocated memory is still 159.4MB. Free memory was 86.3MB in the beginning and 70.1MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.17ms. Allocated memory was 159.4MB in the beginning and 199.2MB in the end (delta: 39.8MB). Free memory was 70.1MB in the beginning and 167.5MB in the end (delta: -97.4MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.65ms. Allocated memory is still 199.2MB. Free memory was 167.4MB in the beginning and 161.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 525.47ms. Allocated memory is still 199.2MB. Free memory was 161.2MB in the beginning and 132.8MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 31905.15ms. Allocated memory was 199.2MB in the beginning and 448.8MB in the end (delta: 249.6MB). Free memory was 131.8MB in the beginning and 380.2MB in the end (delta: -248.4MB). Peak memory consumption was 1.1MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 448.8MB. Free memory is still 380.2MB. 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 128, overapproximation of someBinaryDOUBLEComparisonOperation at line 128. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 128; [L26] unsigned char var_1_5 = 10; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 52077; [L29] unsigned short int var_1_8 = 47248; [L30] unsigned short int var_1_9 = 50; [L31] float var_1_10 = 999.2; [L32] float var_1_11 = 63.75; [L33] signed long int var_1_12 = 100000; [L34] unsigned short int var_1_13 = 8; [L35] signed long int var_1_14 = 2; [L36] signed long int var_1_15 = 32; [L37] unsigned short int var_1_16 = 64; [L38] double var_1_17 = 127.5; [L39] double var_1_18 = 32.75; [L40] signed char var_1_19 = 0; [L41] unsigned long int var_1_20 = 128; VAL [isInitial=0, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L132] isInitial = 1 [L133] FCALL initially() [L134] COND TRUE 1 [L135] FCALL updateLastVariables() [L136] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L91] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L92] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L92] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L93] var_1_3 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L94] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L95] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L95] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L97] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L98] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L99] var_1_5 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L101] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L102] var_1_7 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L103] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L104] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L105] var_1_8 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_8 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L106] RET assume_abort_if_not(var_1_8 >= 32767) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L107] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L107] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L108] var_1_10 = __VERIFIER_nondet_float() [L109] 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, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L109] 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, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L110] var_1_11 = __VERIFIER_nondet_float() [L111] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L111] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L112] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L112] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L113] var_1_14 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L114] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L115] CALL assume_abort_if_not(var_1_14 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L115] RET assume_abort_if_not(var_1_14 <= 32) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L116] var_1_15 = __VERIFIER_nondet_long() [L117] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L117] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L118] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L118] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L119] var_1_16 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L120] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L121] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L121] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L122] var_1_18 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L123] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L136] RET updateVariables() [L137] CALL step() [L45] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L46] COND TRUE var_1_2 && stepLocal_0 [L47] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L51] COND FALSE !(var_1_1 <= (var_1_5 * var_1_4)) [L58] var_1_6 = var_1_5 VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L60] COND FALSE !(-100000 >= var_1_1) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L63] COND FALSE !((var_1_10 / var_1_11) == 999999.6f) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L67] COND TRUE var_1_6 < var_1_1 VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L68] COND FALSE !(var_1_5 == (~ (var_1_6 + var_1_1))) [L71] var_1_12 = ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8))) VAL [isInitial=1, var_1_12=127, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L76] EXPR -4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, var_1_12=127, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L76] EXPR var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))) VAL [isInitial=1, var_1_12=127, var_1_13=8, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L76] COND FALSE !((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))))) [L83] var_1_13 = var_1_16 VAL [isInitial=1, var_1_12=127, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=127, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L85] var_1_17 = var_1_18 [L86] var_1_19 = 5 [L87] var_1_20 = var_1_15 VAL [isInitial=1, var_1_12=127, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L137] RET step() [L138] CALL, EXPR property() [L128] EXPR (((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= var_1_1) ? (var_1_9 == ((unsigned short int) (((((var_1_1 + var_1_5)) > (64)) ? ((var_1_1 + var_1_5)) : (64))))) : (((var_1_10 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_6 < var_1_1) ? ((var_1_5 == (~ (var_1_6 + var_1_1))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_6)) ? (-1) : (var_1_6))))) ? (var_1_5) : (((((-1) < (var_1_6)) ? (-1) : (var_1_6)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_9)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_1)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_16))) VAL [isInitial=1, var_1_12=127, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L128-L129] return ((((((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= var_1_1) ? (var_1_9 == ((unsigned short int) (((((var_1_1 + var_1_5)) > (64)) ? ((var_1_1 + var_1_5)) : (64))))) : (((var_1_10 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_6 < var_1_1) ? ((var_1_5 == (~ (var_1_6 + var_1_1))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_6)) ? (-1) : (var_1_6))))) ? (var_1_5) : (((((-1) < (var_1_6)) ? (-1) : (var_1_6)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_9)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_1)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_16)))) && (var_1_17 == ((double) var_1_18))) && (var_1_19 == ((signed char) 5))) && (var_1_20 == ((unsigned long int) var_1_15)) ; [L138] RET, EXPR property() [L138] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=127, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L19] reach_error() VAL [isInitial=1, var_1_12=127, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=127, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=-385, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.8s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 839 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 830 mSDsluCounter, 1230 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 796 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 939 IncrementalHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 434 mSDtfsCounter, 939 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 364 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=4, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 171 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 21.8s InterpolantComputationTime, 1010 NumberOfCodeBlocks, 1010 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 572 ConstructedInterpolants, 0 QuantifiedInterpolants, 4644 SizeOfPredicates, 4 NumberOfNonLiveVariables, 326 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 3600/3696 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 12:28:19,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.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 7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:28:20,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:28:21,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:28:21,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:28:21,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:28:21,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:28:21,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:28:21,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:28:21,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:28:21,047 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:28:21,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:28:21,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:28:21,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:28:21,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:28:21,049 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:28:21,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:28:21,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:28:21,049 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:28:21,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:28:21,050 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:28:21,050 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:28:21,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:28:21,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:28:21,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:28:21,053 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:28:21,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:28:21,053 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:28:21,053 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:28:21,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:28:21,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:28:21,054 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:28:21,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:28:21,054 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:28:21,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:28:21,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:28:21,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:28:21,055 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:28:21,057 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:28:21,057 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:28:21,057 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:28:21,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:28:21,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:28:21,058 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:28:21,058 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:28:21,058 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 -> 7524697c66e1a4ecd762521f8a604e650820f18fffb82d104752941738ae4cd5 [2024-11-16 12:28:21,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:28:21,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:28:21,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:28:21,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:28:21,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:28:21,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i [2024-11-16 12:28:22,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:28:22,893 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:28:22,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-46.i [2024-11-16 12:28:22,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdaed4ffa/fdc4f5531efc435d93b8f104b74546a1/FLAGa33ed6836 [2024-11-16 12:28:22,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdaed4ffa/fdc4f5531efc435d93b8f104b74546a1 [2024-11-16 12:28:22,922 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:28:22,924 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:28:22,925 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:28:22,925 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:28:22,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:28:22,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:28:22" (1/1) ... [2024-11-16 12:28:22,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bd69e38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:22, skipping insertion in model container [2024-11-16 12:28:22,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:28:22" (1/1) ... [2024-11-16 12:28:22,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:28:23,110 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_codestructure_steplocals_file-46.i[917,930] [2024-11-16 12:28:23,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:28:23,182 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:28:23,195 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_codestructure_steplocals_file-46.i[917,930] [2024-11-16 12:28:23,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:28:23,245 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:28:23,245 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23 WrapperNode [2024-11-16 12:28:23,245 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:28:23,246 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:28:23,246 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:28:23,246 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:28:23,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (1/1) ... [2024-11-16 12:28:23,262 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (1/1) ... [2024-11-16 12:28:23,289 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-11-16 12:28:23,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:28:23,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:28:23,291 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:28:23,291 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:28:23,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (1/1) ... [2024-11-16 12:28:23,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (1/1) ... [2024-11-16 12:28:23,312 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (1/1) ... [2024-11-16 12:28:23,325 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:28:23,329 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (1/1) ... [2024-11-16 12:28:23,329 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (1/1) ... [2024-11-16 12:28:23,340 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (1/1) ... [2024-11-16 12:28:23,341 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (1/1) ... [2024-11-16 12:28:23,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (1/1) ... [2024-11-16 12:28:23,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (1/1) ... [2024-11-16 12:28:23,351 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:28:23,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:28:23,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:28:23,352 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:28:23,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (1/1) ... [2024-11-16 12:28:23,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:28:23,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:28:23,379 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:28:23,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:28:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:28:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:28:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:28:23,412 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:28:23,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:28:23,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:28:23,482 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:28:23,485 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:28:25,789 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-16 12:28:25,789 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:28:25,804 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:28:25,804 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:28:25,805 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:28:25 BoogieIcfgContainer [2024-11-16 12:28:25,805 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:28:25,808 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:28:25,808 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:28:25,811 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:28:25,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:28:22" (1/3) ... [2024-11-16 12:28:25,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195866aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:28:25, skipping insertion in model container [2024-11-16 12:28:25,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:28:23" (2/3) ... [2024-11-16 12:28:25,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195866aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:28:25, skipping insertion in model container [2024-11-16 12:28:25,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:28:25" (3/3) ... [2024-11-16 12:28:25,812 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-46.i [2024-11-16 12:28:25,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:28:25,832 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:28:25,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:28:25,902 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;@2402cb7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:28:25,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:28:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 12:28:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 12:28:25,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:28:25,922 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:28:25,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:28:25,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:28:25,927 INFO L85 PathProgramCache]: Analyzing trace with hash -366279617, now seen corresponding path program 1 times [2024-11-16 12:28:25,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:28:25,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724676253] [2024-11-16 12:28:25,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:28:25,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:28:25,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:28:25,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:28:25,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 12:28:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:26,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:28:26,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:28:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2024-11-16 12:28:26,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:28:26,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:28:26,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724676253] [2024-11-16 12:28:26,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724676253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:28:26,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:28:26,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:28:26,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458670069] [2024-11-16 12:28:26,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:28:26,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:28:26,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:28:26,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:28:26,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:28:26,313 INFO L87 Difference]: Start difference. First operand has 66 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 42 states have internal predecessors, (55), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 12:28:26,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:28:26,342 INFO L93 Difference]: Finished difference Result 123 states and 211 transitions. [2024-11-16 12:28:26,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:28:26,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 139 [2024-11-16 12:28:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:28:26,349 INFO L225 Difference]: With dead ends: 123 [2024-11-16 12:28:26,350 INFO L226 Difference]: Without dead ends: 60 [2024-11-16 12:28:26,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:28:26,355 INFO L432 NwaCegarLoop]: 86 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, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:28:26,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:28:26,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-16 12:28:26,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-16 12:28:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-16 12:28:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 86 transitions. [2024-11-16 12:28:26,387 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 86 transitions. Word has length 139 [2024-11-16 12:28:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:28:26,388 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 86 transitions. [2024-11-16 12:28:26,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-16 12:28:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 86 transitions. [2024-11-16 12:28:26,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 12:28:26,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:28:26,393 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:28:26,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:28:26,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:28:26,595 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:28:26,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:28:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1362139012, now seen corresponding path program 1 times [2024-11-16 12:28:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:28:26,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2130637572] [2024-11-16 12:28:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:28:26,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:28:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:28:26,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:28:26,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 12:28:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:28:26,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 12:28:26,891 INFO L278 TraceCheckSpWp]: Computing forward predicates...