./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-13.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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_variablewrapping_normal_file-13.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 476382d18560c39f16aae727092b47108fdc1ae0e3eedbadcc67982af5d45e6d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:20:41,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:20:42,035 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 00:20:42,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:20:42,040 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:20:42,060 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:20:42,061 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:20:42,061 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:20:42,061 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:20:42,062 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:20:42,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:20:42,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:20:42,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:20:42,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:20:42,063 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:20:42,063 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:20:42,063 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:20:42,064 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:20:42,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 00:20:42,064 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:20:42,064 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:20:42,067 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:20:42,068 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:20:42,068 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:20:42,068 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:20:42,068 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:20:42,069 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:20:42,069 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:20:42,069 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:20:42,069 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:20:42,070 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:20:42,070 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:20:42,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:20:42,070 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:20:42,070 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:20:42,071 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:20:42,071 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 00:20:42,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 00:20:42,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:20:42,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:20:42,072 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:20:42,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:20:42,074 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 -> 476382d18560c39f16aae727092b47108fdc1ae0e3eedbadcc67982af5d45e6d [2024-11-19 00:20:42,343 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:20:42,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:20:42,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:20:42,369 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:20:42,369 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:20:42,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-13.i [2024-11-19 00:20:43,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:20:43,800 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:20:43,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-13.i [2024-11-19 00:20:43,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd199a9e/39142b8050d940c9b8fd5d1ddfa59b76/FLAG09d725a3f [2024-11-19 00:20:44,191 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcd199a9e/39142b8050d940c9b8fd5d1ddfa59b76 [2024-11-19 00:20:44,193 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:20:44,194 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:20:44,195 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:20:44,195 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:20:44,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:20:44,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4360fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44, skipping insertion in model container [2024-11-19 00:20:44,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,226 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:20:44,387 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_variablewrapping_normal_file-13.i[913,926] [2024-11-19 00:20:44,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:20:44,432 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:20:44,441 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_variablewrapping_normal_file-13.i[913,926] [2024-11-19 00:20:44,463 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:20:44,479 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:20:44,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44 WrapperNode [2024-11-19 00:20:44,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:20:44,481 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:20:44,481 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:20:44,481 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:20:44,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,523 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-11-19 00:20:44,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:20:44,524 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:20:44,524 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:20:44,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:20:44,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,536 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,549 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-19 00:20:44,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,574 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:20:44,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:20:44,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:20:44,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:20:44,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (1/1) ... [2024-11-19 00:20:44,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:20:44,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:20:44,618 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-19 00:20:44,623 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-19 00:20:44,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:20:44,674 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:20:44,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:20:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 00:20:44,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:20:44,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:20:44,762 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:20:44,764 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:20:45,010 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-19 00:20:45,010 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:20:45,020 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:20:45,021 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:20:45,021 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:20:45 BoogieIcfgContainer [2024-11-19 00:20:45,021 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:20:45,023 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:20:45,023 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:20:45,025 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:20:45,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:20:44" (1/3) ... [2024-11-19 00:20:45,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9bc595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:20:45, skipping insertion in model container [2024-11-19 00:20:45,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:44" (2/3) ... [2024-11-19 00:20:45,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9bc595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:20:45, skipping insertion in model container [2024-11-19 00:20:45,027 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:20:45" (3/3) ... [2024-11-19 00:20:45,028 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-13.i [2024-11-19 00:20:45,041 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:20:45,041 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:20:45,097 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:20:45,102 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;@2ea311f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:20:45,102 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:20:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:20:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:20:45,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:20:45,114 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:20:45,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:20:45,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:20:45,119 INFO L85 PathProgramCache]: Analyzing trace with hash 744628402, now seen corresponding path program 1 times [2024-11-19 00:20:45,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:20:45,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601129382] [2024-11-19 00:20:45,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:20:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:20:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:20:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-19 00:20:45,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:20:45,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601129382] [2024-11-19 00:20:45,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601129382] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 00:20:45,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123729991] [2024-11-19 00:20:45,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:20:45,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:20:45,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:20:45,365 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-19 00:20:45,366 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-19 00:20:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:20:45,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:20:45,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:20:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-19 00:20:45,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:20:45,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123729991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:20:45,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 00:20:45,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 00:20:45,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9499681] [2024-11-19 00:20:45,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:20:45,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:20:45,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:20:45,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:20:45,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:20:45,546 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:20:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:20:45,564 INFO L93 Difference]: Finished difference Result 91 states and 151 transitions. [2024-11-19 00:20:45,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:20:45,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-11-19 00:20:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:20:45,572 INFO L225 Difference]: With dead ends: 91 [2024-11-19 00:20:45,572 INFO L226 Difference]: Without dead ends: 45 [2024-11-19 00:20:45,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 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-19 00:20:45,578 INFO L432 NwaCegarLoop]: 63 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, 63 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-19 00:20:45,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:20:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-19 00:20:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-19 00:20:45,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:20:45,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-19 00:20:45,612 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 98 [2024-11-19 00:20:45,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:20:45,612 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-19 00:20:45,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:20:45,613 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2024-11-19 00:20:45,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:20:45,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:20:45,616 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:20:45,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 00:20:45,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 00:20:45,817 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:20:45,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:20:45,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1203141465, now seen corresponding path program 1 times [2024-11-19 00:20:45,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:20:45,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170513026] [2024-11-19 00:20:45,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:20:45,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:20:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:20:47,364 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:20:47,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:20:47,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170513026] [2024-11-19 00:20:47,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170513026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:20:47,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:20:47,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:20:47,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056561264] [2024-11-19 00:20:47,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:20:47,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:20:47,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:20:47,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:20:47,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:20:47,367 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:20:47,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:20:47,765 INFO L93 Difference]: Finished difference Result 118 states and 157 transitions. [2024-11-19 00:20:47,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:20:47,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-19 00:20:47,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:20:47,769 INFO L225 Difference]: With dead ends: 118 [2024-11-19 00:20:47,770 INFO L226 Difference]: Without dead ends: 116 [2024-11-19 00:20:47,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:20:47,772 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 103 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:20:47,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 495 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:20:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-19 00:20:47,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 92. [2024-11-19 00:20:47,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:20:47,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-11-19 00:20:47,800 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 99 [2024-11-19 00:20:47,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:20:47,801 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-11-19 00:20:47,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:20:47,802 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-11-19 00:20:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:20:47,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:20:47,803 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:20:47,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 00:20:47,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:20:47,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:20:47,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1204988507, now seen corresponding path program 1 times [2024-11-19 00:20:47,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:20:47,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137426111] [2024-11-19 00:20:47,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:20:47,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:20:47,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:20:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:20:48,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:20:48,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137426111] [2024-11-19 00:20:48,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137426111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:20:48,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:20:48,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:20:48,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626465565] [2024-11-19 00:20:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:20:48,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:20:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:20:48,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:20:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:20:48,680 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:20:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:20:49,048 INFO L93 Difference]: Finished difference Result 116 states and 155 transitions. [2024-11-19 00:20:49,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:20:49,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-19 00:20:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:20:49,051 INFO L225 Difference]: With dead ends: 116 [2024-11-19 00:20:49,051 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 00:20:49,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-19 00:20:49,053 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 93 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:20:49,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 555 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:20:49,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 00:20:49,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 92. [2024-11-19 00:20:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:20:49,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-11-19 00:20:49,073 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 99 [2024-11-19 00:20:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:20:49,073 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-11-19 00:20:49,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:20:49,073 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-11-19 00:20:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:20:49,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:20:49,075 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:20:49,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 00:20:49,075 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:20:49,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:20:49,075 INFO L85 PathProgramCache]: Analyzing trace with hash 393794839, now seen corresponding path program 1 times [2024-11-19 00:20:49,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:20:49,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250333921] [2024-11-19 00:20:49,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:20:49,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:20:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:20:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:20:49,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:20:49,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250333921] [2024-11-19 00:20:49,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250333921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:20:49,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:20:49,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:20:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438700256] [2024-11-19 00:20:49,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:20:49,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:20:49,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:20:49,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:20:49,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:20:49,944 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:20:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:20:50,163 INFO L93 Difference]: Finished difference Result 116 states and 155 transitions. [2024-11-19 00:20:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:20:50,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-19 00:20:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:20:50,166 INFO L225 Difference]: With dead ends: 116 [2024-11-19 00:20:50,167 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 00:20:50,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:20:50,169 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 99 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 00:20:50,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 428 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 00:20:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 00:20:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2024-11-19 00:20:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:20:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-11-19 00:20:50,177 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 99 [2024-11-19 00:20:50,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:20:50,178 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-11-19 00:20:50,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:20:50,178 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-11-19 00:20:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:20:50,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:20:50,179 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:20:50,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 00:20:50,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:20:50,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:20:50,180 INFO L85 PathProgramCache]: Analyzing trace with hash 395641881, now seen corresponding path program 1 times [2024-11-19 00:20:50,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:20:50,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137545886] [2024-11-19 00:20:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:20:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:20:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:20:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:20:50,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:20:50,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137545886] [2024-11-19 00:20:50,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137545886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:20:50,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:20:50,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 00:20:50,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002515795] [2024-11-19 00:20:50,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:20:50,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 00:20:50,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:20:50,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 00:20:50,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 00:20:50,911 INFO L87 Difference]: Start difference. First operand 95 states and 135 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:20:51,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:20:51,188 INFO L93 Difference]: Finished difference Result 114 states and 153 transitions. [2024-11-19 00:20:51,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 00:20:51,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-19 00:20:51,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:20:51,190 INFO L225 Difference]: With dead ends: 114 [2024-11-19 00:20:51,191 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 00:20:51,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-19 00:20:51,192 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 90 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:20:51,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 497 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:20:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 00:20:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2024-11-19 00:20:51,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 59 states have (on average 1.2033898305084745) internal successors, (71), 59 states have internal predecessors, (71), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-19 00:20:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-11-19 00:20:51,211 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 99 [2024-11-19 00:20:51,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:20:51,212 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-11-19 00:20:51,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:20:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-11-19 00:20:51,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:20:51,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:20:51,214 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:20:51,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 00:20:51,214 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:20:51,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:20:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1883199835, now seen corresponding path program 1 times [2024-11-19 00:20:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:20:51,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808880025] [2024-11-19 00:20:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:20:51,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:20:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:20:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:20:51,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:20:51,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808880025] [2024-11-19 00:20:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808880025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:20:51,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:20:51,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:20:51,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990199170] [2024-11-19 00:20:51,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:20:51,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:20:51,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:20:51,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:20:51,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:20:51,815 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:20:52,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:20:52,339 INFO L93 Difference]: Finished difference Result 195 states and 271 transitions. [2024-11-19 00:20:52,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:20:52,339 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-19 00:20:52,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:20:52,341 INFO L225 Difference]: With dead ends: 195 [2024-11-19 00:20:52,341 INFO L226 Difference]: Without dead ends: 193 [2024-11-19 00:20:52,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:20:52,342 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 155 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 00:20:52,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 550 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 00:20:52,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-19 00:20:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 178. [2024-11-19 00:20:52,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 113 states have internal predecessors, (136), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-19 00:20:52,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 256 transitions. [2024-11-19 00:20:52,366 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 256 transitions. Word has length 99 [2024-11-19 00:20:52,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:20:52,366 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 256 transitions. [2024-11-19 00:20:52,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:20:52,367 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 256 transitions. [2024-11-19 00:20:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:20:52,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:20:52,369 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:20:52,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 00:20:52,370 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:20:52,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:20:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1885046877, now seen corresponding path program 1 times [2024-11-19 00:20:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:20:52,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299824519] [2024-11-19 00:20:52,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:20:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:20:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:20:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:20:53,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 00:20:53,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299824519] [2024-11-19 00:20:53,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299824519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:20:53,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:20:53,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 00:20:53,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667156300] [2024-11-19 00:20:53,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:20:53,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 00:20:53,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 00:20:53,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 00:20:53,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 00:20:53,332 INFO L87 Difference]: Start difference. First operand 178 states and 256 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:20:54,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:20:54,093 INFO L93 Difference]: Finished difference Result 182 states and 258 transitions. [2024-11-19 00:20:54,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 00:20:54,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-19 00:20:54,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:20:54,095 INFO L225 Difference]: With dead ends: 182 [2024-11-19 00:20:54,095 INFO L226 Difference]: Without dead ends: 180 [2024-11-19 00:20:54,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-19 00:20:54,096 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 113 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:20:54,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 489 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 00:20:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-19 00:20:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2024-11-19 00:20:54,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 107 states have (on average 1.1962616822429906) internal successors, (128), 107 states have internal predecessors, (128), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-19 00:20:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 248 transitions. [2024-11-19 00:20:54,108 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 248 transitions. Word has length 99 [2024-11-19 00:20:54,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:20:54,108 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 248 transitions. [2024-11-19 00:20:54,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:20:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 248 transitions. [2024-11-19 00:20:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:20:54,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:20:54,110 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:20:54,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 00:20:54,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:20:54,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:20:54,111 INFO L85 PathProgramCache]: Analyzing trace with hash 810114455, now seen corresponding path program 1 times [2024-11-19 00:20:54,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 00:20:54,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893724336] [2024-11-19 00:20:54,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:20:54,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 00:20:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 00:20:54,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1918524093] [2024-11-19 00:20:54,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:20:54,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 00:20:54,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:20:54,137 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-19 00:20:54,138 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-19 00:20:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:20:54,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 00:20:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 00:20:54,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 00:20:54,262 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 00:20:54,262 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 00:20:54,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:20:54,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-19 00:20:54,467 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 00:20:54,520 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 00:20:54,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 12:20:54 BoogieIcfgContainer [2024-11-19 00:20:54,522 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 00:20:54,523 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 00:20:54,523 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 00:20:54,523 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 00:20:54,523 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:20:45" (3/4) ... [2024-11-19 00:20:54,526 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 00:20:54,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 00:20:54,527 INFO L158 Benchmark]: Toolchain (without parser) took 10333.27ms. Allocated memory was 163.6MB in the beginning and 362.8MB in the end (delta: 199.2MB). Free memory was 130.2MB in the beginning and 120.7MB in the end (delta: 9.4MB). Peak memory consumption was 208.5MB. Max. memory is 16.1GB. [2024-11-19 00:20:54,527 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory was 77.2MB in the beginning and 77.1MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 00:20:54,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.84ms. Allocated memory is still 163.6MB. Free memory was 130.2MB in the beginning and 115.6MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 00:20:54,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.19ms. Allocated memory is still 163.6MB. Free memory was 115.6MB in the beginning and 112.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:20:54,528 INFO L158 Benchmark]: Boogie Preprocessor took 53.76ms. Allocated memory is still 163.6MB. Free memory was 112.8MB in the beginning and 110.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:20:54,528 INFO L158 Benchmark]: RCFGBuilder took 442.66ms. Allocated memory is still 163.6MB. Free memory was 109.4MB in the beginning and 125.6MB in the end (delta: -16.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 00:20:54,529 INFO L158 Benchmark]: TraceAbstraction took 9499.64ms. Allocated memory was 163.6MB in the beginning and 362.8MB in the end (delta: 199.2MB). Free memory was 125.0MB in the beginning and 121.8MB in the end (delta: 3.2MB). Peak memory consumption was 203.6MB. Max. memory is 16.1GB. [2024-11-19 00:20:54,529 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 362.8MB. Free memory was 121.8MB in the beginning and 120.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 00:20:54,530 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.15ms. Allocated memory is still 104.9MB. Free memory was 77.2MB in the beginning and 77.1MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.84ms. Allocated memory is still 163.6MB. Free memory was 130.2MB in the beginning and 115.6MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.19ms. Allocated memory is still 163.6MB. Free memory was 115.6MB in the beginning and 112.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.76ms. Allocated memory is still 163.6MB. Free memory was 112.8MB in the beginning and 110.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 442.66ms. Allocated memory is still 163.6MB. Free memory was 109.4MB in the beginning and 125.6MB in the end (delta: -16.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9499.64ms. Allocated memory was 163.6MB in the beginning and 362.8MB in the end (delta: 199.2MB). Free memory was 125.0MB in the beginning and 121.8MB in the end (delta: 3.2MB). Peak memory consumption was 203.6MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 362.8MB. Free memory was 121.8MB in the beginning and 120.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 88. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 25; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_5 = 16; [L25] unsigned short int var_1_6 = 16; [L26] signed char var_1_7 = 4; [L27] unsigned short int var_1_8 = 2; [L28] signed char var_1_9 = 64; [L29] signed char var_1_10 = 0; [L30] unsigned char var_1_11 = 16; [L31] double var_1_12 = 128.4; [L32] double var_1_13 = 50.2; [L33] double var_1_14 = 3.8; [L34] double var_1_15 = 25.1; VAL [isInitial=0, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L92] isInitial = 1 [L93] FCALL initially() [L94] COND TRUE 1 [L95] FCALL updateLastVariables() [L96] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L62] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L62] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=16, var_1_7=4, var_1_8=2, var_1_9=64] [L63] var_1_6 = __VERIFIER_nondet_ushort() [L64] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L64] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L65] CALL assume_abort_if_not(var_1_6 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L65] RET assume_abort_if_not(var_1_6 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_7=4, var_1_8=2, var_1_9=64] [L66] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L66] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=4, var_1_8=2, var_1_9=64] [L67] var_1_7 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L68] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L69] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L69] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=64] [L70] var_1_9 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L71] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L72] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L72] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L73] var_1_10 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L74] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L75] CALL assume_abort_if_not(var_1_10 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L75] RET assume_abort_if_not(var_1_10 <= 64) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_12=642/5, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L76] var_1_12 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L77] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854776000e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_13=251/5, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L78] var_1_13 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L79] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_14=19/5, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L80] var_1_14 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L81] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_15=251/10, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L82] var_1_15 = __VERIFIER_nondet_double() [L83] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L83] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L96] RET updateVariables() [L97] CALL step() [L38] COND FALSE !(((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=25, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L41] COND TRUE \read(var_1_2) [L42] var_1_1 = ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=16, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L44] COND TRUE (var_1_1 == 16) || (var_1_11 < (10 / var_1_6)) [L45] var_1_5 = var_1_7 VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L49] unsigned char stepLocal_1 = var_1_11; [L50] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_1=16, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L51] COND TRUE stepLocal_0 || (var_1_11 >= var_1_11) VAL [isInitial=1, stepLocal_1=16, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=2, var_1_9=63] [L52] COND TRUE stepLocal_1 < ((var_1_9 - var_1_10) - 16) [L53] var_1_8 = ((((var_1_10) > (32)) ? (var_1_10) : (32))) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63] [L97] RET step() [L98] CALL, EXPR property() [L88-L89] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((((var_1_11) > (var_1_11)) ? (var_1_11) : (var_1_11))))) : 1) && (((var_1_1 == 16) || (var_1_11 < (10 / var_1_6))) ? (var_1_5 == ((signed char) var_1_7)) : (var_1_5 == ((signed char) 5)))) && ((var_1_2 || (var_1_11 >= var_1_11)) ? ((var_1_11 < ((var_1_9 - var_1_10) - 16)) ? (var_1_8 == ((unsigned short int) ((((var_1_10) > (32)) ? (var_1_10) : (32))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11))))))) && ((((var_1_12 - var_1_13) + var_1_14) <= (256.625 * ((((1.875) > (var_1_15)) ? (1.875) : (var_1_15))))) ? (var_1_11 == ((unsigned char) (((((5) < 0 ) ? -(5) : (5))) + 5))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63] [L98] RET, EXPR property() [L98] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63] [L19] reach_error() VAL [isInitial=1, var_1_10=30, var_1_11=16, var_1_1=16, var_1_2=1, var_1_5=-127, var_1_6=1, var_1_7=-127, var_1_8=32, var_1_9=63] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 8, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 653 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 653 mSDsluCounter, 3077 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2366 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1179 IncrementalHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 711 mSDtfsCounter, 1179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=6, InterpolantAutomatonStates: 58, 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, 7 MinimizatonAttempts, 108 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 988 NumberOfCodeBlocks, 988 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 782 ConstructedInterpolants, 0 QuantifiedInterpolants, 2599 SizeOfPredicates, 0 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 3332/3360 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-19 00:20:54,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-13.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 476382d18560c39f16aae727092b47108fdc1ae0e3eedbadcc67982af5d45e6d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 00:20:56,497 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 00:20:56,564 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 00:20:56,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 00:20:56,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 00:20:56,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 00:20:56,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 00:20:56,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 00:20:56,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 00:20:56,593 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 00:20:56,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 00:20:56,594 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 00:20:56,595 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 00:20:56,596 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 00:20:56,596 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 00:20:56,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 00:20:56,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 00:20:56,597 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 00:20:56,598 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 00:20:56,599 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 00:20:56,599 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 00:20:56,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 00:20:56,600 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 00:20:56,600 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 00:20:56,600 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 00:20:56,602 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 00:20:56,603 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 00:20:56,603 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 00:20:56,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 00:20:56,603 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 00:20:56,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 00:20:56,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 00:20:56,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 00:20:56,604 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 00:20:56,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:20:56,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 00:20:56,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 00:20:56,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 00:20:56,604 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 00:20:56,605 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 00:20:56,605 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 00:20:56,605 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 00:20:56,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 00:20:56,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 00:20:56,605 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 -> 476382d18560c39f16aae727092b47108fdc1ae0e3eedbadcc67982af5d45e6d [2024-11-19 00:20:56,884 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 00:20:56,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 00:20:56,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 00:20:56,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 00:20:56,910 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 00:20:56,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-13.i [2024-11-19 00:20:58,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 00:20:58,451 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 00:20:58,452 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-13.i [2024-11-19 00:20:58,464 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a725d5df5/fb3e18faa5eb4e3ea854d22cac23a90a/FLAGbb1744416 [2024-11-19 00:20:58,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a725d5df5/fb3e18faa5eb4e3ea854d22cac23a90a [2024-11-19 00:20:58,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 00:20:58,851 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 00:20:58,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 00:20:58,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 00:20:58,857 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 00:20:58,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:20:58" (1/1) ... [2024-11-19 00:20:58,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71dd0277 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:58, skipping insertion in model container [2024-11-19 00:20:58,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:20:58" (1/1) ... [2024-11-19 00:20:58,881 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 00:20:59,036 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_variablewrapping_normal_file-13.i[913,926] [2024-11-19 00:20:59,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:20:59,107 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 00:20:59,117 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_variablewrapping_normal_file-13.i[913,926] [2024-11-19 00:20:59,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 00:20:59,165 INFO L204 MainTranslator]: Completed translation [2024-11-19 00:20:59,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59 WrapperNode [2024-11-19 00:20:59,165 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 00:20:59,166 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 00:20:59,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 00:20:59,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 00:20:59,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (1/1) ... [2024-11-19 00:20:59,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (1/1) ... [2024-11-19 00:20:59,212 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2024-11-19 00:20:59,213 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 00:20:59,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 00:20:59,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 00:20:59,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 00:20:59,223 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (1/1) ... [2024-11-19 00:20:59,223 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (1/1) ... [2024-11-19 00:20:59,231 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (1/1) ... [2024-11-19 00:20:59,249 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-19 00:20:59,249 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (1/1) ... [2024-11-19 00:20:59,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (1/1) ... [2024-11-19 00:20:59,258 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (1/1) ... [2024-11-19 00:20:59,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (1/1) ... [2024-11-19 00:20:59,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (1/1) ... [2024-11-19 00:20:59,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (1/1) ... [2024-11-19 00:20:59,277 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 00:20:59,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 00:20:59,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 00:20:59,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 00:20:59,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (1/1) ... [2024-11-19 00:20:59,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 00:20:59,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 00:20:59,313 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-19 00:20:59,316 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-19 00:20:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 00:20:59,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 00:20:59,357 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 00:20:59,357 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 00:20:59,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 00:20:59,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 00:20:59,435 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 00:20:59,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 00:21:05,594 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-19 00:21:05,595 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 00:21:05,605 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 00:21:05,605 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 00:21:05,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:21:05 BoogieIcfgContainer [2024-11-19 00:21:05,606 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 00:21:05,609 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 00:21:05,609 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 00:21:05,612 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 00:21:05,613 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:20:58" (1/3) ... [2024-11-19 00:21:05,614 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49df8090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:21:05, skipping insertion in model container [2024-11-19 00:21:05,614 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:20:59" (2/3) ... [2024-11-19 00:21:05,615 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49df8090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:21:05, skipping insertion in model container [2024-11-19 00:21:05,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:21:05" (3/3) ... [2024-11-19 00:21:05,616 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-13.i [2024-11-19 00:21:05,631 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 00:21:05,631 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 00:21:05,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 00:21:05,689 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;@7587c133, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 00:21:05,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 00:21:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:21:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 00:21:05,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:05,703 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:21:05,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:05,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:05,709 INFO L85 PathProgramCache]: Analyzing trace with hash 744628402, now seen corresponding path program 1 times [2024-11-19 00:21:05,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:21:05,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487581193] [2024-11-19 00:21:05,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:05,722 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-19 00:21:05,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:21:05,725 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-19 00:21:05,726 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-19 00:21:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:06,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 00:21:06,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:21:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-19 00:21:06,078 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:21:06,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:21:06,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1487581193] [2024-11-19 00:21:06,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1487581193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:21:06,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:21:06,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 00:21:06,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382218430] [2024-11-19 00:21:06,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:21:06,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 00:21:06,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:21:06,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 00:21:06,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 00:21:06,106 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:21:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:21:06,129 INFO L93 Difference]: Finished difference Result 91 states and 151 transitions. [2024-11-19 00:21:06,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 00:21:06,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-11-19 00:21:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:21:06,139 INFO L225 Difference]: With dead ends: 91 [2024-11-19 00:21:06,140 INFO L226 Difference]: Without dead ends: 45 [2024-11-19 00:21:06,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 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-19 00:21:06,148 INFO L432 NwaCegarLoop]: 63 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, 63 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-19 00:21:06,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 00:21:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-19 00:21:06,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-19 00:21:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-19 00:21:06,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 63 transitions. [2024-11-19 00:21:06,202 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 63 transitions. Word has length 98 [2024-11-19 00:21:06,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:21:06,203 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 63 transitions. [2024-11-19 00:21:06,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-19 00:21:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 63 transitions. [2024-11-19 00:21:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:21:06,209 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:06,209 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:21:06,226 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-19 00:21:06,413 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-19 00:21:06,413 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:06,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:06,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1203141465, now seen corresponding path program 1 times [2024-11-19 00:21:06,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:21:06,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102525021] [2024-11-19 00:21:06,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:06,415 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-19 00:21:06,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:21:06,418 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-19 00:21:06,419 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-19 00:21:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:06,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:21:06,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 00:21:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-19 00:21:06,907 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 00:21:06,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 00:21:06,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102525021] [2024-11-19 00:21:06,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102525021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 00:21:06,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 00:21:06,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 00:21:06,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670188235] [2024-11-19 00:21:06,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 00:21:06,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 00:21:06,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 00:21:06,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 00:21:06,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:21:06,914 INFO L87 Difference]: Start difference. First operand 45 states and 63 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:21:09,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:21:10,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:21:13,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-19 00:21:13,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 00:21:13,142 INFO L93 Difference]: Finished difference Result 171 states and 243 transitions. [2024-11-19 00:21:13,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 00:21:13,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-19 00:21:13,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 00:21:13,164 INFO L225 Difference]: With dead ends: 171 [2024-11-19 00:21:13,165 INFO L226 Difference]: Without dead ends: 129 [2024-11-19 00:21:13,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 00:21:13,166 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 141 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-19 00:21:13,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 182 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-19 00:21:13,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-19 00:21:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2024-11-19 00:21:13,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 76 states have internal predecessors, (90), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 00:21:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 180 transitions. [2024-11-19 00:21:13,187 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 180 transitions. Word has length 99 [2024-11-19 00:21:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 00:21:13,188 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 180 transitions. [2024-11-19 00:21:13,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-19 00:21:13,188 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2024-11-19 00:21:13,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 00:21:13,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 00:21:13,189 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 00:21:13,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 00:21:13,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 00:21:13,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 00:21:13,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 00:21:13,391 INFO L85 PathProgramCache]: Analyzing trace with hash 393794839, now seen corresponding path program 1 times [2024-11-19 00:21:13,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 00:21:13,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186903218] [2024-11-19 00:21:13,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 00:21:13,391 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-19 00:21:13,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 00:21:13,394 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 00:21:13,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 00:21:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 00:21:13,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 00:21:13,669 INFO L278 TraceCheckSpWp]: Computing forward predicates...