./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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_floatingpointinfluence_no-floats_file-79.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 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:11:26,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:11:26,248 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:11:26,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:11:26,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:11:26,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:11:26,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:11:26,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:11:26,281 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:11:26,282 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:11:26,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:11:26,283 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:11:26,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:11:26,284 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:11:26,284 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:11:26,285 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:11:26,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:11:26,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:11:26,286 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:11:26,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:11:26,286 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:11:26,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:11:26,287 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:11:26,287 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:11:26,287 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:11:26,287 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:11:26,287 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:11:26,288 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:11:26,288 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:11:26,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:11:26,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:11:26,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:11:26,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:11:26,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:11:26,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:11:26,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:11:26,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:11:26,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:11:26,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:11:26,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:11:26,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:11:26,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:11:26,291 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 -> 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 [2024-11-22 10:11:26,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:11:26,487 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:11:26,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:11:26,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:11:26,491 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:11:26,492 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-22 10:11:27,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:11:28,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:11:28,003 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-22 10:11:28,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea2ddf4a/35ec7c1a353347318f3bfcccf74bf0b6/FLAG852a243e3 [2024-11-22 10:11:28,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ea2ddf4a/35ec7c1a353347318f3bfcccf74bf0b6 [2024-11-22 10:11:28,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:11:28,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:11:28,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:11:28,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:11:28,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:11:28,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b53b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28, skipping insertion in model container [2024-11-22 10:11:28,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:11:28,557 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_floatingpointinfluence_no-floats_file-79.i[916,929] [2024-11-22 10:11:28,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:11:28,592 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:11:28,622 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_floatingpointinfluence_no-floats_file-79.i[916,929] [2024-11-22 10:11:28,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:11:28,673 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:11:28,673 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28 WrapperNode [2024-11-22 10:11:28,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:11:28,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:11:28,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:11:28,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:11:28,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,687 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,706 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-11-22 10:11:28,706 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:11:28,707 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:11:28,707 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:11:28,707 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:11:28,716 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,729 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-22 10:11:28,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,734 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,742 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:11:28,749 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:11:28,749 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:11:28,749 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:11:28,750 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (1/1) ... [2024-11-22 10:11:28,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:11:28,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:11:28,800 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-22 10:11:28,811 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-22 10:11:28,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:11:28,854 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:11:28,854 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:11:28,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:11:28,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:11:28,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:11:28,910 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:11:28,912 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:11:29,147 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-22 10:11:29,147 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:11:29,164 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:11:29,164 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:11:29,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:11:29 BoogieIcfgContainer [2024-11-22 10:11:29,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:11:29,170 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:11:29,170 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:11:29,177 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:11:29,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:11:28" (1/3) ... [2024-11-22 10:11:29,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395a0850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:11:29, skipping insertion in model container [2024-11-22 10:11:29,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:28" (2/3) ... [2024-11-22 10:11:29,178 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@395a0850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:11:29, skipping insertion in model container [2024-11-22 10:11:29,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:11:29" (3/3) ... [2024-11-22 10:11:29,183 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-22 10:11:29,209 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:11:29,209 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:11:29,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:11:29,272 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;@614affd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:11:29,272 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:11:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:11:29,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-22 10:11:29,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:29,287 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:29,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:29,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 911261099, now seen corresponding path program 1 times [2024-11-22 10:11:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:29,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002728070] [2024-11-22 10:11:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:29,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:29,540 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-22 10:11:29,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:11:29,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002728070] [2024-11-22 10:11:29,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002728070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:11:29,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972893728] [2024-11-22 10:11:29,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:29,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:11:29,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:11:29,548 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-22 10:11:29,549 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-22 10:11:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:29,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:11:29,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:11:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-11-22 10:11:29,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:11:29,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972893728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:29,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:11:29,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:11:29,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959218197] [2024-11-22 10:11:29,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:29,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:11:29,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:11:29,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:11:29,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:11:29,709 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 10:11:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:29,735 INFO L93 Difference]: Finished difference Result 103 states and 168 transitions. [2024-11-22 10:11:29,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:11:29,738 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 94 [2024-11-22 10:11:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:29,745 INFO L225 Difference]: With dead ends: 103 [2024-11-22 10:11:29,745 INFO L226 Difference]: Without dead ends: 51 [2024-11-22 10:11:29,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-22 10:11:29,750 INFO L432 NwaCegarLoop]: 73 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, 73 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-22 10:11:29,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:11:29,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-22 10:11:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-22 10:11:29,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:11:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 73 transitions. [2024-11-22 10:11:29,844 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 73 transitions. Word has length 94 [2024-11-22 10:11:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:29,849 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 73 transitions. [2024-11-22 10:11:29,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 10:11:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 73 transitions. [2024-11-22 10:11:29,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-22 10:11:29,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:29,854 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:29,861 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-22 10:11:30,054 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-22 10:11:30,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:30,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2103931797, now seen corresponding path program 1 times [2024-11-22 10:11:30,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:30,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916278573] [2024-11-22 10:11:30,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:30,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 10:11:30,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:11:30,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916278573] [2024-11-22 10:11:30,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916278573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:30,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:30,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:11:30,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176922456] [2024-11-22 10:11:30,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:30,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:11:30,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:11:30,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:11:30,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:11:30,442 INFO L87 Difference]: Start difference. First operand 51 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:30,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:30,537 INFO L93 Difference]: Finished difference Result 145 states and 209 transitions. [2024-11-22 10:11:30,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 10:11:30,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-11-22 10:11:30,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:30,541 INFO L225 Difference]: With dead ends: 145 [2024-11-22 10:11:30,541 INFO L226 Difference]: Without dead ends: 97 [2024-11-22 10:11:30,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:11:30,543 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:11:30,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 439 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:11:30,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-22 10:11:30,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 53. [2024-11-22 10:11:30,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 37 states have internal predecessors, (47), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:11:30,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-22 10:11:30,553 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 94 [2024-11-22 10:11:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:30,554 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-22 10:11:30,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-22 10:11:30,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-22 10:11:30,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:30,556 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:30,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:11:30,556 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:30,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:30,557 INFO L85 PathProgramCache]: Analyzing trace with hash 148363339, now seen corresponding path program 1 times [2024-11-22 10:11:30,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:30,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159202381] [2024-11-22 10:11:30,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:30,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:30,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:30,903 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 10:11:30,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:11:30,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159202381] [2024-11-22 10:11:30,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159202381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:30,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:30,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 10:11:30,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536752284] [2024-11-22 10:11:30,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:30,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 10:11:30,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:11:30,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 10:11:30,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:11:30,910 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:31,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:31,066 INFO L93 Difference]: Finished difference Result 149 states and 212 transitions. [2024-11-22 10:11:31,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 10:11:31,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-11-22 10:11:31,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:31,068 INFO L225 Difference]: With dead ends: 149 [2024-11-22 10:11:31,068 INFO L226 Difference]: Without dead ends: 99 [2024-11-22 10:11:31,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:11:31,070 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 67 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:11:31,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 390 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:11:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-22 10:11:31,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 51. [2024-11-22 10:11:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:11:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2024-11-22 10:11:31,080 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 95 [2024-11-22 10:11:31,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:31,081 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2024-11-22 10:11:31,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:31,081 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2024-11-22 10:11:31,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-22 10:11:31,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:31,082 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:31,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:11:31,083 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:31,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:31,083 INFO L85 PathProgramCache]: Analyzing trace with hash 502683334, now seen corresponding path program 1 times [2024-11-22 10:11:31,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:31,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563906512] [2024-11-22 10:11:31,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:31,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 10:11:31,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:11:31,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563906512] [2024-11-22 10:11:31,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563906512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:31,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:31,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:11:31,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118282280] [2024-11-22 10:11:31,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:31,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:11:31,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:11:31,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:11:31,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:11:31,539 INFO L87 Difference]: Start difference. First operand 51 states and 71 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:31,683 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2024-11-22 10:11:31,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:11:31,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 96 [2024-11-22 10:11:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:31,686 INFO L225 Difference]: With dead ends: 105 [2024-11-22 10:11:31,687 INFO L226 Difference]: Without dead ends: 57 [2024-11-22 10:11:31,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:11:31,689 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 73 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:11:31,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 134 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:11:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-22 10:11:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-11-22 10:11:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:11:31,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2024-11-22 10:11:31,705 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 96 [2024-11-22 10:11:31,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:31,706 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2024-11-22 10:11:31,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-11-22 10:11:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-22 10:11:31,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:31,708 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:31,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 10:11:31,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:31,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:31,711 INFO L85 PathProgramCache]: Analyzing trace with hash 294791846, now seen corresponding path program 1 times [2024-11-22 10:11:31,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:31,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628273389] [2024-11-22 10:11:31,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:31,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:11:31,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793895939] [2024-11-22 10:11:31,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:31,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:11:31,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:11:31,764 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-22 10:11:31,765 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-22 10:11:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:31,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 10:11:31,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:11:32,699 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 10:11:32,700 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:11:32,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:11:32,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628273389] [2024-11-22 10:11:32,701 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 10:11:32,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793895939] [2024-11-22 10:11:32,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793895939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:32,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:32,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 10:11:32,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752783042] [2024-11-22 10:11:32,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:32,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 10:11:32,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:11:32,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 10:11:32,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-22 10:11:32,703 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:33,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:33,100 INFO L93 Difference]: Finished difference Result 97 states and 120 transitions. [2024-11-22 10:11:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-22 10:11:33,101 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-11-22 10:11:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:33,102 INFO L225 Difference]: With dead ends: 97 [2024-11-22 10:11:33,102 INFO L226 Difference]: Without dead ends: 95 [2024-11-22 10:11:33,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-22 10:11:33,103 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 139 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:11:33,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 222 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:11:33,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-22 10:11:33,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2024-11-22 10:11:33,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 51 states have (on average 1.196078431372549) internal successors, (61), 51 states have internal predecessors, (61), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:11:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 89 transitions. [2024-11-22 10:11:33,111 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 89 transitions. Word has length 97 [2024-11-22 10:11:33,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:33,112 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 89 transitions. [2024-11-22 10:11:33,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:33,112 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 89 transitions. [2024-11-22 10:11:33,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 10:11:33,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:33,113 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:33,124 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-22 10:11:33,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:11:33,320 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:33,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash -2032362108, now seen corresponding path program 1 times [2024-11-22 10:11:33,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:33,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178482049] [2024-11-22 10:11:33,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:33,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:33,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:33,400 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 10:11:33,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:11:33,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178482049] [2024-11-22 10:11:33,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178482049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:33,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:33,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:11:33,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075583250] [2024-11-22 10:11:33,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:33,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:11:33,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:11:33,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:11:33,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:11:33,403 INFO L87 Difference]: Start difference. First operand 68 states and 89 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:33,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:33,429 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2024-11-22 10:11:33,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:11:33,429 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-22 10:11:33,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:33,430 INFO L225 Difference]: With dead ends: 151 [2024-11-22 10:11:33,430 INFO L226 Difference]: Without dead ends: 86 [2024-11-22 10:11:33,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:11:33,431 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 16 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:11:33,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 119 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:11:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-22 10:11:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2024-11-22 10:11:33,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.1967213114754098) internal successors, (73), 61 states have internal predecessors, (73), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:11:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 101 transitions. [2024-11-22 10:11:33,445 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 101 transitions. Word has length 98 [2024-11-22 10:11:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:33,446 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 101 transitions. [2024-11-22 10:11:33,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 101 transitions. [2024-11-22 10:11:33,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 10:11:33,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:33,449 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:33,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 10:11:33,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:33,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash -39747269, now seen corresponding path program 1 times [2024-11-22 10:11:33,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:33,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077922245] [2024-11-22 10:11:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:33,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:11:33,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1000166598] [2024-11-22 10:11:33,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:33,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:11:33,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:11:33,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:11:33,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 10:11:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:33,579 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-22 10:11:33,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:11:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-22 10:11:34,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:11:34,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:11:34,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077922245] [2024-11-22 10:11:34,349 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 10:11:34,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000166598] [2024-11-22 10:11:34,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000166598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:34,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:34,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-22 10:11:34,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238996021] [2024-11-22 10:11:34,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:34,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 10:11:34,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:11:34,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 10:11:34,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-22 10:11:34,351 INFO L87 Difference]: Start difference. First operand 78 states and 101 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 10:11:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:34,802 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2024-11-22 10:11:34,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-22 10:11:34,803 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 98 [2024-11-22 10:11:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:34,804 INFO L225 Difference]: With dead ends: 99 [2024-11-22 10:11:34,804 INFO L226 Difference]: Without dead ends: 97 [2024-11-22 10:11:34,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-11-22 10:11:34,805 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 133 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:11:34,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 246 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:11:34,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-22 10:11:34,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2024-11-22 10:11:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:11:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 103 transitions. [2024-11-22 10:11:34,819 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 103 transitions. Word has length 98 [2024-11-22 10:11:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:34,819 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 103 transitions. [2024-11-22 10:11:34,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 14 states have internal predecessors, (37), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 10:11:34,819 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 103 transitions. [2024-11-22 10:11:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 10:11:34,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:34,834 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:34,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 10:11:35,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:11:35,039 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:35,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1296140404, now seen corresponding path program 1 times [2024-11-22 10:11:35,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:35,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961213644] [2024-11-22 10:11:35,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:35,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:11:35,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694651701] [2024-11-22 10:11:35,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:35,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:11:35,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:11:35,074 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:11:35,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 10:11:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:35,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 10:11:35,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:11:35,980 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 10:11:35,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:11:35,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:11:35,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961213644] [2024-11-22 10:11:35,981 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 10:11:35,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694651701] [2024-11-22 10:11:35,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694651701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:35,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:35,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-22 10:11:35,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116480875] [2024-11-22 10:11:35,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:35,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 10:11:35,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:11:35,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 10:11:35,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-22 10:11:35,983 INFO L87 Difference]: Start difference. First operand 79 states and 103 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:36,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:36,612 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2024-11-22 10:11:36,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 10:11:36,612 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-22 10:11:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:36,617 INFO L225 Difference]: With dead ends: 120 [2024-11-22 10:11:36,618 INFO L226 Difference]: Without dead ends: 118 [2024-11-22 10:11:36,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2024-11-22 10:11:36,618 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 106 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 10:11:36,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 314 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 10:11:36,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-22 10:11:36,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 81. [2024-11-22 10:11:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:11:36,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2024-11-22 10:11:36,628 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 98 [2024-11-22 10:11:36,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:36,629 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2024-11-22 10:11:36,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2024-11-22 10:11:36,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 10:11:36,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:36,630 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:36,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 10:11:36,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:11:36,830 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:36,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:36,831 INFO L85 PathProgramCache]: Analyzing trace with hash 285023154, now seen corresponding path program 1 times [2024-11-22 10:11:36,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:36,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521354091] [2024-11-22 10:11:36,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:37,190 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 10:11:37,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:11:37,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521354091] [2024-11-22 10:11:37,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521354091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:37,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:37,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 10:11:37,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828370038] [2024-11-22 10:11:37,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:37,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:11:37,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:11:37,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:11:37,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:11:37,193 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:37,359 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2024-11-22 10:11:37,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:11:37,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-22 10:11:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:37,362 INFO L225 Difference]: With dead ends: 149 [2024-11-22 10:11:37,362 INFO L226 Difference]: Without dead ends: 147 [2024-11-22 10:11:37,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-22 10:11:37,363 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 79 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:11:37,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 443 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:11:37,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-22 10:11:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2024-11-22 10:11:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.18348623853211) internal successors, (129), 110 states have internal predecessors, (129), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:11:37,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 165 transitions. [2024-11-22 10:11:37,378 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 165 transitions. Word has length 98 [2024-11-22 10:11:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:37,378 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 165 transitions. [2024-11-22 10:11:37,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 165 transitions. [2024-11-22 10:11:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-22 10:11:37,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:37,381 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:37,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 10:11:37,381 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:37,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:37,382 INFO L85 PathProgramCache]: Analyzing trace with hash 307006281, now seen corresponding path program 1 times [2024-11-22 10:11:37,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:37,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044617691] [2024-11-22 10:11:37,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:37,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 10:11:37,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:11:37,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044617691] [2024-11-22 10:11:37,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044617691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:37,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:37,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:11:37,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367251431] [2024-11-22 10:11:37,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:37,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:11:37,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:11:37,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:11:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:11:37,443 INFO L87 Difference]: Start difference. First operand 131 states and 165 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:37,474 INFO L93 Difference]: Finished difference Result 277 states and 346 transitions. [2024-11-22 10:11:37,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:11:37,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-11-22 10:11:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:37,476 INFO L225 Difference]: With dead ends: 277 [2024-11-22 10:11:37,477 INFO L226 Difference]: Without dead ends: 149 [2024-11-22 10:11:37,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:11:37,477 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 15 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:11:37,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 141 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:11:37,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-22 10:11:37,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 131. [2024-11-22 10:11:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.1559633027522935) internal successors, (126), 110 states have internal predecessors, (126), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:11:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 162 transitions. [2024-11-22 10:11:37,489 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 162 transitions. Word has length 98 [2024-11-22 10:11:37,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:37,489 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 162 transitions. [2024-11-22 10:11:37,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:37,490 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 162 transitions. [2024-11-22 10:11:37,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-22 10:11:37,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:37,491 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:37,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 10:11:37,491 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:37,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:37,492 INFO L85 PathProgramCache]: Analyzing trace with hash 937286957, now seen corresponding path program 1 times [2024-11-22 10:11:37,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:37,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771765831] [2024-11-22 10:11:37,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:37,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:11:37,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53061032] [2024-11-22 10:11:37,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:37,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:11:37,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:11:37,535 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:11:37,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 10:11:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:37,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-22 10:11:37,597 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:11:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 228 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-22 10:11:38,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:11:38,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:11:38,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771765831] [2024-11-22 10:11:38,438 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 10:11:38,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53061032] [2024-11-22 10:11:38,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53061032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:38,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:38,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-22 10:11:38,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265668258] [2024-11-22 10:11:38,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:38,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 10:11:38,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:11:38,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 10:11:38,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-22 10:11:38,440 INFO L87 Difference]: Start difference. First operand 131 states and 162 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 10:11:39,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:39,166 INFO L93 Difference]: Finished difference Result 168 states and 199 transitions. [2024-11-22 10:11:39,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-22 10:11:39,167 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 99 [2024-11-22 10:11:39,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:39,168 INFO L225 Difference]: With dead ends: 168 [2024-11-22 10:11:39,168 INFO L226 Difference]: Without dead ends: 166 [2024-11-22 10:11:39,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-11-22 10:11:39,169 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 100 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 10:11:39,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 312 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 10:11:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-22 10:11:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 122. [2024-11-22 10:11:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 100 states have (on average 1.15) internal successors, (115), 101 states have internal predecessors, (115), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:11:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 151 transitions. [2024-11-22 10:11:39,197 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 151 transitions. Word has length 99 [2024-11-22 10:11:39,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:39,198 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 151 transitions. [2024-11-22 10:11:39,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 10:11:39,198 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 151 transitions. [2024-11-22 10:11:39,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-22 10:11:39,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:39,199 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:39,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 10:11:39,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-22 10:11:39,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:39,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:39,404 INFO L85 PathProgramCache]: Analyzing trace with hash -342576721, now seen corresponding path program 1 times [2024-11-22 10:11:39,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:39,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812948734] [2024-11-22 10:11:39,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:39,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 10:11:39,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:11:39,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812948734] [2024-11-22 10:11:39,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812948734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:39,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:39,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 10:11:39,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974698827] [2024-11-22 10:11:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:39,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 10:11:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:11:39,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 10:11:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:11:39,977 INFO L87 Difference]: Start difference. First operand 122 states and 151 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:40,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:40,184 INFO L93 Difference]: Finished difference Result 138 states and 169 transitions. [2024-11-22 10:11:40,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:11:40,184 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-11-22 10:11:40,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:40,185 INFO L225 Difference]: With dead ends: 138 [2024-11-22 10:11:40,186 INFO L226 Difference]: Without dead ends: 136 [2024-11-22 10:11:40,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-22 10:11:40,186 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 66 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:11:40,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 491 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:11:40,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-22 10:11:40,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2024-11-22 10:11:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 84 states have internal predecessors, (97), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-22 10:11:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2024-11-22 10:11:40,192 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 99 [2024-11-22 10:11:40,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:40,193 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2024-11-22 10:11:40,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2024-11-22 10:11:40,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-22 10:11:40,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:40,193 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:40,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 10:11:40,194 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:40,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:40,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1653714623, now seen corresponding path program 1 times [2024-11-22 10:11:40,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:11:40,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814106763] [2024-11-22 10:11:40,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:40,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:11:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 10:11:40,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [204453093] [2024-11-22 10:11:40,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:40,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:11:40,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:11:40,211 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 10:11:40,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 10:11:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:11:40,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 10:11:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:11:40,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 10:11:40,307 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 10:11:40,308 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:11:40,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 10:11:40,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:11:40,513 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 10:11:40,572 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:11:40,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:11:40 BoogieIcfgContainer [2024-11-22 10:11:40,574 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:11:40,575 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:11:40,575 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:11:40,575 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:11:40,575 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:11:29" (3/4) ... [2024-11-22 10:11:40,577 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 10:11:40,578 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:11:40,578 INFO L158 Benchmark]: Toolchain (without parser) took 12170.63ms. Allocated memory was 136.3MB in the beginning and 373.3MB in the end (delta: 237.0MB). Free memory was 65.2MB in the beginning and 187.8MB in the end (delta: -122.6MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB. [2024-11-22 10:11:40,578 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 136.3MB. Free memory was 98.0MB in the beginning and 97.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:11:40,578 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.02ms. Allocated memory was 136.3MB in the beginning and 207.6MB in the end (delta: 71.3MB). Free memory was 65.0MB in the beginning and 177.1MB in the end (delta: -112.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. [2024-11-22 10:11:40,579 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.90ms. Allocated memory is still 207.6MB. Free memory was 177.1MB in the beginning and 175.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:11:40,579 INFO L158 Benchmark]: Boogie Preprocessor took 41.30ms. Allocated memory is still 207.6MB. Free memory was 175.0MB in the beginning and 172.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:11:40,579 INFO L158 Benchmark]: RCFGBuilder took 415.89ms. Allocated memory is still 207.6MB. Free memory was 172.9MB in the beginning and 156.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 10:11:40,579 INFO L158 Benchmark]: TraceAbstraction took 11403.63ms. Allocated memory was 207.6MB in the beginning and 373.3MB in the end (delta: 165.7MB). Free memory was 155.1MB in the beginning and 188.8MB in the end (delta: -33.8MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. [2024-11-22 10:11:40,579 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 373.3MB. Free memory was 188.8MB in the beginning and 187.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 10:11:40,580 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 136.3MB. Free memory was 98.0MB in the beginning and 97.9MB in the end (delta: 160.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.02ms. Allocated memory was 136.3MB in the beginning and 207.6MB in the end (delta: 71.3MB). Free memory was 65.0MB in the beginning and 177.1MB in the end (delta: -112.1MB). Peak memory consumption was 22.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.90ms. Allocated memory is still 207.6MB. Free memory was 177.1MB in the beginning and 175.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.30ms. Allocated memory is still 207.6MB. Free memory was 175.0MB in the beginning and 172.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 415.89ms. Allocated memory is still 207.6MB. Free memory was 172.9MB in the beginning and 156.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11403.63ms. Allocated memory was 207.6MB in the beginning and 373.3MB in the end (delta: 165.7MB). Free memory was 155.1MB in the beginning and 188.8MB in the end (delta: -33.8MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 373.3MB. Free memory was 188.8MB in the beginning and 187.8MB 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 shiftRight at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -16; [L23] signed char var_1_3 = 0; [L24] signed char var_1_4 = 64; [L25] signed char var_1_5 = 64; [L26] signed long int var_1_6 = -64; [L27] signed long int var_1_8 = 32; [L28] signed long int var_1_9 = 1; [L29] unsigned short int var_1_10 = 32; [L30] signed long int var_1_11 = 15; [L31] unsigned char var_1_12 = 0; [L32] unsigned char var_1_13 = 0; [L33] unsigned short int last_1_var_1_10 = 32; VAL [isInitial=0, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] CALL updateLastVariables() [L88] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=0, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L65] var_1_3 = __VERIFIER_nondet_char() [L66] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L66] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L67] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L67] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=64, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L68] var_1_4 = __VERIFIER_nondet_char() [L69] CALL assume_abort_if_not(var_1_4 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L69] RET assume_abort_if_not(var_1_4 >= -1) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L70] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L70] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=64, var_1_6=-64, var_1_8=32, var_1_9=1] [L71] var_1_5 = __VERIFIER_nondet_char() [L72] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L72] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L73] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L73] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=32, var_1_9=1] [L74] var_1_8 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L75] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L76] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L76] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=1] [L77] var_1_9 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L78] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L79] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L79] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=15, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L80] var_1_11 = __VERIFIER_nondet_long() [L81] CALL assume_abort_if_not(var_1_11 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L81] RET assume_abort_if_not(var_1_11 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L82] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L82] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L83] var_1_13 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L84] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L85] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L85] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L99] RET updateVariables() [L100] CALL step() [L37] signed long int stepLocal_0 = (((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10)); VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L38] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_0=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=-64, var_1_8=-2147483648, var_1_9=-2147483648] [L38] COND FALSE !(stepLocal_0 <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) [L45] var_1_6 = var_1_5 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L47] signed long int stepLocal_1 = var_1_5 + var_1_6; VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L48] COND FALSE !(var_1_11 < var_1_9) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L55] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L56] COND TRUE ! var_1_12 VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=-16, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L57] COND TRUE ! var_1_12 [L58] var_1_1 = (var_1_3 + -32) VAL [isInitial=1, last_1_var_1_10=32, stepLocal_1=0, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L91] EXPR last_1_var_1_10 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L91] EXPR ((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5))) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L91-L92] return ((((! var_1_12) ? ((! var_1_12) ? (var_1_1 == ((signed char) (var_1_3 + -32))) : (var_1_1 == ((signed char) (var_1_4 - ((((var_1_5) < (16)) ? (var_1_5) : (16))))))) : 1) && ((((((var_1_5) > (last_1_var_1_10)) ? (var_1_5) : (last_1_var_1_10))) <= (var_1_4 * (last_1_var_1_10 >> var_1_3))) ? (((- var_1_8) >= var_1_9) ? (var_1_6 == ((signed long int) var_1_4)) : (var_1_6 == ((signed long int) var_1_5))) : (var_1_6 == ((signed long int) var_1_5)))) && ((var_1_11 < var_1_9) ? (((var_1_5 + var_1_6) <= (~ (var_1_6 % -32))) ? (var_1_10 == ((unsigned short int) var_1_5)) : (var_1_10 == ((unsigned short int) var_1_5))) : 1)) && (var_1_12 == ((unsigned char) var_1_13)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, var_1_10=32, var_1_11=-2147483648, var_1_12=0, var_1_13=0, var_1_1=0, var_1_3=32, var_1_4=-1, var_1_5=0, var_1_6=0, var_1_8=-2147483648, var_1_9=-2147483648] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 13, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 918 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 858 mSDsluCounter, 3324 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2448 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2630 IncrementalHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 876 mSDtfsCounter, 2630 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=131occurred in iteration=9, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 293 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1848 NumberOfCodeBlocks, 1848 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1245 ConstructedInterpolants, 2 QuantifiedInterpolants, 4422 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1144 ConjunctsInSsa, 115 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 4706/4732 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-22 10:11:40,612 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/current/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_floatingpointinfluence_no-floats_file-79.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 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:11:42,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:11:42,526 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 10:11:42,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:11:42,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:11:42,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:11:42,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:11:42,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:11:42,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:11:42,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:11:42,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:11:42,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:11:42,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:11:42,559 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:11:42,559 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:11:42,559 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:11:42,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:11:42,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:11:42,562 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:11:42,562 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:11:42,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:11:42,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:11:42,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:11:42,565 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 10:11:42,565 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 10:11:42,565 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:11:42,565 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 10:11:42,566 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:11:42,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:11:42,566 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:11:42,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:11:42,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:11:42,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:11:42,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:11:42,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:11:42,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:11:42,568 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:11:42,569 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:11:42,569 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 10:11:42,570 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 10:11:42,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:11:42,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:11:42,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:11:42,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:11:42,571 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 -> 434b16a64b06ae36ef836c68b9042912d6cf793be5a1688bb3a25d59d1194c23 [2024-11-22 10:11:42,824 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:11:42,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:11:42,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:11:42,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:11:42,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:11:42,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-22 10:11:44,174 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:11:44,335 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:11:44,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-22 10:11:44,342 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35853ab2/23176e1746e9494587ce4beada4b3be3/FLAG7c0ba31b3 [2024-11-22 10:11:44,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d35853ab2/23176e1746e9494587ce4beada4b3be3 [2024-11-22 10:11:44,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:11:44,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:11:44,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:11:44,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:11:44,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:11:44,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:11:44" (1/1) ... [2024-11-22 10:11:44,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4bfd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:44, skipping insertion in model container [2024-11-22 10:11:44,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:11:44" (1/1) ... [2024-11-22 10:11:44,760 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:11:44,888 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_floatingpointinfluence_no-floats_file-79.i[916,929] [2024-11-22 10:11:44,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:11:44,947 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:11:44,958 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_floatingpointinfluence_no-floats_file-79.i[916,929] [2024-11-22 10:11:44,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:11:45,002 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:11:45,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45 WrapperNode [2024-11-22 10:11:45,002 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:11:45,003 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:11:45,003 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:11:45,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:11:45,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (1/1) ... [2024-11-22 10:11:45,024 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (1/1) ... [2024-11-22 10:11:45,046 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 98 [2024-11-22 10:11:45,047 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:11:45,048 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:11:45,048 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:11:45,048 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:11:45,056 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (1/1) ... [2024-11-22 10:11:45,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (1/1) ... [2024-11-22 10:11:45,060 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (1/1) ... [2024-11-22 10:11:45,070 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-22 10:11:45,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (1/1) ... [2024-11-22 10:11:45,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (1/1) ... [2024-11-22 10:11:45,084 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (1/1) ... [2024-11-22 10:11:45,089 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (1/1) ... [2024-11-22 10:11:45,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (1/1) ... [2024-11-22 10:11:45,096 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (1/1) ... [2024-11-22 10:11:45,101 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:11:45,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:11:45,105 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:11:45,105 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:11:45,106 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (1/1) ... [2024-11-22 10:11:45,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:11:45,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:11:45,138 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-22 10:11:45,163 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-22 10:11:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:11:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 10:11:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:11:45,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:11:45,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:11:45,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:11:45,288 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:11:45,290 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:11:45,457 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-22 10:11:45,457 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:11:45,465 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:11:45,466 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:11:45,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:11:45 BoogieIcfgContainer [2024-11-22 10:11:45,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:11:45,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:11:45,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:11:45,472 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:11:45,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:11:44" (1/3) ... [2024-11-22 10:11:45,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41110f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:11:45, skipping insertion in model container [2024-11-22 10:11:45,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:11:45" (2/3) ... [2024-11-22 10:11:45,478 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41110f7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:11:45, skipping insertion in model container [2024-11-22 10:11:45,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:11:45" (3/3) ... [2024-11-22 10:11:45,479 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-79.i [2024-11-22 10:11:45,493 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:11:45,494 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:11:45,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:11:45,560 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;@48546535, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:11:45,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:11:45,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:11:45,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 10:11:45,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:45,577 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:45,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:45,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash 416337941, now seen corresponding path program 1 times [2024-11-22 10:11:45,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:11:45,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045642078] [2024-11-22 10:11:45,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:45,595 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-22 10:11:45,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:11:45,599 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-22 10:11:45,600 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-22 10:11:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:45,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:11:45,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:11:45,765 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 170 proven. 0 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-22 10:11:45,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:11:45,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:11:45,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045642078] [2024-11-22 10:11:45,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045642078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:45,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:45,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 10:11:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506761989] [2024-11-22 10:11:45,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:45,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:11:45,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:11:45,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:11:45,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:11:45,804 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 10:11:45,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:45,826 INFO L93 Difference]: Finished difference Result 89 states and 148 transitions. [2024-11-22 10:11:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:11:45,827 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2024-11-22 10:11:45,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:45,832 INFO L225 Difference]: With dead ends: 89 [2024-11-22 10:11:45,832 INFO L226 Difference]: Without dead ends: 44 [2024-11-22 10:11:45,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 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-22 10:11:45,836 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-22 10:11:45,837 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-22 10:11:45,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-22 10:11:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-22 10:11:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:11:45,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 63 transitions. [2024-11-22 10:11:45,865 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 63 transitions. Word has length 91 [2024-11-22 10:11:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:45,865 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 63 transitions. [2024-11-22 10:11:45,866 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-22 10:11:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 63 transitions. [2024-11-22 10:11:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-22 10:11:45,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:45,868 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:45,873 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-22 10:11:46,069 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-22 10:11:46,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:46,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:46,070 INFO L85 PathProgramCache]: Analyzing trace with hash 410614101, now seen corresponding path program 1 times [2024-11-22 10:11:46,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:11:46,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1138951342] [2024-11-22 10:11:46,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:46,071 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-22 10:11:46,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:11:46,076 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-22 10:11:46,076 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-22 10:11:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:46,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 10:11:46,201 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:11:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-22 10:11:46,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:11:46,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:11:46,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1138951342] [2024-11-22 10:11:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1138951342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:11:46,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:11:46,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 10:11:46,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573575857] [2024-11-22 10:11:46,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:11:46,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 10:11:46,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:11:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 10:11:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 10:11:46,324 INFO L87 Difference]: Start difference. First operand 44 states and 63 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:46,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:11:46,593 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2024-11-22 10:11:46,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:11:46,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-11-22 10:11:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:11:46,597 INFO L225 Difference]: With dead ends: 93 [2024-11-22 10:11:46,597 INFO L226 Difference]: Without dead ends: 52 [2024-11-22 10:11:46,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-22 10:11:46,599 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 67 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:11:46,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 96 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:11:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-22 10:11:46,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2024-11-22 10:11:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:11:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 64 transitions. [2024-11-22 10:11:46,615 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 64 transitions. Word has length 91 [2024-11-22 10:11:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:11:46,616 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 64 transitions. [2024-11-22 10:11:46,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:11:46,616 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 64 transitions. [2024-11-22 10:11:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 10:11:46,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:11:46,617 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:11:46,622 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-22 10:11:46,818 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-22 10:11:46,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:11:46,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:11:46,819 INFO L85 PathProgramCache]: Analyzing trace with hash -391425056, now seen corresponding path program 1 times [2024-11-22 10:11:46,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:11:46,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017285299] [2024-11-22 10:11:46,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:11:46,820 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-22 10:11:46,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:11:46,822 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-22 10:11:46,823 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-22 10:11:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:11:46,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 10:11:46,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:12:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-22 10:12:05,702 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:12:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 10:12:21,590 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:12:21,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017285299] [2024-11-22 10:12:21,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017285299] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 10:12:21,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:12:21,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 21 [2024-11-22 10:12:21,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435165930] [2024-11-22 10:12:21,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:21,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:12:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:12:21,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:12:21,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2024-11-22 10:12:21,592 INFO L87 Difference]: Start difference. First operand 48 states and 64 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:12:23,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-22 10:12:25,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-22 10:12:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:12:31,377 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2024-11-22 10:12:31,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:12:31,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-11-22 10:12:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:12:31,383 INFO L225 Difference]: With dead ends: 61 [2024-11-22 10:12:31,383 INFO L226 Difference]: Without dead ends: 59 [2024-11-22 10:12:31,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2024-11-22 10:12:31,384 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 19 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-22 10:12:31,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 267 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-22 10:12:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-22 10:12:31,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2024-11-22 10:12:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-22 10:12:31,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2024-11-22 10:12:31,407 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 92 [2024-11-22 10:12:31,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:12:31,408 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2024-11-22 10:12:31,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-11-22 10:12:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2024-11-22 10:12:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-22 10:12:31,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:12:31,415 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 10:12:31,425 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 (4)] Forceful destruction successful, exit code 0 [2024-11-22 10:12:31,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-22 10:12:31,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:12:31,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:12:31,621 INFO L85 PathProgramCache]: Analyzing trace with hash 78612323, now seen corresponding path program 1 times [2024-11-22 10:12:31,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:12:31,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [850411088] [2024-11-22 10:12:31,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:12:31,622 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-22 10:12:31,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:12:31,626 INFO L229 MonitoredProcess]: Starting monitored process 5 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-22 10:12:31,626 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 (5)] Waiting until timeout for monitored process [2024-11-22 10:12:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:12:31,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 10:12:31,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:12:42,204 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 165 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-22 10:12:42,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 10:12:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-22 10:12:51,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:12:51,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [850411088] [2024-11-22 10:12:51,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [850411088] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 10:12:51,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:12:51,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 23 [2024-11-22 10:12:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242349098] [2024-11-22 10:12:51,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:12:51,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:12:51,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:12:51,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:12:51,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-22 10:12:51,913 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14)