./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.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 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 15:58:54,209 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 15:58:54,299 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 15:58:54,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 15:58:54,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 15:58:54,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 15:58:54,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 15:58:54,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 15:58:54,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 15:58:54,339 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 15:58:54,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 15:58:54,340 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 15:58:54,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 15:58:54,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 15:58:54,341 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 15:58:54,341 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 15:58:54,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 15:58:54,342 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 15:58:54,342 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 15:58:54,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 15:58:54,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 15:58:54,347 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 15:58:54,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 15:58:54,348 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 15:58:54,348 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 15:58:54,348 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 15:58:54,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 15:58:54,349 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 15:58:54,349 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 15:58:54,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 15:58:54,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 15:58:54,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 15:58:54,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:58:54,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 15:58:54,353 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 15:58:54,353 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 15:58:54,353 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 15:58:54,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 15:58:54,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 15:58:54,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 15:58:54,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 15:58:54,356 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 15:58:54,356 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2024-11-11 15:58:54,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 15:58:54,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 15:58:54,644 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 15:58:54,646 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 15:58:54,646 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 15:58:54,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-11-11 15:58:56,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 15:58:56,269 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 15:58:56,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-11-11 15:58:56,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cabd72e/ba597246564a4cbcb1249b2a06436047/FLAGf78731bca [2024-11-11 15:58:56,291 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9cabd72e/ba597246564a4cbcb1249b2a06436047 [2024-11-11 15:58:56,295 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 15:58:56,296 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 15:58:56,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 15:58:56,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 15:58:56,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 15:58:56,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@467fea54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56, skipping insertion in model container [2024-11-11 15:58:56,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,325 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 15:58:56,483 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/bitvector/byte_add_1-1.i[1168,1181] [2024-11-11 15:58:56,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:58:56,538 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 15:58:56,548 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/bitvector/byte_add_1-1.i[1168,1181] [2024-11-11 15:58:56,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:58:56,585 INFO L204 MainTranslator]: Completed translation [2024-11-11 15:58:56,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56 WrapperNode [2024-11-11 15:58:56,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 15:58:56,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 15:58:56,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 15:58:56,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 15:58:56,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,630 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 147 [2024-11-11 15:58:56,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 15:58:56,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 15:58:56,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 15:58:56,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 15:58:56,651 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,669 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-11 15:58:56,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 15:58:56,689 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 15:58:56,689 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 15:58:56,689 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 15:58:56,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (1/1) ... [2024-11-11 15:58:56,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:58:56,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:58:56,729 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-11 15:58:56,736 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-11 15:58:56,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 15:58:56,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 15:58:56,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 15:58:56,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 15:58:56,860 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 15:58:56,862 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 15:58:57,231 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-11 15:58:57,254 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 15:58:57,268 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 15:58:57,268 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 15:58:57,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:58:57 BoogieIcfgContainer [2024-11-11 15:58:57,269 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 15:58:57,272 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 15:58:57,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 15:58:57,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 15:58:57,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 03:58:56" (1/3) ... [2024-11-11 15:58:57,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cac776f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:58:57, skipping insertion in model container [2024-11-11 15:58:57,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:58:56" (2/3) ... [2024-11-11 15:58:57,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cac776f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:58:57, skipping insertion in model container [2024-11-11 15:58:57,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:58:57" (3/3) ... [2024-11-11 15:58:57,291 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2024-11-11 15:58:57,319 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 15:58:57,320 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 15:58:57,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 15:58:57,398 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;@4226f6c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 15:58:57,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 15:58:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 50 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:57,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 15:58:57,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:57,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:58:57,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:57,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1425856197, now seen corresponding path program 1 times [2024-11-11 15:58:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:57,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922221088] [2024-11-11 15:58:57,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:57,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:57,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:57,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:58:57,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:57,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922221088] [2024-11-11 15:58:57,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922221088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:57,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:57,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 15:58:57,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157543173] [2024-11-11 15:58:57,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:57,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 15:58:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:57,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 15:58:57,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 15:58:57,676 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.7551020408163265) internal successors, (86), 50 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:57,697 INFO L93 Difference]: Finished difference Result 75 states and 122 transitions. [2024-11-11 15:58:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 15:58:57,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-11 15:58:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:57,707 INFO L225 Difference]: With dead ends: 75 [2024-11-11 15:58:57,707 INFO L226 Difference]: Without dead ends: 47 [2024-11-11 15:58:57,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 15:58:57,713 INFO L435 NwaCegarLoop]: 83 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, 83 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-11 15:58:57,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:58:57,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-11 15:58:57,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-11 15:58:57,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 46 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 79 transitions. [2024-11-11 15:58:57,755 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 79 transitions. Word has length 15 [2024-11-11 15:58:57,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:57,756 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 79 transitions. [2024-11-11 15:58:57,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 79 transitions. [2024-11-11 15:58:57,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-11 15:58:57,757 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:57,757 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:58:57,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 15:58:57,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:57,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:57,759 INFO L85 PathProgramCache]: Analyzing trace with hash -518266215, now seen corresponding path program 1 times [2024-11-11 15:58:57,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:57,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639955392] [2024-11-11 15:58:57,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:57,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:57,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:58:57,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:57,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639955392] [2024-11-11 15:58:57,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639955392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:57,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:57,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 15:58:57,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179844526] [2024-11-11 15:58:57,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:57,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 15:58:57,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:57,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 15:58:57,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:58:57,979 INFO L87 Difference]: Start difference. First operand 47 states and 79 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:58,149 INFO L93 Difference]: Finished difference Result 107 states and 186 transitions. [2024-11-11 15:58:58,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 15:58:58,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-11 15:58:58,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:58,151 INFO L225 Difference]: With dead ends: 107 [2024-11-11 15:58:58,151 INFO L226 Difference]: Without dead ends: 70 [2024-11-11 15:58:58,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11 15:58:58,152 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 24 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:58,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 88 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:58:58,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-11 15:58:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-11 15:58:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 67 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 104 transitions. [2024-11-11 15:58:58,172 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 104 transitions. Word has length 15 [2024-11-11 15:58:58,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:58,172 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 104 transitions. [2024-11-11 15:58:58,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:58,173 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 104 transitions. [2024-11-11 15:58:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-11 15:58:58,175 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:58,175 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:58:58,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 15:58:58,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:58,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:58,178 INFO L85 PathProgramCache]: Analyzing trace with hash 458302340, now seen corresponding path program 1 times [2024-11-11 15:58:58,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:58,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491765805] [2024-11-11 15:58:58,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:58,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:58,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:58:58,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:58,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491765805] [2024-11-11 15:58:58,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491765805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:58,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:58,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:58:58,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146711810] [2024-11-11 15:58:58,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:58,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:58:58,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:58,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:58:58,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:58:58,392 INFO L87 Difference]: Start difference. First operand 68 states and 104 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:58,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:58,665 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2024-11-11 15:58:58,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 15:58:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-11 15:58:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:58,667 INFO L225 Difference]: With dead ends: 164 [2024-11-11 15:58:58,667 INFO L226 Difference]: Without dead ends: 127 [2024-11-11 15:58:58,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:58:58,669 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 92 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:58,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 116 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:58:58,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-11 15:58:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2024-11-11 15:58:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.5444444444444445) internal successors, (139), 90 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:58,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 139 transitions. [2024-11-11 15:58:58,680 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 139 transitions. Word has length 21 [2024-11-11 15:58:58,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:58,681 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 139 transitions. [2024-11-11 15:58:58,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:58,681 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 139 transitions. [2024-11-11 15:58:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-11 15:58:58,682 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:58,682 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:58:58,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 15:58:58,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:58,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:58,683 INFO L85 PathProgramCache]: Analyzing trace with hash 93424243, now seen corresponding path program 1 times [2024-11-11 15:58:58,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:58,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636230978] [2024-11-11 15:58:58,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:58,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 15:58:58,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:58,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636230978] [2024-11-11 15:58:58,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636230978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:58,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:58,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:58:58,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56751745] [2024-11-11 15:58:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:58,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:58:58,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:58:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:58:58,879 INFO L87 Difference]: Start difference. First operand 91 states and 139 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:59,037 INFO L93 Difference]: Finished difference Result 234 states and 354 transitions. [2024-11-11 15:58:59,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:58:59,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-11 15:58:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:59,039 INFO L225 Difference]: With dead ends: 234 [2024-11-11 15:58:59,039 INFO L226 Difference]: Without dead ends: 156 [2024-11-11 15:58:59,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:58:59,043 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 70 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:59,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 180 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:58:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-11 15:58:59,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 99. [2024-11-11 15:58:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.510204081632653) internal successors, (148), 98 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 148 transitions. [2024-11-11 15:58:59,066 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 148 transitions. Word has length 27 [2024-11-11 15:58:59,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:59,066 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 148 transitions. [2024-11-11 15:58:59,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,066 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 148 transitions. [2024-11-11 15:58:59,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 15:58:59,069 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:59,069 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:58:59,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 15:58:59,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:59,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash -302937854, now seen corresponding path program 1 times [2024-11-11 15:58:59,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:59,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068599190] [2024-11-11 15:58:59,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:59,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-11 15:58:59,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:59,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068599190] [2024-11-11 15:58:59,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068599190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:59,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:58:59,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:58:59,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814483388] [2024-11-11 15:58:59,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:59,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:58:59,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:59,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:58:59,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:58:59,227 INFO L87 Difference]: Start difference. First operand 99 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:59,387 INFO L93 Difference]: Finished difference Result 255 states and 380 transitions. [2024-11-11 15:58:59,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:58:59,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-11 15:58:59,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:59,389 INFO L225 Difference]: With dead ends: 255 [2024-11-11 15:58:59,390 INFO L226 Difference]: Without dead ends: 176 [2024-11-11 15:58:59,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:58:59,392 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 74 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:59,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:58:59,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-11 15:58:59,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 109. [2024-11-11 15:58:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.4907407407407407) internal successors, (161), 108 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-11 15:58:59,405 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 28 [2024-11-11 15:58:59,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:59,406 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-11 15:58:59,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-11 15:58:59,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 15:58:59,407 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:59,407 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:58:59,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 15:58:59,408 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:58:59,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:58:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1297586116, now seen corresponding path program 1 times [2024-11-11 15:58:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:58:59,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675292623] [2024-11-11 15:58:59,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:59,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:58:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:58:59,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:58:59,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675292623] [2024-11-11 15:58:59,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675292623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:58:59,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251914011] [2024-11-11 15:58:59,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:58:59,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:58:59,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:58:59,509 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-11 15:58:59,511 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-11 15:58:59,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:58:59,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 15:58:59,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:58:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 15:58:59,660 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:58:59,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251914011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:58:59,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 15:58:59,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-11-11 15:58:59,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018208987] [2024-11-11 15:58:59,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:58:59,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:58:59,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:58:59,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:58:59,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:58:59,664 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:58:59,849 INFO L93 Difference]: Finished difference Result 230 states and 363 transitions. [2024-11-11 15:58:59,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:58:59,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-11 15:58:59,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:58:59,851 INFO L225 Difference]: With dead ends: 230 [2024-11-11 15:58:59,851 INFO L226 Difference]: Without dead ends: 154 [2024-11-11 15:58:59,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:58:59,852 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 37 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:58:59,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 151 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:58:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-11 15:58:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 138. [2024-11-11 15:58:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.4306569343065694) internal successors, (196), 137 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 196 transitions. [2024-11-11 15:58:59,862 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 196 transitions. Word has length 29 [2024-11-11 15:58:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:58:59,862 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 196 transitions. [2024-11-11 15:58:59,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:58:59,863 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 196 transitions. [2024-11-11 15:58:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-11 15:58:59,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:58:59,864 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:58:59,883 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-11 15:59:00,068 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,SelfDestructingSolverStorable5 [2024-11-11 15:59:00,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:00,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1927695377, now seen corresponding path program 1 times [2024-11-11 15:59:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:00,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128710291] [2024-11-11 15:59:00,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:00,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:00,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:00,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:00,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128710291] [2024-11-11 15:59:00,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128710291] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:00,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633920861] [2024-11-11 15:59:00,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:00,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:00,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:00,230 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-11 15:59:00,233 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-11 15:59:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:00,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 15:59:00,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 15:59:00,364 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:00,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633920861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:00,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 15:59:00,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-11 15:59:00,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335548172] [2024-11-11 15:59:00,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:00,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:59:00,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:00,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:59:00,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:59:00,367 INFO L87 Difference]: Start difference. First operand 138 states and 196 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:00,538 INFO L93 Difference]: Finished difference Result 288 states and 427 transitions. [2024-11-11 15:59:00,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:59:00,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-11 15:59:00,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:00,540 INFO L225 Difference]: With dead ends: 288 [2024-11-11 15:59:00,540 INFO L226 Difference]: Without dead ends: 183 [2024-11-11 15:59:00,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:59:00,544 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 36 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:00,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 151 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:59:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-11 15:59:00,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161. [2024-11-11 15:59:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:00,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2024-11-11 15:59:00,559 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 35 [2024-11-11 15:59:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:00,560 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2024-11-11 15:59:00,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:00,560 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2024-11-11 15:59:00,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-11 15:59:00,561 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:00,561 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:59:00,577 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-11 15:59:00,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-11 15:59:00,766 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:00,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash -977713378, now seen corresponding path program 1 times [2024-11-11 15:59:00,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:00,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008717447] [2024-11-11 15:59:00,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:00,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 15:59:00,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:00,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008717447] [2024-11-11 15:59:00,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008717447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:00,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:00,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 15:59:00,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501975869] [2024-11-11 15:59:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:00,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 15:59:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:00,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 15:59:00,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:59:00,946 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:01,179 INFO L93 Difference]: Finished difference Result 516 states and 714 transitions. [2024-11-11 15:59:01,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 15:59:01,179 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-11 15:59:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:01,181 INFO L225 Difference]: With dead ends: 516 [2024-11-11 15:59:01,181 INFO L226 Difference]: Without dead ends: 385 [2024-11-11 15:59:01,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:59:01,183 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 152 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:01,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 307 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:59:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-11 15:59:01,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 161. [2024-11-11 15:59:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.39375) internal successors, (223), 160 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 223 transitions. [2024-11-11 15:59:01,205 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 223 transitions. Word has length 41 [2024-11-11 15:59:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:01,205 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 223 transitions. [2024-11-11 15:59:01,205 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 223 transitions. [2024-11-11 15:59:01,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-11 15:59:01,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:01,206 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:59:01,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 15:59:01,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:01,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:01,207 INFO L85 PathProgramCache]: Analyzing trace with hash 915767303, now seen corresponding path program 1 times [2024-11-11 15:59:01,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:01,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724324301] [2024-11-11 15:59:01,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:01,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 15:59:01,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:01,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724324301] [2024-11-11 15:59:01,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724324301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:01,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:01,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 15:59:01,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051784360] [2024-11-11 15:59:01,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:01,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 15:59:01,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:01,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 15:59:01,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:59:01,379 INFO L87 Difference]: Start difference. First operand 161 states and 223 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:01,391 INFO L93 Difference]: Finished difference Result 305 states and 420 transitions. [2024-11-11 15:59:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 15:59:01,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-11 15:59:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:01,394 INFO L225 Difference]: With dead ends: 305 [2024-11-11 15:59:01,394 INFO L226 Difference]: Without dead ends: 147 [2024-11-11 15:59:01,394 INFO L434 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-11 15:59:01,395 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 69 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:01,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 75 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:59:01,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-11 15:59:01,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-11 15:59:01,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.36986301369863) internal successors, (200), 146 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 200 transitions. [2024-11-11 15:59:01,404 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 200 transitions. Word has length 42 [2024-11-11 15:59:01,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:01,404 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 200 transitions. [2024-11-11 15:59:01,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,405 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 200 transitions. [2024-11-11 15:59:01,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 15:59:01,406 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:01,406 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 15:59:01,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 15:59:01,407 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:01,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:01,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1601810200, now seen corresponding path program 1 times [2024-11-11 15:59:01,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:01,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750220698] [2024-11-11 15:59:01,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:01,507 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 15:59:01,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:01,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750220698] [2024-11-11 15:59:01,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750220698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:01,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:01,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 15:59:01,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484397858] [2024-11-11 15:59:01,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:01,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 15:59:01,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:01,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 15:59:01,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:59:01,509 INFO L87 Difference]: Start difference. First operand 147 states and 200 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:01,523 INFO L93 Difference]: Finished difference Result 218 states and 293 transitions. [2024-11-11 15:59:01,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 15:59:01,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-11 15:59:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:01,525 INFO L225 Difference]: With dead ends: 218 [2024-11-11 15:59:01,525 INFO L226 Difference]: Without dead ends: 177 [2024-11-11 15:59:01,525 INFO L434 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-11 15:59:01,526 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 4 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:01,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 142 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:59:01,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-11 15:59:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-11 15:59:01,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 176 states have (on average 1.3409090909090908) internal successors, (236), 176 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 236 transitions. [2024-11-11 15:59:01,533 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 236 transitions. Word has length 47 [2024-11-11 15:59:01,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:01,533 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 236 transitions. [2024-11-11 15:59:01,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,534 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 236 transitions. [2024-11-11 15:59:01,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-11 15:59:01,535 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:01,535 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 15:59:01,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 15:59:01,535 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:01,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:01,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1529423642, now seen corresponding path program 1 times [2024-11-11 15:59:01,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:01,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922821648] [2024-11-11 15:59:01,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:01,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:01,700 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-11-11 15:59:01,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:01,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922821648] [2024-11-11 15:59:01,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922821648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:01,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499069292] [2024-11-11 15:59:01,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:01,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:01,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:01,703 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-11 15:59:01,704 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-11 15:59:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:01,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 15:59:01,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:59:01,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:01,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499069292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:01,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 15:59:01,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2024-11-11 15:59:01,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214788975] [2024-11-11 15:59:01,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:01,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:59:01,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:01,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:59:01,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:59:01,804 INFO L87 Difference]: Start difference. First operand 177 states and 236 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:01,880 INFO L93 Difference]: Finished difference Result 364 states and 492 transitions. [2024-11-11 15:59:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 15:59:01,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-11 15:59:01,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:01,881 INFO L225 Difference]: With dead ends: 364 [2024-11-11 15:59:01,882 INFO L226 Difference]: Without dead ends: 171 [2024-11-11 15:59:01,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:59:01,883 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 37 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:01,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:59:01,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-11 15:59:01,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 142. [2024-11-11 15:59:01,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3049645390070923) internal successors, (184), 141 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2024-11-11 15:59:01,889 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 184 transitions. Word has length 47 [2024-11-11 15:59:01,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:01,890 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 184 transitions. [2024-11-11 15:59:01,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 184 transitions. [2024-11-11 15:59:01,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-11 15:59:01,890 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:01,890 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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-11 15:59:01,909 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-11 15:59:02,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:02,091 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:02,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:02,092 INFO L85 PathProgramCache]: Analyzing trace with hash -646401574, now seen corresponding path program 1 times [2024-11-11 15:59:02,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:02,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677494076] [2024-11-11 15:59:02,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:02,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:02,326 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 15:59:02,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:02,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677494076] [2024-11-11 15:59:02,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677494076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:02,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:02,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 15:59:02,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308204540] [2024-11-11 15:59:02,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:02,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 15:59:02,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:02,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 15:59:02,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:59:02,329 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:02,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:02,561 INFO L93 Difference]: Finished difference Result 509 states and 661 transitions. [2024-11-11 15:59:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 15:59:02,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-11-11 15:59:02,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:02,563 INFO L225 Difference]: With dead ends: 509 [2024-11-11 15:59:02,563 INFO L226 Difference]: Without dead ends: 386 [2024-11-11 15:59:02,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:59:02,564 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 125 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:02,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 229 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:59:02,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-11 15:59:02,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 142. [2024-11-11 15:59:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.3049645390070923) internal successors, (184), 141 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:02,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2024-11-11 15:59:02,571 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 184 transitions. Word has length 68 [2024-11-11 15:59:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:02,571 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 184 transitions. [2024-11-11 15:59:02,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:02,572 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 184 transitions. [2024-11-11 15:59:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 15:59:02,572 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:02,573 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 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-11 15:59:02,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 15:59:02,573 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:02,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:02,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1338944162, now seen corresponding path program 1 times [2024-11-11 15:59:02,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:02,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928368023] [2024-11-11 15:59:02,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:02,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-11 15:59:02,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:02,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928368023] [2024-11-11 15:59:02,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928368023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:02,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:02,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 15:59:02,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043966881] [2024-11-11 15:59:02,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:02,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 15:59:02,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:02,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 15:59:02,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:59:02,794 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:02,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:02,900 INFO L93 Difference]: Finished difference Result 434 states and 570 transitions. [2024-11-11 15:59:02,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 15:59:02,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-11 15:59:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:02,903 INFO L225 Difference]: With dead ends: 434 [2024-11-11 15:59:02,903 INFO L226 Difference]: Without dead ends: 311 [2024-11-11 15:59:02,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:59:02,904 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 155 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:02,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 211 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:59:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-11 15:59:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 221. [2024-11-11 15:59:02,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.3045454545454545) internal successors, (287), 220 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:02,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 287 transitions. [2024-11-11 15:59:02,918 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 287 transitions. Word has length 69 [2024-11-11 15:59:02,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:02,918 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 287 transitions. [2024-11-11 15:59:02,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 287 transitions. [2024-11-11 15:59:02,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 15:59:02,920 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:02,920 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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-11 15:59:02,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 15:59:02,920 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:02,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash 2129136800, now seen corresponding path program 1 times [2024-11-11 15:59:02,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:02,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033661198] [2024-11-11 15:59:02,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:02,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:03,117 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 15:59:03,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:03,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033661198] [2024-11-11 15:59:03,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033661198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:03,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:03,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 15:59:03,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871223296] [2024-11-11 15:59:03,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:03,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 15:59:03,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:03,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 15:59:03,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:59:03,119 INFO L87 Difference]: Start difference. First operand 221 states and 287 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:03,441 INFO L93 Difference]: Finished difference Result 1045 states and 1352 transitions. [2024-11-11 15:59:03,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 15:59:03,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-11 15:59:03,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:03,445 INFO L225 Difference]: With dead ends: 1045 [2024-11-11 15:59:03,445 INFO L226 Difference]: Without dead ends: 843 [2024-11-11 15:59:03,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 15:59:03,447 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 188 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:03,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 349 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 15:59:03,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-11 15:59:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 221. [2024-11-11 15:59:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.3045454545454545) internal successors, (287), 220 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:03,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 287 transitions. [2024-11-11 15:59:03,460 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 287 transitions. Word has length 69 [2024-11-11 15:59:03,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:03,460 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 287 transitions. [2024-11-11 15:59:03,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 287 transitions. [2024-11-11 15:59:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-11 15:59:03,461 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:03,461 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 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-11 15:59:03,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 15:59:03,462 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:03,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:03,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1748433890, now seen corresponding path program 1 times [2024-11-11 15:59:03,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:03,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399444115] [2024-11-11 15:59:03,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:03,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 15:59:03,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399444115] [2024-11-11 15:59:03,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399444115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:03,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284327699] [2024-11-11 15:59:03,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:03,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:03,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:03,831 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-11 15:59:03,832 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-11 15:59:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:04,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-11 15:59:04,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:04,082 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 15:59:04,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:04,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284327699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:04,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 15:59:04,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-11 15:59:04,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572328822] [2024-11-11 15:59:04,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:04,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 15:59:04,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:04,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 15:59:04,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-11 15:59:04,084 INFO L87 Difference]: Start difference. First operand 221 states and 287 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:04,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:04,306 INFO L93 Difference]: Finished difference Result 988 states and 1284 transitions. [2024-11-11 15:59:04,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 15:59:04,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-11 15:59:04,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:04,310 INFO L225 Difference]: With dead ends: 988 [2024-11-11 15:59:04,310 INFO L226 Difference]: Without dead ends: 781 [2024-11-11 15:59:04,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-11-11 15:59:04,311 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 135 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:04,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 559 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:59:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2024-11-11 15:59:04,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 372. [2024-11-11 15:59:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 1.280323450134771) internal successors, (475), 371 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 475 transitions. [2024-11-11 15:59:04,331 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 475 transitions. Word has length 69 [2024-11-11 15:59:04,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:04,331 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 475 transitions. [2024-11-11 15:59:04,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 475 transitions. [2024-11-11 15:59:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-11 15:59:04,332 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:04,332 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-11 15:59:04,349 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-11 15:59:04,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 15:59:04,533 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:04,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash 97611583, now seen corresponding path program 1 times [2024-11-11 15:59:04,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:04,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445145191] [2024-11-11 15:59:04,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:04,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 15:59:04,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:04,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445145191] [2024-11-11 15:59:04,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445145191] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:04,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318093467] [2024-11-11 15:59:04,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:04,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:04,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:04,701 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-11 15:59:04,702 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-11 15:59:04,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:04,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 15:59:04,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 15:59:04,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:04,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318093467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:04,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 15:59:04,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-11-11 15:59:04,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289127528] [2024-11-11 15:59:04,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:04,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:59:04,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:04,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:59:04,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:59:04,833 INFO L87 Difference]: Start difference. First operand 372 states and 475 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:04,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:04,953 INFO L93 Difference]: Finished difference Result 785 states and 1011 transitions. [2024-11-11 15:59:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:59:04,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-11 15:59:04,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:04,956 INFO L225 Difference]: With dead ends: 785 [2024-11-11 15:59:04,957 INFO L226 Difference]: Without dead ends: 583 [2024-11-11 15:59:04,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:59:04,958 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 30 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:04,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 130 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:59:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-11 15:59:04,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 559. [2024-11-11 15:59:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.2849462365591398) internal successors, (717), 558 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 717 transitions. [2024-11-11 15:59:04,983 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 717 transitions. Word has length 71 [2024-11-11 15:59:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:04,983 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 717 transitions. [2024-11-11 15:59:04,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 717 transitions. [2024-11-11 15:59:04,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 15:59:04,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:04,985 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-11 15:59:05,002 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-11 15:59:05,186 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,SelfDestructingSolverStorable15 [2024-11-11 15:59:05,186 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:05,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:05,187 INFO L85 PathProgramCache]: Analyzing trace with hash -59174066, now seen corresponding path program 1 times [2024-11-11 15:59:05,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:05,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171368751] [2024-11-11 15:59:05,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:05,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:05,389 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-11 15:59:05,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:05,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171368751] [2024-11-11 15:59:05,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171368751] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:05,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611236697] [2024-11-11 15:59:05,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:05,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:05,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:05,392 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-11 15:59:05,393 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-11 15:59:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:05,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 15:59:05,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:05,612 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 15:59:05,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:59:05,817 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 42 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 15:59:05,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611236697] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:59:05,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:59:05,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 17 [2024-11-11 15:59:05,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731904292] [2024-11-11 15:59:05,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:59:05,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-11 15:59:05,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:05,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-11 15:59:05,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2024-11-11 15:59:05,819 INFO L87 Difference]: Start difference. First operand 559 states and 717 transitions. Second operand has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:07,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:07,321 INFO L93 Difference]: Finished difference Result 2505 states and 3415 transitions. [2024-11-11 15:59:07,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-11 15:59:07,322 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-11 15:59:07,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:07,329 INFO L225 Difference]: With dead ends: 2505 [2024-11-11 15:59:07,330 INFO L226 Difference]: Without dead ends: 1879 [2024-11-11 15:59:07,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=586, Invalid=1220, Unknown=0, NotChecked=0, Total=1806 [2024-11-11 15:59:07,332 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 759 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:07,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 340 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 15:59:07,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2024-11-11 15:59:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1578. [2024-11-11 15:59:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1577 states have (on average 1.3595434369055168) internal successors, (2144), 1577 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:07,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2144 transitions. [2024-11-11 15:59:07,411 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2144 transitions. Word has length 72 [2024-11-11 15:59:07,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:07,412 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 2144 transitions. [2024-11-11 15:59:07,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2144 transitions. [2024-11-11 15:59:07,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 15:59:07,413 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:07,414 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-11 15:59:07,430 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-11 15:59:07,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-11 15:59:07,615 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:07,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:07,615 INFO L85 PathProgramCache]: Analyzing trace with hash 982675604, now seen corresponding path program 1 times [2024-11-11 15:59:07,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:07,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707979014] [2024-11-11 15:59:07,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:07,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:07,932 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-11 15:59:07,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:07,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707979014] [2024-11-11 15:59:07,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707979014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:07,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328269835] [2024-11-11 15:59:07,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:07,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:07,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:07,936 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:59:07,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-11 15:59:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:08,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 15:59:08,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-11 15:59:08,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:59:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-11 15:59:09,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328269835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:59:09,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:59:09,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-11 15:59:09,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979320647] [2024-11-11 15:59:09,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:59:09,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 15:59:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:09,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 15:59:09,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-11 15:59:09,019 INFO L87 Difference]: Start difference. First operand 1578 states and 2144 transitions. Second operand has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:09,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:09,373 INFO L93 Difference]: Finished difference Result 3353 states and 4481 transitions. [2024-11-11 15:59:09,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 15:59:09,374 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-11 15:59:09,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:09,380 INFO L225 Difference]: With dead ends: 3353 [2024-11-11 15:59:09,380 INFO L226 Difference]: Without dead ends: 1798 [2024-11-11 15:59:09,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=326, Unknown=0, NotChecked=0, Total=462 [2024-11-11 15:59:09,383 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 275 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:09,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 532 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:59:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2024-11-11 15:59:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 1258. [2024-11-11 15:59:09,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.3540175019888623) internal successors, (1702), 1257 states have internal predecessors, (1702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:09,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1702 transitions. [2024-11-11 15:59:09,440 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1702 transitions. Word has length 73 [2024-11-11 15:59:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:09,441 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1702 transitions. [2024-11-11 15:59:09,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.928571428571429) internal successors, (125), 14 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:09,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1702 transitions. [2024-11-11 15:59:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 15:59:09,442 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:09,442 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-11 15:59:09,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-11 15:59:09,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:09,643 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:09,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash 896849236, now seen corresponding path program 2 times [2024-11-11 15:59:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:09,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758424913] [2024-11-11 15:59:09,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:09,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 15:59:10,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:10,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758424913] [2024-11-11 15:59:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758424913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:10,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119707149] [2024-11-11 15:59:10,101 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 15:59:10,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:10,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:10,103 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:59:10,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-11 15:59:10,288 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 15:59:10,288 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:59:10,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-11 15:59:10,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:10,524 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 15:59:10,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:59:10,936 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-11 15:59:10,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119707149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:59:10,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:59:10,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2024-11-11 15:59:10,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280804114] [2024-11-11 15:59:10,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:59:10,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 15:59:10,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:10,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 15:59:10,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2024-11-11 15:59:10,939 INFO L87 Difference]: Start difference. First operand 1258 states and 1702 transitions. Second operand has 21 states, 21 states have (on average 7.809523809523809) internal successors, (164), 21 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:13,164 INFO L93 Difference]: Finished difference Result 6824 states and 8867 transitions. [2024-11-11 15:59:13,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-11-11 15:59:13,165 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 7.809523809523809) internal successors, (164), 21 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-11 15:59:13,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:13,184 INFO L225 Difference]: With dead ends: 6824 [2024-11-11 15:59:13,184 INFO L226 Difference]: Without dead ends: 6813 [2024-11-11 15:59:13,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 657 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=626, Invalid=2454, Unknown=0, NotChecked=0, Total=3080 [2024-11-11 15:59:13,187 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 325 mSDsluCounter, 1801 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:13,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 2033 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 15:59:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6813 states. [2024-11-11 15:59:13,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6813 to 2218. [2024-11-11 15:59:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2217 states have (on average 1.395128552097429) internal successors, (3093), 2217 states have internal predecessors, (3093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:13,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 3093 transitions. [2024-11-11 15:59:13,311 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 3093 transitions. Word has length 73 [2024-11-11 15:59:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:13,311 INFO L471 AbstractCegarLoop]: Abstraction has 2218 states and 3093 transitions. [2024-11-11 15:59:13,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 7.809523809523809) internal successors, (164), 21 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 3093 transitions. [2024-11-11 15:59:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 15:59:13,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:13,313 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-11 15:59:13,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-11 15:59:13,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:13,518 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:13,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:13,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1772868242, now seen corresponding path program 1 times [2024-11-11 15:59:13,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:13,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346755464] [2024-11-11 15:59:13,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:13,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 77 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 15:59:13,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:13,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346755464] [2024-11-11 15:59:13,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346755464] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:13,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266276121] [2024-11-11 15:59:13,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:13,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:13,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:13,956 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:59:13,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-11 15:59:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:14,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-11 15:59:14,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:14,328 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 15:59:14,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:59:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 15:59:14,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266276121] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:59:14,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:59:14,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2024-11-11 15:59:14,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228338988] [2024-11-11 15:59:14,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:59:14,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 15:59:14,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:14,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 15:59:14,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2024-11-11 15:59:14,571 INFO L87 Difference]: Start difference. First operand 2218 states and 3093 transitions. Second operand has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:16,873 INFO L93 Difference]: Finished difference Result 6088 states and 8119 transitions. [2024-11-11 15:59:16,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2024-11-11 15:59:16,873 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-11 15:59:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:16,889 INFO L225 Difference]: With dead ends: 6088 [2024-11-11 15:59:16,889 INFO L226 Difference]: Without dead ends: 6077 [2024-11-11 15:59:16,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1810 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1168, Invalid=5474, Unknown=0, NotChecked=0, Total=6642 [2024-11-11 15:59:16,893 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 596 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:16,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 2166 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 15:59:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6077 states. [2024-11-11 15:59:17,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6077 to 3182. [2024-11-11 15:59:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 3181 states have (on average 1.437912606098711) internal successors, (4574), 3181 states have internal predecessors, (4574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4574 transitions. [2024-11-11 15:59:17,121 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4574 transitions. Word has length 73 [2024-11-11 15:59:17,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:17,122 INFO L471 AbstractCegarLoop]: Abstraction has 3182 states and 4574 transitions. [2024-11-11 15:59:17,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 9.80952380952381) internal successors, (206), 21 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:17,122 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4574 transitions. [2024-11-11 15:59:17,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-11 15:59:17,124 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:17,124 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 15:59:17,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-11 15:59:17,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:17,329 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:17,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:17,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1514721809, now seen corresponding path program 1 times [2024-11-11 15:59:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120810535] [2024-11-11 15:59:17,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 75 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 15:59:18,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:18,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120810535] [2024-11-11 15:59:18,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120810535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:18,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972076606] [2024-11-11 15:59:18,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:18,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:18,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:18,193 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:59:18,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-11 15:59:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:18,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-11 15:59:18,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 42 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 15:59:18,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:59:18,954 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-11 15:59:18,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972076606] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:18,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:59:18,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12, 9] total 22 [2024-11-11 15:59:18,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510222463] [2024-11-11 15:59:18,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:18,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 15:59:18,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:18,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 15:59:18,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-11 15:59:18,956 INFO L87 Difference]: Start difference. First operand 3182 states and 4574 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:19,137 INFO L93 Difference]: Finished difference Result 3190 states and 4583 transitions. [2024-11-11 15:59:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 15:59:19,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-11 15:59:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:19,147 INFO L225 Difference]: With dead ends: 3190 [2024-11-11 15:59:19,147 INFO L226 Difference]: Without dead ends: 3185 [2024-11-11 15:59:19,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2024-11-11 15:59:19,149 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:19,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 157 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:59:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3185 states. [2024-11-11 15:59:19,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3185 to 3182. [2024-11-11 15:59:19,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 3181 states have (on average 1.437912606098711) internal successors, (4574), 3181 states have internal predecessors, (4574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4574 transitions. [2024-11-11 15:59:19,311 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4574 transitions. Word has length 75 [2024-11-11 15:59:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:19,311 INFO L471 AbstractCegarLoop]: Abstraction has 3182 states and 4574 transitions. [2024-11-11 15:59:19,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4574 transitions. [2024-11-11 15:59:19,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-11 15:59:19,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:19,314 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 15:59:19,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-11 15:59:19,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-11 15:59:19,515 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:19,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:19,515 INFO L85 PathProgramCache]: Analyzing trace with hash -235685784, now seen corresponding path program 1 times [2024-11-11 15:59:19,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:19,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762679393] [2024-11-11 15:59:19,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:19,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:19,780 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:59:19,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 15:59:19,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762679393] [2024-11-11 15:59:19,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762679393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 15:59:19,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25553057] [2024-11-11 15:59:19,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:19,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 15:59:19,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:19,783 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 15:59:19,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-11 15:59:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:21,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-11 15:59:21,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:59:21,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:59:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-11 15:59:21,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25553057] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:59:21,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 15:59:21,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-11-11 15:59:21,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619690139] [2024-11-11 15:59:21,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 15:59:21,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-11 15:59:21,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 15:59:21,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-11 15:59:21,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2024-11-11 15:59:21,436 INFO L87 Difference]: Start difference. First operand 3182 states and 4574 transitions. Second operand has 17 states, 17 states have (on average 11.588235294117647) internal successors, (197), 17 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:22,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:22,748 INFO L93 Difference]: Finished difference Result 9357 states and 12563 transitions. [2024-11-11 15:59:22,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 15:59:22,749 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 11.588235294117647) internal successors, (197), 17 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-11 15:59:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:22,769 INFO L225 Difference]: With dead ends: 9357 [2024-11-11 15:59:22,770 INFO L226 Difference]: Without dead ends: 9352 [2024-11-11 15:59:22,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=457, Invalid=1349, Unknown=0, NotChecked=0, Total=1806 [2024-11-11 15:59:22,773 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 560 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:22,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1172 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 15:59:22,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9352 states. [2024-11-11 15:59:22,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9352 to 3616. [2024-11-11 15:59:22,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3616 states, 3615 states have (on average 1.4533886583679114) internal successors, (5254), 3615 states have internal predecessors, (5254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 5254 transitions. [2024-11-11 15:59:22,979 INFO L78 Accepts]: Start accepts. Automaton has 3616 states and 5254 transitions. Word has length 76 [2024-11-11 15:59:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:22,980 INFO L471 AbstractCegarLoop]: Abstraction has 3616 states and 5254 transitions. [2024-11-11 15:59:22,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.588235294117647) internal successors, (197), 17 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3616 states and 5254 transitions. [2024-11-11 15:59:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 15:59:22,982 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:22,982 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 15:59:22,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-11 15:59:23,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-11 15:59:23,183 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:23,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:23,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1339024244, now seen corresponding path program 1 times [2024-11-11 15:59:23,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 15:59:23,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622191148] [2024-11-11 15:59:23,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:23,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 15:59:23,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 15:59:23,220 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-11 15:59:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-11 15:59:23,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-11 15:59:23,304 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-11 15:59:23,306 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 15:59:23,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 15:59:23,314 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:59:23,395 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 15:59:23,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 03:59:23 BoogieIcfgContainer [2024-11-11 15:59:23,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 15:59:23,400 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 15:59:23,401 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 15:59:23,401 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 15:59:23,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:58:57" (3/4) ... [2024-11-11 15:59:23,403 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-11 15:59:23,404 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 15:59:23,405 INFO L158 Benchmark]: Toolchain (without parser) took 27109.12ms. Allocated memory was 161.5MB in the beginning and 545.3MB in the end (delta: 383.8MB). Free memory was 105.8MB in the beginning and 244.5MB in the end (delta: -138.7MB). Peak memory consumption was 246.8MB. Max. memory is 16.1GB. [2024-11-11 15:59:23,406 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 161.5MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 15:59:23,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.09ms. Allocated memory is still 161.5MB. Free memory was 105.8MB in the beginning and 90.8MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-11 15:59:23,409 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.21ms. Allocated memory is still 161.5MB. Free memory was 90.8MB in the beginning and 87.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-11 15:59:23,409 INFO L158 Benchmark]: Boogie Preprocessor took 56.74ms. Allocated memory is still 161.5MB. Free memory was 87.8MB in the beginning and 84.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-11 15:59:23,409 INFO L158 Benchmark]: RCFGBuilder took 579.70ms. Allocated memory is still 161.5MB. Free memory was 84.8MB in the beginning and 130.3MB in the end (delta: -45.4MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. [2024-11-11 15:59:23,409 INFO L158 Benchmark]: TraceAbstraction took 26127.96ms. Allocated memory was 161.5MB in the beginning and 545.3MB in the end (delta: 383.8MB). Free memory was 129.4MB in the beginning and 244.5MB in the end (delta: -115.1MB). Peak memory consumption was 268.6MB. Max. memory is 16.1GB. [2024-11-11 15:59:23,410 INFO L158 Benchmark]: Witness Printer took 4.08ms. Allocated memory is still 545.3MB. Free memory is still 244.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 15:59:23,411 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.21ms. Allocated memory is still 161.5MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.09ms. Allocated memory is still 161.5MB. Free memory was 105.8MB in the beginning and 90.8MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.21ms. Allocated memory is still 161.5MB. Free memory was 90.8MB in the beginning and 87.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.74ms. Allocated memory is still 161.5MB. Free memory was 87.8MB in the beginning and 84.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 579.70ms. Allocated memory is still 161.5MB. Free memory was 84.8MB in the beginning and 130.3MB in the end (delta: -45.4MB). Peak memory consumption was 28.6MB. Max. memory is 16.1GB. * TraceAbstraction took 26127.96ms. Allocated memory was 161.5MB in the beginning and 545.3MB in the end (delta: 383.8MB). Free memory was 129.4MB in the beginning and 244.5MB in the end (delta: -115.1MB). Peak memory consumption was 268.6MB. Max. memory is 16.1GB. * Witness Printer took 4.08ms. Allocated memory is still 545.3MB. Free memory is still 244.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 25]: 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 bitwiseOr at line 116. Possible FailurePath: [L124] unsigned int a, b, r; [L126] b = __VERIFIER_nondet_uint() [L128] a = 234770789 [L130] CALL, EXPR mp_add(a, b) [L42] unsigned char a0, a1, a2, a3; [L43] unsigned char b0, b1, b2, b3; [L44] unsigned char r0, r1, r2, r3; [L45] unsigned short carry; [L46] unsigned short partial_sum; [L47] unsigned int r; [L48] unsigned char i; [L49] unsigned char na, nb; [L50] a0 = a [L51] a1 = a >> 8 [L52] a2 = a >> 16U [L53] a3 = a >> 24U [L54] b0 = b [L55] b1 = b >> 8U [L56] b2 = b >> 16U [L57] b3 = b >> 24U [L58] na = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4] [L59] COND FALSE !(a3 == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4] [L68] nb = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=4] [L69] COND TRUE b3 == (unsigned char)0 [L70] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=3] [L71] COND TRUE b2 == (unsigned char)0 [L72] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=2] [L73] COND TRUE b1 == (unsigned char)0 [L74] nb = nb - 1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, na=4, nb=1] [L78] carry = (unsigned short)0 [L79] i = (unsigned char)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=0] [L84] COND TRUE i == (unsigned char)0 [L84] partial_sum = partial_sum + a0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L89] COND TRUE i < nb VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=101] [L90] COND TRUE i == (unsigned char)0 [L90] partial_sum = partial_sum + b0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L91] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L92] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L93] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=0, na=4, nb=1, partial_sum=256] [L95] COND TRUE partial_sum > ((unsigned char)255) [L96] partial_sum = partial_sum & ((unsigned char)255) [L97] carry = (unsigned short)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0] [L99] COND TRUE i == (unsigned char)0 [L99] r0 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=0, na=4, nb=1, partial_sum=0, r0=0] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=1, i=1, na=4, nb=1, partial_sum=0, r0=0] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=1, r0=0] [L85] COND TRUE i == (unsigned char)1 [L85] partial_sum = partial_sum + a1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0] [L100] COND TRUE i == (unsigned char)1 [L100] r1 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=1, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=82, r0=0, r1=82] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=0, r0=0, r1=82] [L86] COND TRUE i == (unsigned char)2 [L86] partial_sum = partial_sum + a2 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L87] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82] [L101] COND TRUE i == (unsigned char)2 [L101] r2 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L102] COND FALSE !(i == (unsigned char)3) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=2, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=254, r0=0, r1=82, r2=254] [L80] COND TRUE (i < na) || (i < nb) || (carry != (unsigned short)0) [L81] partial_sum = carry [L82] carry = (unsigned short)0 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L83] COND TRUE i < na VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L84] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L85] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L86] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=0, r0=0, r1=82, r2=254] [L87] COND TRUE i == (unsigned char)3 [L87] partial_sum = partial_sum + a3 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L89] COND FALSE !(i < nb) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L95] COND FALSE !(partial_sum > ((unsigned char)255)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L99] COND FALSE !(i == (unsigned char)0) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L100] COND FALSE !(i == (unsigned char)1) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L101] COND FALSE !(i == (unsigned char)2) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, partial_sum=13, r0=0, r1=82, r2=254] [L102] COND TRUE i == (unsigned char)3 [L102] r3 = (unsigned char)partial_sum VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=3, na=4, nb=1, r0=0, r1=82, r2=254, r3=13] [L104] i = i + (unsigned char)1 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, carry=0, i=4, na=4, nb=1, r0=0, r1=82, r2=254, r3=13] [L80] COND FALSE !((i < na) || (i < nb) || (carry != (unsigned short)0)) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, i=4, r0=0, r1=82, r2=254, r3=13] [L107] COND FALSE !(i < (unsigned char)4) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, r0=0, r1=82, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, r2=254, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0, r3=13] [L116] EXPR r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; VAL [\result=218103808, a0=234770789, a1=917073, a2=3582, a3=13, b0=4294967451, b1=0, b2=0, b3=0] [L130] RET, EXPR mp_add(a, b) [L130] r = mp_add(a, b) [L132] CALL __VERIFIER_assert(r == a + b) [L24] COND TRUE !(cond) [L25] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.9s, OverallIterations: 23, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3745 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3745 mSDsluCounter, 9466 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7368 mSDsCounter, 378 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6654 IncrementalHoareTripleChecker+Invalid, 7032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 378 mSolverCounterUnsat, 2098 mSDtfsCounter, 6654 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1451 GetRequests, 1128 SyntacticMatches, 3 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3550 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3616occurred in iteration=22, InterpolantAutomatonStates: 265, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 15912 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.5s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1905 NumberOfCodeBlocks, 1905 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2231 ConstructedInterpolants, 0 QuantifiedInterpolants, 12016 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1952 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 39 InterpolantComputations, 17 PerfectInterpolantSequences, 1524/2271 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-11 15:59:23,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/byte_add_1-1.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 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 15:59:25,608 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 15:59:25,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-11 15:59:25,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 15:59:25,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 15:59:25,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 15:59:25,735 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 15:59:25,735 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 15:59:25,736 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 15:59:25,736 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 15:59:25,737 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 15:59:25,737 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 15:59:25,738 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 15:59:25,738 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 15:59:25,740 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 15:59:25,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 15:59:25,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 15:59:25,741 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 15:59:25,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 15:59:25,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 15:59:25,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 15:59:25,746 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 15:59:25,746 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 15:59:25,746 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-11 15:59:25,746 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-11 15:59:25,746 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 15:59:25,747 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-11 15:59:25,747 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 15:59:25,747 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 15:59:25,747 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 15:59:25,748 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 15:59:25,748 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 15:59:25,748 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 15:59:25,748 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 15:59:25,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:59:25,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 15:59:25,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 15:59:25,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 15:59:25,759 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-11 15:59:25,759 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-11 15:59:25,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 15:59:25,762 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 15:59:25,762 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 15:59:25,762 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 15:59:25,763 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2024-11-11 15:59:26,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 15:59:26,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 15:59:26,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 15:59:26,140 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 15:59:26,141 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 15:59:26,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-11-11 15:59:27,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 15:59:27,990 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 15:59:27,991 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-11-11 15:59:27,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad8816e9/0b43cd6a96d844d896db2d441b3ef6c6/FLAGb828fe9c7 [2024-11-11 15:59:28,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ad8816e9/0b43cd6a96d844d896db2d441b3ef6c6 [2024-11-11 15:59:28,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 15:59:28,381 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 15:59:28,382 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 15:59:28,382 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 15:59:28,387 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 15:59:28,388 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51323115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28, skipping insertion in model container [2024-11-11 15:59:28,389 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,408 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 15:59:28,589 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/bitvector/byte_add_1-1.i[1168,1181] [2024-11-11 15:59:28,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:59:28,655 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 15:59:28,668 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/bitvector/byte_add_1-1.i[1168,1181] [2024-11-11 15:59:28,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 15:59:28,721 INFO L204 MainTranslator]: Completed translation [2024-11-11 15:59:28,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28 WrapperNode [2024-11-11 15:59:28,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 15:59:28,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 15:59:28,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 15:59:28,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 15:59:28,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,767 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2024-11-11 15:59:28,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 15:59:28,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 15:59:28,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 15:59:28,772 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 15:59:28,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,804 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-11 15:59:28,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,808 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,817 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,825 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 15:59:28,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 15:59:28,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 15:59:28,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 15:59:28,835 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (1/1) ... [2024-11-11 15:59:28,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 15:59:28,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 15:59:28,868 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-11 15:59:28,870 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-11 15:59:28,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 15:59:28,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-11 15:59:28,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 15:59:28,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 15:59:28,991 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 15:59:28,994 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 15:59:29,313 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-11 15:59:29,314 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 15:59:29,330 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 15:59:29,330 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 15:59:29,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:59:29 BoogieIcfgContainer [2024-11-11 15:59:29,331 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 15:59:29,333 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 15:59:29,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 15:59:29,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 15:59:29,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 03:59:28" (1/3) ... [2024-11-11 15:59:29,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b167dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:59:29, skipping insertion in model container [2024-11-11 15:59:29,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 03:59:28" (2/3) ... [2024-11-11 15:59:29,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b167dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 03:59:29, skipping insertion in model container [2024-11-11 15:59:29,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 03:59:29" (3/3) ... [2024-11-11 15:59:29,338 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2024-11-11 15:59:29,353 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 15:59:29,353 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 15:59:29,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 15:59:29,410 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;@258ef408, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 15:59:29,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 15:59:29,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:29,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-11 15:59:29,419 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:29,420 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:59:29,420 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:29,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash 255061167, now seen corresponding path program 1 times [2024-11-11 15:59:29,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:29,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104248108] [2024-11-11 15:59:29,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:29,434 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-11 15:59:29,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:29,437 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-11 15:59:29,439 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-11 15:59:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:29,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 15:59:29,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:29,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:29,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:29,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:29,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104248108] [2024-11-11 15:59:29,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104248108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:29,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:29,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 15:59:29,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884754723] [2024-11-11 15:59:29,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:29,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 15:59:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:29,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 15:59:29,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 15:59:29,576 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.775) internal successors, (71), 41 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:29,588 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2024-11-11 15:59:29,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 15:59:29,590 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-11 15:59:29,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:29,597 INFO L225 Difference]: With dead ends: 57 [2024-11-11 15:59:29,597 INFO L226 Difference]: Without dead ends: 38 [2024-11-11 15:59:29,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-11 15:59:29,602 INFO L435 NwaCegarLoop]: 68 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, 68 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-11 15:59:29,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:59:29,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-11 15:59:29,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-11 15:59:29,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 37 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:29,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions. [2024-11-11 15:59:29,631 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 12 [2024-11-11 15:59:29,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:29,631 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions. [2024-11-11 15:59:29,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:29,632 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions. [2024-11-11 15:59:29,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-11 15:59:29,632 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:29,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:59:29,636 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-11 15:59:29,836 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-11 15:59:29,840 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:29,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1803477009, now seen corresponding path program 1 times [2024-11-11 15:59:29,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:29,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062309765] [2024-11-11 15:59:29,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:29,841 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-11 15:59:29,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:29,843 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-11 15:59:29,845 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-11 15:59:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:29,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 15:59:29,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:29,962 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:29,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:29,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062309765] [2024-11-11 15:59:29,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062309765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:29,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:29,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:59:29,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157899015] [2024-11-11 15:59:29,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:29,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:59:29,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:29,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:59:29,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:59:29,965 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:30,111 INFO L93 Difference]: Finished difference Result 101 states and 179 transitions. [2024-11-11 15:59:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:59:30,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-11 15:59:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:30,113 INFO L225 Difference]: With dead ends: 101 [2024-11-11 15:59:30,113 INFO L226 Difference]: Without dead ends: 73 [2024-11-11 15:59:30,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:59:30,115 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 69 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:30,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 121 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:59:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-11 15:59:30,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2024-11-11 15:59:30,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 71 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:30,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions. [2024-11-11 15:59:30,132 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 116 transitions. Word has length 12 [2024-11-11 15:59:30,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:30,133 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 116 transitions. [2024-11-11 15:59:30,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:30,133 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 116 transitions. [2024-11-11 15:59:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 15:59:30,136 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:30,136 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:59:30,142 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-11 15:59:30,337 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-11 15:59:30,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:30,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:30,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1087802014, now seen corresponding path program 1 times [2024-11-11 15:59:30,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:30,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711454400] [2024-11-11 15:59:30,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:30,340 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-11 15:59:30,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:30,343 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-11 15:59:30,344 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-11 15:59:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:30,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 15:59:30,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:30,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:30,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:30,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:30,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711454400] [2024-11-11 15:59:30,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711454400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:30,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:30,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 15:59:30,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780916915] [2024-11-11 15:59:30,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:30,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 15:59:30,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:30,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 15:59:30,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:59:30,443 INFO L87 Difference]: Start difference. First operand 72 states and 116 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:30,675 INFO L93 Difference]: Finished difference Result 135 states and 231 transitions. [2024-11-11 15:59:30,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 15:59:30,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-11 15:59:30,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:30,677 INFO L225 Difference]: With dead ends: 135 [2024-11-11 15:59:30,677 INFO L226 Difference]: Without dead ends: 107 [2024-11-11 15:59:30,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:59:30,680 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 82 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:30,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 242 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:59:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-11 15:59:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 72. [2024-11-11 15:59:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 71 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions. [2024-11-11 15:59:30,695 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 116 transitions. Word has length 13 [2024-11-11 15:59:30,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:30,695 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 116 transitions. [2024-11-11 15:59:30,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 116 transitions. [2024-11-11 15:59:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 15:59:30,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:30,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:59:30,702 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 (4)] Ended with exit code 0 [2024-11-11 15:59:30,901 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-11 15:59:30,902 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:30,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash 583572890, now seen corresponding path program 1 times [2024-11-11 15:59:30,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:30,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765983728] [2024-11-11 15:59:30,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:30,904 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-11 15:59:30,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:30,907 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-11 15:59:30,908 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-11 15:59:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:30,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 15:59:30,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:31,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:31,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:31,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:31,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765983728] [2024-11-11 15:59:31,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765983728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:31,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:31,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 15:59:31,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491790324] [2024-11-11 15:59:31,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:31,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 15:59:31,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:31,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 15:59:31,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:59:31,024 INFO L87 Difference]: Start difference. First operand 72 states and 116 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:31,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:31,296 INFO L93 Difference]: Finished difference Result 169 states and 283 transitions. [2024-11-11 15:59:31,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 15:59:31,297 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-11 15:59:31,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:31,300 INFO L225 Difference]: With dead ends: 169 [2024-11-11 15:59:31,300 INFO L226 Difference]: Without dead ends: 141 [2024-11-11 15:59:31,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:59:31,304 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 116 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:31,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 420 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-11 15:59:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-11 15:59:31,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 72. [2024-11-11 15:59:31,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.6338028169014085) internal successors, (116), 71 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:31,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 116 transitions. [2024-11-11 15:59:31,318 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 116 transitions. Word has length 14 [2024-11-11 15:59:31,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:31,320 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 116 transitions. [2024-11-11 15:59:31,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:31,321 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 116 transitions. [2024-11-11 15:59:31,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-11 15:59:31,321 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:31,321 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 15:59:31,325 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 (5)] Ended with exit code 0 [2024-11-11 15:59:31,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-11 15:59:31,522 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:31,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1392919516, now seen corresponding path program 1 times [2024-11-11 15:59:31,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:31,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337114868] [2024-11-11 15:59:31,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:31,523 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-11 15:59:31,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:31,525 INFO L229 MonitoredProcess]: Starting monitored process 6 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-11 15:59:31,527 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 (6)] Waiting until timeout for monitored process [2024-11-11 15:59:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:31,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 15:59:31,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:31,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:31,602 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:31,602 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:31,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1337114868] [2024-11-11 15:59:31,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1337114868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:31,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:31,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 15:59:31,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127143422] [2024-11-11 15:59:31,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:31,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 15:59:31,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:31,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 15:59:31,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:59:31,604 INFO L87 Difference]: Start difference. First operand 72 states and 116 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:31,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:31,741 INFO L93 Difference]: Finished difference Result 181 states and 293 transitions. [2024-11-11 15:59:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 15:59:31,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-11 15:59:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:31,743 INFO L225 Difference]: With dead ends: 181 [2024-11-11 15:59:31,743 INFO L226 Difference]: Without dead ends: 153 [2024-11-11 15:59:31,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 15:59:31,744 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 163 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:31,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 526 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:59:31,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-11 15:59:31,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 84. [2024-11-11 15:59:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 83 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 126 transitions. [2024-11-11 15:59:31,759 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 126 transitions. Word has length 14 [2024-11-11 15:59:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:31,759 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 126 transitions. [2024-11-11 15:59:31,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:31,759 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 126 transitions. [2024-11-11 15:59:31,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 15:59:31,760 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:31,760 INFO L218 NwaCegarLoop]: trace histogram [1, 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-11 15:59:31,764 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 (6)] Ended with exit code 0 [2024-11-11 15:59:31,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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-11 15:59:31,963 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:31,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:31,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1480128500, now seen corresponding path program 1 times [2024-11-11 15:59:31,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:31,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024694341] [2024-11-11 15:59:31,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:31,964 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-11 15:59:31,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:31,965 INFO L229 MonitoredProcess]: Starting monitored process 7 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-11 15:59:31,966 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 (7)] Waiting until timeout for monitored process [2024-11-11 15:59:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:32,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 15:59:32,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:32,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:32,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:32,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024694341] [2024-11-11 15:59:32,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024694341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:32,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:32,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 15:59:32,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3802680] [2024-11-11 15:59:32,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:32,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 15:59:32,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:32,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 15:59:32,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:59:32,037 INFO L87 Difference]: Start difference. First operand 84 states and 126 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:32,162 INFO L93 Difference]: Finished difference Result 222 states and 333 transitions. [2024-11-11 15:59:32,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 15:59:32,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-11 15:59:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:32,163 INFO L225 Difference]: With dead ends: 222 [2024-11-11 15:59:32,164 INFO L226 Difference]: Without dead ends: 155 [2024-11-11 15:59:32,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 15:59:32,165 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 51 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:32,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 144 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:59:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-11 15:59:32,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 94. [2024-11-11 15:59:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4946236559139785) internal successors, (139), 93 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2024-11-11 15:59:32,176 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 25 [2024-11-11 15:59:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:32,176 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 139 transitions. [2024-11-11 15:59:32,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 139 transitions. [2024-11-11 15:59:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 15:59:32,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:32,177 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 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-11 15:59:32,183 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 (7)] Ended with exit code 0 [2024-11-11 15:59:32,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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-11 15:59:32,378 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:32,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:32,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1384042382, now seen corresponding path program 1 times [2024-11-11 15:59:32,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:32,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1020893337] [2024-11-11 15:59:32,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:32,379 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-11 15:59:32,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:32,380 INFO L229 MonitoredProcess]: Starting monitored process 8 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-11 15:59:32,381 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 (8)] Waiting until timeout for monitored process [2024-11-11 15:59:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:32,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 15:59:32,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:32,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 15:59:32,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:32,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:32,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1020893337] [2024-11-11 15:59:32,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1020893337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:32,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:32,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 15:59:32,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327118972] [2024-11-11 15:59:32,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:32,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 15:59:32,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:32,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 15:59:32,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:59:32,446 INFO L87 Difference]: Start difference. First operand 94 states and 139 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:32,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:32,457 INFO L93 Difference]: Finished difference Result 163 states and 242 transitions. [2024-11-11 15:59:32,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 15:59:32,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-11 15:59:32,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:32,458 INFO L225 Difference]: With dead ends: 163 [2024-11-11 15:59:32,458 INFO L226 Difference]: Without dead ends: 82 [2024-11-11 15:59:32,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 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-11 15:59:32,459 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 54 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:32,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 60 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:59:32,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-11 15:59:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-11 15:59:32,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4691358024691359) internal successors, (119), 81 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 119 transitions. [2024-11-11 15:59:32,471 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 119 transitions. Word has length 26 [2024-11-11 15:59:32,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:32,471 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 119 transitions. [2024-11-11 15:59:32,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:32,471 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 119 transitions. [2024-11-11 15:59:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 15:59:32,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:32,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-11 15:59:32,478 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 (8)] Ended with exit code 0 [2024-11-11 15:59:32,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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-11 15:59:32,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:32,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:32,674 INFO L85 PathProgramCache]: Analyzing trace with hash 221982208, now seen corresponding path program 1 times [2024-11-11 15:59:32,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:32,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868017589] [2024-11-11 15:59:32,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:32,674 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-11 15:59:32,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:32,677 INFO L229 MonitoredProcess]: Starting monitored process 9 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-11 15:59:32,678 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 (9)] Waiting until timeout for monitored process [2024-11-11 15:59:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:32,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 15:59:32,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:32,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:32,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:32,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868017589] [2024-11-11 15:59:32,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868017589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:32,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:32,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 15:59:32,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376792960] [2024-11-11 15:59:32,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:32,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 15:59:32,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:32,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 15:59:32,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 15:59:32,747 INFO L87 Difference]: Start difference. First operand 82 states and 119 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:32,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:32,768 INFO L93 Difference]: Finished difference Result 113 states and 164 transitions. [2024-11-11 15:59:32,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 15:59:32,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-11 15:59:32,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:32,769 INFO L225 Difference]: With dead ends: 113 [2024-11-11 15:59:32,769 INFO L226 Difference]: Without dead ends: 102 [2024-11-11 15:59:32,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 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-11 15:59:32,770 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:32,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 112 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 15:59:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-11 15:59:32,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-11 15:59:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.4554455445544554) internal successors, (147), 101 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:32,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 147 transitions. [2024-11-11 15:59:32,778 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 147 transitions. Word has length 29 [2024-11-11 15:59:32,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:32,779 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 147 transitions. [2024-11-11 15:59:32,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:32,779 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 147 transitions. [2024-11-11 15:59:32,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-11 15:59:32,780 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:32,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-11 15:59:32,784 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 (9)] Ended with exit code 0 [2024-11-11 15:59:32,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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-11 15:59:32,984 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:32,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:32,985 INFO L85 PathProgramCache]: Analyzing trace with hash 480147646, now seen corresponding path program 1 times [2024-11-11 15:59:32,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:32,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1308497161] [2024-11-11 15:59:32,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:32,986 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-11 15:59:32,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:32,987 INFO L229 MonitoredProcess]: Starting monitored process 10 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-11 15:59:32,989 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 (10)] Waiting until timeout for monitored process [2024-11-11 15:59:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:33,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 15:59:33,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:33,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:33,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:33,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:33,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1308497161] [2024-11-11 15:59:33,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1308497161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:33,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:33,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 15:59:33,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125845480] [2024-11-11 15:59:33,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:33,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 15:59:33,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:33,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 15:59:33,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:59:33,139 INFO L87 Difference]: Start difference. First operand 102 states and 147 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:33,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:33,288 INFO L93 Difference]: Finished difference Result 222 states and 333 transitions. [2024-11-11 15:59:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 15:59:33,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-11 15:59:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:33,290 INFO L225 Difference]: With dead ends: 222 [2024-11-11 15:59:33,290 INFO L226 Difference]: Without dead ends: 171 [2024-11-11 15:59:33,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:59:33,292 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:33,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 106 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:59:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-11 15:59:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 163. [2024-11-11 15:59:33,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4259259259259258) internal successors, (231), 162 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 231 transitions. [2024-11-11 15:59:33,303 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 231 transitions. Word has length 29 [2024-11-11 15:59:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:33,303 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 231 transitions. [2024-11-11 15:59:33,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 231 transitions. [2024-11-11 15:59:33,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-11 15:59:33,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:33,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-11 15:59:33,311 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 (10)] Forceful destruction successful, exit code 0 [2024-11-11 15:59:33,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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-11 15:59:33,507 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:33,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:33,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1828261773, now seen corresponding path program 1 times [2024-11-11 15:59:33,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:33,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74495529] [2024-11-11 15:59:33,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:33,508 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-11 15:59:33,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:33,511 INFO L229 MonitoredProcess]: Starting monitored process 11 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-11 15:59:33,512 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 (11)] Waiting until timeout for monitored process [2024-11-11 15:59:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:33,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 15:59:33,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:33,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 15:59:33,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:33,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74495529] [2024-11-11 15:59:33,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74495529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 15:59:33,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 15:59:33,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 15:59:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538767938] [2024-11-11 15:59:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 15:59:33,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 15:59:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:33,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 15:59:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 15:59:33,623 INFO L87 Difference]: Start difference. First operand 163 states and 231 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:33,762 INFO L93 Difference]: Finished difference Result 283 states and 417 transitions. [2024-11-11 15:59:33,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 15:59:33,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-11 15:59:33,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:33,763 INFO L225 Difference]: With dead ends: 283 [2024-11-11 15:59:33,763 INFO L226 Difference]: Without dead ends: 232 [2024-11-11 15:59:33,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-11 15:59:33,764 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 96 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:33,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 173 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:59:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-11 15:59:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 163. [2024-11-11 15:59:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.4259259259259258) internal successors, (231), 162 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 231 transitions. [2024-11-11 15:59:33,780 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 231 transitions. Word has length 30 [2024-11-11 15:59:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:33,780 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 231 transitions. [2024-11-11 15:59:33,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:33,780 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 231 transitions. [2024-11-11 15:59:33,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 15:59:33,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:33,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-11 15:59:33,785 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 (11)] Ended with exit code 0 [2024-11-11 15:59:33,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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-11 15:59:33,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:33,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1502060971, now seen corresponding path program 1 times [2024-11-11 15:59:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:33,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [680938400] [2024-11-11 15:59:33,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:33,987 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-11 15:59:33,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:33,988 INFO L229 MonitoredProcess]: Starting monitored process 12 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-11 15:59:33,993 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 (12)] Waiting until timeout for monitored process [2024-11-11 15:59:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:34,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 15:59:34,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:34,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:59:34,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:34,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:34,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [680938400] [2024-11-11 15:59:34,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [680938400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:59:34,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:59:34,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-11 15:59:34,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258607725] [2024-11-11 15:59:34,233 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:59:34,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 15:59:34,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:34,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 15:59:34,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-11 15:59:34,234 INFO L87 Difference]: Start difference. First operand 163 states and 231 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:34,795 INFO L93 Difference]: Finished difference Result 440 states and 658 transitions. [2024-11-11 15:59:34,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 15:59:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-11 15:59:34,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:34,798 INFO L225 Difference]: With dead ends: 440 [2024-11-11 15:59:34,798 INFO L226 Difference]: Without dead ends: 332 [2024-11-11 15:59:34,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-11 15:59:34,799 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 615 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:34,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 224 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 15:59:34,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-11 15:59:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 283. [2024-11-11 15:59:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 282 states have (on average 1.450354609929078) internal successors, (409), 282 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:34,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 409 transitions. [2024-11-11 15:59:34,815 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 409 transitions. Word has length 31 [2024-11-11 15:59:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:34,817 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 409 transitions. [2024-11-11 15:59:34,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:34,817 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 409 transitions. [2024-11-11 15:59:34,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-11 15:59:34,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:34,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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-11 15:59:34,823 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 (12)] Ended with exit code 0 [2024-11-11 15:59:35,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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-11 15:59:35,020 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:35,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:35,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1642609581, now seen corresponding path program 1 times [2024-11-11 15:59:35,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:35,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1249078738] [2024-11-11 15:59:35,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:35,022 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-11 15:59:35,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:35,023 INFO L229 MonitoredProcess]: Starting monitored process 13 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-11 15:59:35,024 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 (13)] Waiting until timeout for monitored process [2024-11-11 15:59:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:35,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 15:59:35,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:35,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:35,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:59:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:35,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:35,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1249078738] [2024-11-11 15:59:35,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1249078738] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:59:35,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:59:35,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-11 15:59:35,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227772483] [2024-11-11 15:59:35,253 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:59:35,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 15:59:35,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:35,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 15:59:35,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-11 15:59:35,255 INFO L87 Difference]: Start difference. First operand 283 states and 409 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:35,479 INFO L93 Difference]: Finished difference Result 738 states and 1127 transitions. [2024-11-11 15:59:35,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 15:59:35,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-11 15:59:35,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:35,483 INFO L225 Difference]: With dead ends: 738 [2024-11-11 15:59:35,483 INFO L226 Difference]: Without dead ends: 477 [2024-11-11 15:59:35,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-11 15:59:35,485 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 190 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:35,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 92 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 15:59:35,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-11 15:59:35,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 396. [2024-11-11 15:59:35,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 1.4936708860759493) internal successors, (590), 395 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 590 transitions. [2024-11-11 15:59:35,507 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 590 transitions. Word has length 31 [2024-11-11 15:59:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:35,507 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 590 transitions. [2024-11-11 15:59:35,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 590 transitions. [2024-11-11 15:59:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 15:59:35,510 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:35,510 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-11 15:59:35,514 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 (13)] Ended with exit code 0 [2024-11-11 15:59:35,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-11 15:59:35,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:35,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:35,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1493994486, now seen corresponding path program 1 times [2024-11-11 15:59:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:35,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [564127836] [2024-11-11 15:59:35,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:35,713 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-11 15:59:35,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:35,716 INFO L229 MonitoredProcess]: Starting monitored process 14 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-11 15:59:35,717 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 (14)] Waiting until timeout for monitored process [2024-11-11 15:59:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:35,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 15:59:35,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:35,861 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-11 15:59:35,862 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:59:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-11 15:59:35,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:35,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [564127836] [2024-11-11 15:59:35,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [564127836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:59:35,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:59:35,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-11 15:59:35,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450524404] [2024-11-11 15:59:35,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:59:35,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 15:59:35,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:35,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 15:59:35,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-11 15:59:35,961 INFO L87 Difference]: Start difference. First operand 396 states and 590 transitions. Second operand has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:36,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:36,280 INFO L93 Difference]: Finished difference Result 1213 states and 1778 transitions. [2024-11-11 15:59:36,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 15:59:36,281 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-11 15:59:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:36,285 INFO L225 Difference]: With dead ends: 1213 [2024-11-11 15:59:36,285 INFO L226 Difference]: Without dead ends: 840 [2024-11-11 15:59:36,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2024-11-11 15:59:36,287 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 274 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:36,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 327 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:59:36,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-11 15:59:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 559. [2024-11-11 15:59:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.5017921146953406) internal successors, (838), 558 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 838 transitions. [2024-11-11 15:59:36,320 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 838 transitions. Word has length 70 [2024-11-11 15:59:36,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:36,320 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 838 transitions. [2024-11-11 15:59:36,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.0) internal successors, (90), 10 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:36,320 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 838 transitions. [2024-11-11 15:59:36,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 15:59:36,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:36,323 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 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-11 15:59:36,327 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 (14)] Ended with exit code 0 [2024-11-11 15:59:36,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-11 15:59:36,525 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:36,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:36,526 INFO L85 PathProgramCache]: Analyzing trace with hash 464635188, now seen corresponding path program 2 times [2024-11-11 15:59:36,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:36,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760435103] [2024-11-11 15:59:36,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 15:59:36,527 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-11 15:59:36,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:36,528 INFO L229 MonitoredProcess]: Starting monitored process 15 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-11 15:59:36,530 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 (15)] Waiting until timeout for monitored process [2024-11-11 15:59:36,580 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 15:59:36,580 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:59:36,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 15:59:36,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 15:59:36,738 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:59:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-11 15:59:36,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:36,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760435103] [2024-11-11 15:59:36,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760435103] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:59:36,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:59:36,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2024-11-11 15:59:36,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055211663] [2024-11-11 15:59:36,817 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:59:36,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 15:59:36,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:36,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 15:59:36,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 15:59:36,819 INFO L87 Difference]: Start difference. First operand 559 states and 838 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:37,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:37,150 INFO L93 Difference]: Finished difference Result 1370 states and 1973 transitions. [2024-11-11 15:59:37,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-11 15:59:37,150 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-11 15:59:37,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:37,154 INFO L225 Difference]: With dead ends: 1370 [2024-11-11 15:59:37,154 INFO L226 Difference]: Without dead ends: 834 [2024-11-11 15:59:37,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2024-11-11 15:59:37,155 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 228 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:37,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 358 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:59:37,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-11-11 15:59:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 500. [2024-11-11 15:59:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 499 states have (on average 1.4388777555110221) internal successors, (718), 499 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:37,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 718 transitions. [2024-11-11 15:59:37,194 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 718 transitions. Word has length 70 [2024-11-11 15:59:37,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:37,195 INFO L471 AbstractCegarLoop]: Abstraction has 500 states and 718 transitions. [2024-11-11 15:59:37,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:37,195 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 718 transitions. [2024-11-11 15:59:37,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 15:59:37,196 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:37,196 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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-11 15:59:37,199 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 (15)] Forceful destruction successful, exit code 0 [2024-11-11 15:59:37,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-11 15:59:37,397 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:37,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:37,397 INFO L85 PathProgramCache]: Analyzing trace with hash 605183798, now seen corresponding path program 3 times [2024-11-11 15:59:37,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:37,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902592304] [2024-11-11 15:59:37,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-11 15:59:37,398 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-11 15:59:37,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:37,399 INFO L229 MonitoredProcess]: Starting monitored process 16 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-11 15:59:37,400 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 (16)] Waiting until timeout for monitored process [2024-11-11 15:59:37,460 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-11-11 15:59:37,460 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 15:59:37,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-11 15:59:37,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:40,179 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:59:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 15:59:42,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:42,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902592304] [2024-11-11 15:59:42,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902592304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:59:42,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:59:42,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 45 [2024-11-11 15:59:42,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020549301] [2024-11-11 15:59:42,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:59:42,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-11-11 15:59:42,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:42,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-11-11 15:59:42,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1831, Unknown=0, NotChecked=0, Total=1980 [2024-11-11 15:59:42,089 INFO L87 Difference]: Start difference. First operand 500 states and 718 transitions. Second operand has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:57,123 INFO L93 Difference]: Finished difference Result 1400 states and 1934 transitions. [2024-11-11 15:59:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2024-11-11 15:59:57,124 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-11 15:59:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:57,128 INFO L225 Difference]: With dead ends: 1400 [2024-11-11 15:59:57,128 INFO L226 Difference]: Without dead ends: 1312 [2024-11-11 15:59:57,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5089 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=3344, Invalid=18412, Unknown=0, NotChecked=0, Total=21756 [2024-11-11 15:59:57,136 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 2304 mSDsluCounter, 7666 mSDsCounter, 0 mSdLazyCounter, 5116 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2304 SdHoareTripleChecker+Valid, 8050 SdHoareTripleChecker+Invalid, 5230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 5116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:57,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2304 Valid, 8050 Invalid, 5230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 5116 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-11 15:59:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-11 15:59:57,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 861. [2024-11-11 15:59:57,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 860 states have (on average 1.45) internal successors, (1247), 860 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:57,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1247 transitions. [2024-11-11 15:59:57,196 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1247 transitions. Word has length 70 [2024-11-11 15:59:57,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:57,197 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1247 transitions. [2024-11-11 15:59:57,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 3.066666666666667) internal successors, (138), 45 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:57,197 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1247 transitions. [2024-11-11 15:59:57,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-11 15:59:57,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:57,201 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 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-11 15:59:57,205 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 (16)] Ended with exit code 0 [2024-11-11 15:59:57,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-11 15:59:57,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:57,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:57,402 INFO L85 PathProgramCache]: Analyzing trace with hash 824038516, now seen corresponding path program 1 times [2024-11-11 15:59:57,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:57,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683396054] [2024-11-11 15:59:57,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:57,403 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-11 15:59:57,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:57,406 INFO L229 MonitoredProcess]: Starting monitored process 17 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-11 15:59:57,407 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 (17)] Waiting until timeout for monitored process [2024-11-11 15:59:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:57,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 15:59:57,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 15:59:57,505 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 15:59:57,505 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 15:59:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 58 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 15:59:57,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 15:59:57,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683396054] [2024-11-11 15:59:57,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683396054] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 15:59:57,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 15:59:57,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2024-11-11 15:59:57,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302838402] [2024-11-11 15:59:57,552 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 15:59:57,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 15:59:57,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 15:59:57,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 15:59:57,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:59:57,553 INFO L87 Difference]: Start difference. First operand 861 states and 1247 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 15:59:57,729 INFO L93 Difference]: Finished difference Result 1778 states and 2589 transitions. [2024-11-11 15:59:57,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 15:59:57,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-11 15:59:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 15:59:57,733 INFO L225 Difference]: With dead ends: 1778 [2024-11-11 15:59:57,733 INFO L226 Difference]: Without dead ends: 937 [2024-11-11 15:59:57,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 15:59:57,734 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 33 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 15:59:57,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 81 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 15:59:57,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2024-11-11 15:59:57,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 781. [2024-11-11 15:59:57,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 780 states have (on average 1.405128205128205) internal successors, (1096), 780 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:57,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1096 transitions. [2024-11-11 15:59:57,791 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1096 transitions. Word has length 70 [2024-11-11 15:59:57,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 15:59:57,791 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1096 transitions. [2024-11-11 15:59:57,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 15:59:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1096 transitions. [2024-11-11 15:59:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 15:59:57,793 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 15:59:57,793 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 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-11 15:59:57,797 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 (17)] Ended with exit code 0 [2024-11-11 15:59:57,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-11 15:59:57,997 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 15:59:57,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 15:59:57,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1235371034, now seen corresponding path program 1 times [2024-11-11 15:59:57,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-11 15:59:57,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [667936634] [2024-11-11 15:59:57,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 15:59:57,998 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-11 15:59:57,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-11 15:59:58,001 INFO L229 MonitoredProcess]: Starting monitored process 18 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-11 15:59:58,002 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 (18)] Waiting until timeout for monitored process [2024-11-11 15:59:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 15:59:58,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-11 15:59:58,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:00:00,739 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:00:00,740 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:00:02,959 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:00:02,959 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-11 16:00:02,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [667936634] [2024-11-11 16:00:02,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [667936634] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:00:02,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-11 16:00:02,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2024-11-11 16:00:02,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784768823] [2024-11-11 16:00:02,960 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-11 16:00:02,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-11 16:00:02,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-11 16:00:02,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-11 16:00:02,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1921, Unknown=0, NotChecked=0, Total=2070 [2024-11-11 16:00:02,962 INFO L87 Difference]: Start difference. First operand 781 states and 1096 transitions. Second operand has 46 states, 46 states have (on average 3.1739130434782608) internal successors, (146), 46 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)