./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-10 22:27:55,538 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:27:55,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:27:55,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:27:55,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:27:55,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:27:55,656 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:27:55,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:27:55,657 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:27:55,662 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:27:55,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:27:55,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:27:55,679 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:27:55,679 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:27:55,679 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:27:55,680 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:27:55,680 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:27:55,680 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:27:55,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:27:55,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:27:55,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:27:55,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:27:55,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:27:55,682 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:27:55,683 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:27:55,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:27:55,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:27:55,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:27:55,684 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:27:55,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:27:55,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:27:55,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:27:55,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:27:55,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:27:55,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:27:55,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:27:55,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:27:55,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:27:55,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:27:55,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:27:55,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:27:55,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:27:55,687 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-clean/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-clean/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-10-10 22:27:55,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:27:55,938 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:27:55,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:27:55,942 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:27:55,942 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:27:55,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-10-10 22:27:57,214 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:27:57,387 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:27:57,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-10-10 22:27:57,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4445e27ce/7c488c8ee8ab405aa0d0229a41d79ffc/FLAG66da5a020 [2024-10-10 22:27:57,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4445e27ce/7c488c8ee8ab405aa0d0229a41d79ffc [2024-10-10 22:27:57,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:27:57,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:27:57,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:27:57,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:27:57,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:27:57,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:27:57" (1/1) ... [2024-10-10 22:27:57,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4faabe47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:57, skipping insertion in model container [2024-10-10 22:27:57,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:27:57" (1/1) ... [2024-10-10 22:27:57,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:27:58,022 WARN L248 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-10-10 22:27:58,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:27:58,106 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:27:58,115 WARN L248 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-10-10 22:27:58,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:27:58,170 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:27:58,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58 WrapperNode [2024-10-10 22:27:58,176 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:27:58,177 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:27:58,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:27:58,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:27:58,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (1/1) ... [2024-10-10 22:27:58,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (1/1) ... [2024-10-10 22:27:58,256 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 147 [2024-10-10 22:27:58,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:27:58,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:27:58,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:27:58,257 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:27:58,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (1/1) ... [2024-10-10 22:27:58,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (1/1) ... [2024-10-10 22:27:58,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (1/1) ... [2024-10-10 22:27:58,305 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-10-10 22:27:58,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (1/1) ... [2024-10-10 22:27:58,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (1/1) ... [2024-10-10 22:27:58,323 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (1/1) ... [2024-10-10 22:27:58,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (1/1) ... [2024-10-10 22:27:58,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (1/1) ... [2024-10-10 22:27:58,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (1/1) ... [2024-10-10 22:27:58,345 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:27:58,346 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:27:58,346 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:27:58,346 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:27:58,347 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (1/1) ... [2024-10-10 22:27:58,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:27:58,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:27:58,385 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:27:58,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:27:58,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:27:58,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:27:58,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:27:58,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:27:58,492 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:27:58,493 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:27:58,729 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-10-10 22:27:58,730 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:27:58,757 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:27:58,757 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 22:27:58,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:27:58 BoogieIcfgContainer [2024-10-10 22:27:58,758 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:27:58,759 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:27:58,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:27:58,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:27:58,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:27:57" (1/3) ... [2024-10-10 22:27:58,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706bd6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:27:58, skipping insertion in model container [2024-10-10 22:27:58,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:27:58" (2/3) ... [2024-10-10 22:27:58,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@706bd6de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:27:58, skipping insertion in model container [2024-10-10 22:27:58,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:27:58" (3/3) ... [2024-10-10 22:27:58,764 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2024-10-10 22:27:58,776 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:27:58,777 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:27:58,822 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:27:58,827 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;@6993adfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:27:58,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:27:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 46 states have internal predecessors, (82), 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-10-10 22:27:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:27:58,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:27:58,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:27:58,836 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:27:58,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:27:58,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1580274276, now seen corresponding path program 1 times [2024-10-10 22:27:58,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:27:58,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536349519] [2024-10-10 22:27:58,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:27:58,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:27:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:27:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:27:59,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:27:59,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536349519] [2024-10-10 22:27:59,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536349519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:27:59,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:27:59,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:27:59,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60862438] [2024-10-10 22:27:59,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:27:59,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:27:59,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:27:59,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:27:59,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:27:59,035 INFO L87 Difference]: Start difference. First operand has 47 states, 45 states have (on average 1.8222222222222222) internal successors, (82), 46 states have internal predecessors, (82), 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.5) internal successors, (13), 2 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-10-10 22:27:59,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:27:59,062 INFO L93 Difference]: Finished difference Result 68 states and 115 transitions. [2024-10-10 22:27:59,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:27:59,064 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-10-10 22:27:59,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:27:59,070 INFO L225 Difference]: With dead ends: 68 [2024-10-10 22:27:59,070 INFO L226 Difference]: Without dead ends: 45 [2024-10-10 22:27:59,072 INFO L431 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-10-10 22:27:59,075 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 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-10-10 22:27:59,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:27:59,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-10 22:27:59,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-10 22:27:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.75) internal successors, (77), 44 states have internal predecessors, (77), 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-10-10 22:27:59,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 77 transitions. [2024-10-10 22:27:59,100 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 77 transitions. Word has length 13 [2024-10-10 22:27:59,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:27:59,101 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 77 transitions. [2024-10-10 22:27:59,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 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-10-10 22:27:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2024-10-10 22:27:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-10 22:27:59,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:27:59,103 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:27:59,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:27:59,103 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:27:59,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:27:59,104 INFO L85 PathProgramCache]: Analyzing trace with hash 388665470, now seen corresponding path program 1 times [2024-10-10 22:27:59,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:27:59,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762449440] [2024-10-10 22:27:59,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:27:59,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:27:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:27:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:27:59,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:27:59,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762449440] [2024-10-10 22:27:59,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762449440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:27:59,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:27:59,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:27:59,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239555304] [2024-10-10 22:27:59,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:27:59,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:27:59,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:27:59,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:27:59,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:27:59,282 INFO L87 Difference]: Start difference. First operand 45 states and 77 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-10-10 22:27:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:27:59,425 INFO L93 Difference]: Finished difference Result 104 states and 183 transitions. [2024-10-10 22:27:59,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:27:59,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-10-10 22:27:59,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:27:59,427 INFO L225 Difference]: With dead ends: 104 [2024-10-10 22:27:59,427 INFO L226 Difference]: Without dead ends: 68 [2024-10-10 22:27:59,427 INFO L431 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-10-10 22:27:59,429 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 24 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:27:59,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 82 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:27:59,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-10 22:27:59,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2024-10-10 22:27:59,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.5692307692307692) internal successors, (102), 65 states have internal predecessors, (102), 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-10-10 22:27:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 102 transitions. [2024-10-10 22:27:59,439 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 102 transitions. Word has length 13 [2024-10-10 22:27:59,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:27:59,439 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 102 transitions. [2024-10-10 22:27:59,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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-10-10 22:27:59,440 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 102 transitions. [2024-10-10 22:27:59,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-10 22:27:59,440 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:27:59,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:27:59,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:27:59,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:27:59,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:27:59,441 INFO L85 PathProgramCache]: Analyzing trace with hash -920391629, now seen corresponding path program 1 times [2024-10-10 22:27:59,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:27:59,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965634718] [2024-10-10 22:27:59,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:27:59,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:27:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:27:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:27:59,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:27:59,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965634718] [2024-10-10 22:27:59,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965634718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:27:59,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:27:59,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:27:59,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817722687] [2024-10-10 22:27:59,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:27:59,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:27:59,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:27:59,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:27:59,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:27:59,571 INFO L87 Difference]: Start difference. First operand 66 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-10-10 22:27:59,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:27:59,817 INFO L93 Difference]: Finished difference Result 161 states and 276 transitions. [2024-10-10 22:27:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:27:59,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-10-10 22:27:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:27:59,819 INFO L225 Difference]: With dead ends: 161 [2024-10-10 22:27:59,819 INFO L226 Difference]: Without dead ends: 125 [2024-10-10 22:27:59,820 INFO L431 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-10-10 22:27:59,821 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 92 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:27:59,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 108 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:27:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-10 22:27:59,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2024-10-10 22:27:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.5568181818181819) internal successors, (137), 88 states have internal predecessors, (137), 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-10-10 22:27:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 137 transitions. [2024-10-10 22:27:59,831 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 137 transitions. Word has length 19 [2024-10-10 22:27:59,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:27:59,831 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 137 transitions. [2024-10-10 22:27:59,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-10-10 22:27:59,831 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 137 transitions. [2024-10-10 22:27:59,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-10 22:27:59,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:27:59,832 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:27:59,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:27:59,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:27:59,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:27:59,834 INFO L85 PathProgramCache]: Analyzing trace with hash 414964068, now seen corresponding path program 1 times [2024-10-10 22:27:59,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:27:59,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201868638] [2024-10-10 22:27:59,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:27:59,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:27:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:27:59,971 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:27:59,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:27:59,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201868638] [2024-10-10 22:27:59,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201868638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:27:59,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:27:59,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:27:59,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883070619] [2024-10-10 22:27:59,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:27:59,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:27:59,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:27:59,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:27:59,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:27:59,973 INFO L87 Difference]: Start difference. First operand 89 states and 137 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-10-10 22:28:00,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:00,116 INFO L93 Difference]: Finished difference Result 231 states and 351 transitions. [2024-10-10 22:28:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:28:00,117 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 25 [2024-10-10 22:28:00,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:00,118 INFO L225 Difference]: With dead ends: 231 [2024-10-10 22:28:00,118 INFO L226 Difference]: Without dead ends: 154 [2024-10-10 22:28:00,119 INFO L431 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-10-10 22:28:00,119 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 70 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:00,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 172 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:00,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-10 22:28:00,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 97. [2024-10-10 22:28:00,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.5208333333333333) internal successors, (146), 96 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) [2024-10-10 22:28:00,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 146 transitions. [2024-10-10 22:28:00,130 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 146 transitions. Word has length 25 [2024-10-10 22:28:00,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:00,130 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 146 transitions. [2024-10-10 22:28:00,130 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-10-10 22:28:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 146 transitions. [2024-10-10 22:28:00,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-10 22:28:00,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:00,132 INFO L215 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] [2024-10-10 22:28:00,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:28:00,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:00,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash 983673701, now seen corresponding path program 1 times [2024-10-10 22:28:00,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:00,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482184447] [2024-10-10 22:28:00,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:28:00,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:00,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482184447] [2024-10-10 22:28:00,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482184447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:00,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:00,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:28:00,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308592475] [2024-10-10 22:28:00,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:00,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:00,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:00,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:00,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:28:00,297 INFO L87 Difference]: Start difference. First operand 97 states and 146 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-10-10 22:28:00,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:00,552 INFO L93 Difference]: Finished difference Result 252 states and 377 transitions. [2024-10-10 22:28:00,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:28:00,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-10-10 22:28:00,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:00,554 INFO L225 Difference]: With dead ends: 252 [2024-10-10 22:28:00,554 INFO L226 Difference]: Without dead ends: 174 [2024-10-10 22:28:00,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-10 22:28:00,555 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 74 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 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.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:00,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 180 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-10 22:28:00,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 107. [2024-10-10 22:28:00,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.5) internal successors, (159), 106 states have internal predecessors, (159), 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-10-10 22:28:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 159 transitions. [2024-10-10 22:28:00,562 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 159 transitions. Word has length 26 [2024-10-10 22:28:00,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:00,562 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 159 transitions. [2024-10-10 22:28:00,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-10-10 22:28:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 159 transitions. [2024-10-10 22:28:00,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:28:00,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:00,564 INFO L215 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-10-10 22:28:00,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:28:00,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:00,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:00,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1858982925, now seen corresponding path program 1 times [2024-10-10 22:28:00,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:00,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488299436] [2024-10-10 22:28:00,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:00,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:00,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:00,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488299436] [2024-10-10 22:28:00,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488299436] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:00,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094340844] [2024-10-10 22:28:00,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:00,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:00,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:00,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:00,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:28:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:00,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:28:00,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-10 22:28:00,820 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:00,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094340844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:00,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:00,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-10-10 22:28:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510387773] [2024-10-10 22:28:00,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:00,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:00,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:00,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:00,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-10 22:28:00,824 INFO L87 Difference]: Start difference. First operand 107 states and 159 transitions. Second operand has 5 states, 5 states have (on average 4.8) 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-10-10 22:28:01,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:01,038 INFO L93 Difference]: Finished difference Result 374 states and 580 transitions. [2024-10-10 22:28:01,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:28:01,038 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) 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 27 [2024-10-10 22:28:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:01,043 INFO L225 Difference]: With dead ends: 374 [2024-10-10 22:28:01,043 INFO L226 Difference]: Without dead ends: 282 [2024-10-10 22:28:01,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:28:01,044 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 129 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:01,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 329 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-10-10 22:28:01,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 187. [2024-10-10 22:28:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.478494623655914) internal successors, (275), 186 states have internal predecessors, (275), 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-10-10 22:28:01,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 275 transitions. [2024-10-10 22:28:01,062 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 275 transitions. Word has length 27 [2024-10-10 22:28:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:01,062 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 275 transitions. [2024-10-10 22:28:01,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) 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-10-10 22:28:01,063 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 275 transitions. [2024-10-10 22:28:01,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 22:28:01,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:01,063 INFO L215 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-10-10 22:28:01,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:28:01,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:01,264 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:01,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:01,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2099761446, now seen corresponding path program 1 times [2024-10-10 22:28:01,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:01,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069110713] [2024-10-10 22:28:01,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:01,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:01,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:01,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069110713] [2024-10-10 22:28:01,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069110713] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:01,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917424390] [2024-10-10 22:28:01,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:01,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:01,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:01,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:01,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:28:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:01,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:28:01,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:28:01,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:01,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917424390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:01,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:01,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2024-10-10 22:28:01,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948926770] [2024-10-10 22:28:01,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:01,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:01,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:01,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:01,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:01,544 INFO L87 Difference]: Start difference. First operand 187 states and 275 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-10-10 22:28:01,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:01,674 INFO L93 Difference]: Finished difference Result 423 states and 659 transitions. [2024-10-10 22:28:01,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:28:01,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-10-10 22:28:01,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:01,675 INFO L225 Difference]: With dead ends: 423 [2024-10-10 22:28:01,675 INFO L226 Difference]: Without dead ends: 262 [2024-10-10 22:28:01,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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-10-10 22:28:01,678 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 37 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:01,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 143 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:01,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-10 22:28:01,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 233. [2024-10-10 22:28:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 1.4008620689655173) internal successors, (325), 232 states have internal predecessors, (325), 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-10-10 22:28:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 325 transitions. [2024-10-10 22:28:01,688 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 325 transitions. Word has length 28 [2024-10-10 22:28:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:01,688 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 325 transitions. [2024-10-10 22:28:01,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-10-10 22:28:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 325 transitions. [2024-10-10 22:28:01,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-10 22:28:01,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:01,689 INFO L215 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] [2024-10-10 22:28:01,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 22:28:01,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:01,890 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:01,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:01,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1093714447, now seen corresponding path program 1 times [2024-10-10 22:28:01,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:01,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904659665] [2024-10-10 22:28:01,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:01,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:01,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:02,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904659665] [2024-10-10 22:28:02,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904659665] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:02,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690441628] [2024-10-10 22:28:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:02,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:02,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:02,023 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:02,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:28:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:02,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:28:02,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:28:02,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:02,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690441628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:02,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:02,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-10-10 22:28:02,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765655445] [2024-10-10 22:28:02,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:02,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:02,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:02,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:02,122 INFO L87 Difference]: Start difference. First operand 233 states and 325 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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-10-10 22:28:02,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:02,276 INFO L93 Difference]: Finished difference Result 515 states and 747 transitions. [2024-10-10 22:28:02,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:28:02,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 34 [2024-10-10 22:28:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:02,278 INFO L225 Difference]: With dead ends: 515 [2024-10-10 22:28:02,278 INFO L226 Difference]: Without dead ends: 320 [2024-10-10 22:28:02,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 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-10-10 22:28:02,280 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 36 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:02,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 143 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2024-10-10 22:28:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 273. [2024-10-10 22:28:02,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 1.3713235294117647) internal successors, (373), 272 states have internal predecessors, (373), 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-10-10 22:28:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 373 transitions. [2024-10-10 22:28:02,292 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 373 transitions. Word has length 34 [2024-10-10 22:28:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:02,292 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 373 transitions. [2024-10-10 22:28:02,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-10-10 22:28:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 373 transitions. [2024-10-10 22:28:02,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-10 22:28:02,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:02,296 INFO L215 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] [2024-10-10 22:28:02,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:28:02,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:02,497 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:02,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:02,497 INFO L85 PathProgramCache]: Analyzing trace with hash -985440832, now seen corresponding path program 1 times [2024-10-10 22:28:02,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:02,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490368241] [2024-10-10 22:28:02,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:02,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:02,642 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-10 22:28:02,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:02,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490368241] [2024-10-10 22:28:02,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490368241] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:02,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:02,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:28:02,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184249832] [2024-10-10 22:28:02,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:02,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:28:02,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:02,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:28:02,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:02,643 INFO L87 Difference]: Start difference. First operand 273 states and 373 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 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-10-10 22:28:02,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:02,673 INFO L93 Difference]: Finished difference Result 428 states and 578 transitions. [2024-10-10 22:28:02,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:28:02,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 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 40 [2024-10-10 22:28:02,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:02,677 INFO L225 Difference]: With dead ends: 428 [2024-10-10 22:28:02,677 INFO L226 Difference]: Without dead ends: 157 [2024-10-10 22:28:02,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10-10 22:28:02,678 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 68 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:02,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-10 22:28:02,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2024-10-10 22:28:02,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 156 states have internal predecessors, (207), 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-10-10 22:28:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 207 transitions. [2024-10-10 22:28:02,698 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 207 transitions. Word has length 40 [2024-10-10 22:28:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:02,699 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 207 transitions. [2024-10-10 22:28:02,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 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-10-10 22:28:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 207 transitions. [2024-10-10 22:28:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-10 22:28:02,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:02,700 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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-10-10 22:28:02,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:28:02,704 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:02,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:02,705 INFO L85 PathProgramCache]: Analyzing trace with hash -638350254, now seen corresponding path program 1 times [2024-10-10 22:28:02,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:02,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710284767] [2024-10-10 22:28:02,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:02,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:02,898 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:28:02,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:02,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710284767] [2024-10-10 22:28:02,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710284767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:02,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:02,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:28:02,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418616181] [2024-10-10 22:28:02,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:02,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:28:02,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:02,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:28:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:02,903 INFO L87 Difference]: Start difference. First operand 157 states and 207 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-10-10 22:28:03,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:03,174 INFO L93 Difference]: Finished difference Result 330 states and 435 transitions. [2024-10-10 22:28:03,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:28:03,175 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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 51 [2024-10-10 22:28:03,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:03,176 INFO L225 Difference]: With dead ends: 330 [2024-10-10 22:28:03,176 INFO L226 Difference]: Without dead ends: 186 [2024-10-10 22:28:03,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:03,177 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 74 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:03,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 103 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:03,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-10-10 22:28:03,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 151. [2024-10-10 22:28:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.32) internal successors, (198), 150 states have internal predecessors, (198), 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-10-10 22:28:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 198 transitions. [2024-10-10 22:28:03,185 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 198 transitions. Word has length 51 [2024-10-10 22:28:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:03,186 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 198 transitions. [2024-10-10 22:28:03,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 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-10-10 22:28:03,186 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 198 transitions. [2024-10-10 22:28:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-10 22:28:03,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:03,187 INFO L215 NwaCegarLoop]: trace histogram [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-10-10 22:28:03,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:28:03,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:03,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:03,188 INFO L85 PathProgramCache]: Analyzing trace with hash -22924015, now seen corresponding path program 1 times [2024-10-10 22:28:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:03,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70745539] [2024-10-10 22:28:03,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:03,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 22:28:03,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:03,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70745539] [2024-10-10 22:28:03,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70745539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:03,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:03,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:28:03,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854106321] [2024-10-10 22:28:03,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:03,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:28:03,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:03,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:28:03,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:03,268 INFO L87 Difference]: Start difference. First operand 151 states and 198 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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-10-10 22:28:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:03,283 INFO L93 Difference]: Finished difference Result 223 states and 287 transitions. [2024-10-10 22:28:03,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:28:03,284 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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 59 [2024-10-10 22:28:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:03,285 INFO L225 Difference]: With dead ends: 223 [2024-10-10 22:28:03,285 INFO L226 Difference]: Without dead ends: 183 [2024-10-10 22:28:03,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:03,286 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:03,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 136 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-10 22:28:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 170. [2024-10-10 22:28:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 169 states have (on average 1.3076923076923077) internal successors, (221), 169 states have internal predecessors, (221), 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-10-10 22:28:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 221 transitions. [2024-10-10 22:28:03,294 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 221 transitions. Word has length 59 [2024-10-10 22:28:03,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:03,294 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 221 transitions. [2024-10-10 22:28:03,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 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-10-10 22:28:03,295 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 221 transitions. [2024-10-10 22:28:03,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-10 22:28:03,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:03,295 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 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, 1] [2024-10-10 22:28:03,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:28:03,296 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:03,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash -840572465, now seen corresponding path program 1 times [2024-10-10 22:28:03,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:03,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935391945] [2024-10-10 22:28:03,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:03,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:03,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:03,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935391945] [2024-10-10 22:28:03,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935391945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:03,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202336679] [2024-10-10 22:28:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:03,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:03,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:03,602 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:03,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:28:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:03,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-10 22:28:03,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2024-10-10 22:28:03,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:03,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202336679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:03,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:03,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 10 [2024-10-10 22:28:03,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51484257] [2024-10-10 22:28:03,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:03,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:03,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:03,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:03,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:28:03,765 INFO L87 Difference]: Start difference. First operand 170 states and 221 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 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-10-10 22:28:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:03,842 INFO L93 Difference]: Finished difference Result 319 states and 417 transitions. [2024-10-10 22:28:03,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:03,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 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 59 [2024-10-10 22:28:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:03,843 INFO L225 Difference]: With dead ends: 319 [2024-10-10 22:28:03,843 INFO L226 Difference]: Without dead ends: 152 [2024-10-10 22:28:03,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:28:03,845 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:03,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 100 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:03,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-10 22:28:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2024-10-10 22:28:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3093525179856116) internal successors, (182), 139 states have internal predecessors, (182), 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-10-10 22:28:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2024-10-10 22:28:03,853 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 59 [2024-10-10 22:28:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:03,853 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2024-10-10 22:28:03,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 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-10-10 22:28:03,853 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2024-10-10 22:28:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-10 22:28:03,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:03,855 INFO L215 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] [2024-10-10 22:28:03,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 22:28:04,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-10 22:28:04,056 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:04,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1162211213, now seen corresponding path program 1 times [2024-10-10 22:28:04,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:04,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065026578] [2024-10-10 22:28:04,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:04,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-10 22:28:04,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:04,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065026578] [2024-10-10 22:28:04,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065026578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:04,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:04,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:28:04,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458381285] [2024-10-10 22:28:04,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:04,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:04,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:04,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:04,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:04,242 INFO L87 Difference]: Start difference. First operand 140 states and 182 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-10-10 22:28:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:04,452 INFO L93 Difference]: Finished difference Result 506 states and 658 transitions. [2024-10-10 22:28:04,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:28:04,453 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 66 [2024-10-10 22:28:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:04,455 INFO L225 Difference]: With dead ends: 506 [2024-10-10 22:28:04,455 INFO L226 Difference]: Without dead ends: 384 [2024-10-10 22:28:04,455 INFO L431 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-10-10 22:28:04,455 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 125 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:04,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 219 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:04,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-10 22:28:04,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 140. [2024-10-10 22:28:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.3093525179856116) internal successors, (182), 139 states have internal predecessors, (182), 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-10-10 22:28:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 182 transitions. [2024-10-10 22:28:04,464 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 182 transitions. Word has length 66 [2024-10-10 22:28:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:04,465 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 182 transitions. [2024-10-10 22:28:04,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-10-10 22:28:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2024-10-10 22:28:04,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-10 22:28:04,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:04,465 INFO L215 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] [2024-10-10 22:28:04,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:28:04,466 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:04,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:04,466 INFO L85 PathProgramCache]: Analyzing trace with hash -828678827, now seen corresponding path program 1 times [2024-10-10 22:28:04,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:04,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737423298] [2024-10-10 22:28:04,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:04,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:04,670 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-10-10 22:28:04,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:04,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737423298] [2024-10-10 22:28:04,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737423298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:04,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:28:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758047461] [2024-10-10 22:28:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:04,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:04,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:04,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:04,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:04,672 INFO L87 Difference]: Start difference. First operand 140 states and 182 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-10-10 22:28:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:04,765 INFO L93 Difference]: Finished difference Result 406 states and 525 transitions. [2024-10-10 22:28:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:28:04,765 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 67 [2024-10-10 22:28:04,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:04,766 INFO L225 Difference]: With dead ends: 406 [2024-10-10 22:28:04,766 INFO L226 Difference]: Without dead ends: 284 [2024-10-10 22:28:04,767 INFO L431 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-10-10 22:28:04,767 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 135 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:04,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 183 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:04,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-10 22:28:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 214. [2024-10-10 22:28:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.2910798122065728) internal successors, (275), 213 states have internal predecessors, (275), 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-10-10 22:28:04,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 275 transitions. [2024-10-10 22:28:04,779 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 275 transitions. Word has length 67 [2024-10-10 22:28:04,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:04,779 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 275 transitions. [2024-10-10 22:28:04,779 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-10-10 22:28:04,779 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 275 transitions. [2024-10-10 22:28:04,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-10 22:28:04,780 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:04,780 INFO L215 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] [2024-10-10 22:28:04,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:28:04,780 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:04,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:04,781 INFO L85 PathProgramCache]: Analyzing trace with hash 166642583, now seen corresponding path program 1 times [2024-10-10 22:28:04,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:04,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812468282] [2024-10-10 22:28:04,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:04,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:04,918 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-10 22:28:04,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:04,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812468282] [2024-10-10 22:28:04,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812468282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:04,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:04,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:28:04,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223931690] [2024-10-10 22:28:04,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:04,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:28:04,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:04,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:28:04,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:04,920 INFO L87 Difference]: Start difference. First operand 214 states and 275 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-10-10 22:28:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:05,201 INFO L93 Difference]: Finished difference Result 1017 states and 1299 transitions. [2024-10-10 22:28:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-10 22:28:05,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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 67 [2024-10-10 22:28:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:05,203 INFO L225 Difference]: With dead ends: 1017 [2024-10-10 22:28:05,203 INFO L226 Difference]: Without dead ends: 821 [2024-10-10 22:28:05,204 INFO L431 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-10-10 22:28:05,204 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 188 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:05,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 337 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:05,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-10-10 22:28:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 214. [2024-10-10 22:28:05,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.2910798122065728) internal successors, (275), 213 states have internal predecessors, (275), 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-10-10 22:28:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 275 transitions. [2024-10-10 22:28:05,221 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 275 transitions. Word has length 67 [2024-10-10 22:28:05,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:05,221 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 275 transitions. [2024-10-10 22:28:05,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-10-10 22:28:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 275 transitions. [2024-10-10 22:28:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-10 22:28:05,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:05,223 INFO L215 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] [2024-10-10 22:28:05,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:28:05,223 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:05,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:05,225 INFO L85 PathProgramCache]: Analyzing trace with hash -512629671, now seen corresponding path program 1 times [2024-10-10 22:28:05,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:05,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130238297] [2024-10-10 22:28:05,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:05,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:05,465 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-10 22:28:05,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:05,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130238297] [2024-10-10 22:28:05,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130238297] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:05,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594219349] [2024-10-10 22:28:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:05,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:05,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:05,467 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:05,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 22:28:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:05,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-10 22:28:05,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:05,664 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 22:28:05,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 22:28:05,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594219349] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:05,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:05,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 18 [2024-10-10 22:28:05,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425428068] [2024-10-10 22:28:05,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:05,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-10 22:28:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:05,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-10 22:28:05,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-10-10 22:28:05,853 INFO L87 Difference]: Start difference. First operand 214 states and 275 transitions. Second operand has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 18 states have internal predecessors, (132), 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-10-10 22:28:06,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:06,750 INFO L93 Difference]: Finished difference Result 806 states and 1024 transitions. [2024-10-10 22:28:06,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-10 22:28:06,751 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 18 states have internal predecessors, (132), 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 67 [2024-10-10 22:28:06,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:06,754 INFO L225 Difference]: With dead ends: 806 [2024-10-10 22:28:06,754 INFO L226 Difference]: Without dead ends: 796 [2024-10-10 22:28:06,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=580, Invalid=2072, Unknown=0, NotChecked=0, Total=2652 [2024-10-10 22:28:06,755 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 531 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:06,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 767 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:28:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2024-10-10 22:28:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 383. [2024-10-10 22:28:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 382 states have (on average 1.2958115183246073) internal successors, (495), 382 states have internal predecessors, (495), 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-10-10 22:28:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 495 transitions. [2024-10-10 22:28:06,775 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 495 transitions. Word has length 67 [2024-10-10 22:28:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:06,775 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 495 transitions. [2024-10-10 22:28:06,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.947368421052632) internal successors, (132), 18 states have internal predecessors, (132), 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-10-10 22:28:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 495 transitions. [2024-10-10 22:28:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-10 22:28:06,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:06,776 INFO L215 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] [2024-10-10 22:28:06,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 22:28:06,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-10 22:28:06,977 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:06,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash -2024186088, now seen corresponding path program 1 times [2024-10-10 22:28:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796863446] [2024-10-10 22:28:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:07,089 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-10 22:28:07,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:07,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796863446] [2024-10-10 22:28:07,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796863446] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:07,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841554421] [2024-10-10 22:28:07,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:07,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:07,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:07,094 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:07,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 22:28:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:07,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-10 22:28:07,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-10 22:28:07,179 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:07,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841554421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:07,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:07,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-10 22:28:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158578548] [2024-10-10 22:28:07,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:07,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:07,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:07,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:07,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:07,180 INFO L87 Difference]: Start difference. First operand 383 states and 495 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-10-10 22:28:07,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:07,279 INFO L93 Difference]: Finished difference Result 954 states and 1230 transitions. [2024-10-10 22:28:07,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:28:07,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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 69 [2024-10-10 22:28:07,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:07,281 INFO L225 Difference]: With dead ends: 954 [2024-10-10 22:28:07,281 INFO L226 Difference]: Without dead ends: 589 [2024-10-10 22:28:07,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 70 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-10-10 22:28:07,282 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 30 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:07,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 135 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:07,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2024-10-10 22:28:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 565. [2024-10-10 22:28:07,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.2890070921985815) internal successors, (727), 564 states have internal predecessors, (727), 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-10-10 22:28:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 727 transitions. [2024-10-10 22:28:07,304 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 727 transitions. Word has length 69 [2024-10-10 22:28:07,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:07,304 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 727 transitions. [2024-10-10 22:28:07,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 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-10-10 22:28:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 727 transitions. [2024-10-10 22:28:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-10 22:28:07,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:07,305 INFO L215 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-10-10 22:28:07,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 22:28:07,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-10 22:28:07,510 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:07,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:07,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1760901293, now seen corresponding path program 1 times [2024-10-10 22:28:07,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:07,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760080335] [2024-10-10 22:28:07,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:07,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-10 22:28:07,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:07,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760080335] [2024-10-10 22:28:07,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760080335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:07,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334908648] [2024-10-10 22:28:07,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:07,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:07,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:07,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:07,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 22:28:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:07,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:28:07,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 22:28:07,964 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:07,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334908648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:07,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:07,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2024-10-10 22:28:07,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795640030] [2024-10-10 22:28:07,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:07,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:07,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:07,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:07,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:28:07,966 INFO L87 Difference]: Start difference. First operand 565 states and 727 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-10-10 22:28:08,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:08,012 INFO L93 Difference]: Finished difference Result 575 states and 739 transitions. [2024-10-10 22:28:08,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:08,012 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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 69 [2024-10-10 22:28:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:08,013 INFO L225 Difference]: With dead ends: 575 [2024-10-10 22:28:08,014 INFO L226 Difference]: Without dead ends: 571 [2024-10-10 22:28:08,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-10 22:28:08,015 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:08,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 200 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2024-10-10 22:28:08,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 568. [2024-10-10 22:28:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 567 states have (on average 1.289241622574956) internal successors, (731), 567 states have internal predecessors, (731), 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-10-10 22:28:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 731 transitions. [2024-10-10 22:28:08,037 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 731 transitions. Word has length 69 [2024-10-10 22:28:08,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:08,037 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 731 transitions. [2024-10-10 22:28:08,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 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-10-10 22:28:08,038 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 731 transitions. [2024-10-10 22:28:08,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-10 22:28:08,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:08,038 INFO L215 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-10-10 22:28:08,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-10 22:28:08,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-10 22:28:08,243 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:08,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1611861095, now seen corresponding path program 1 times [2024-10-10 22:28:08,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:08,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904537421] [2024-10-10 22:28:08,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:08,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-10 22:28:08,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:08,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904537421] [2024-10-10 22:28:08,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904537421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:08,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940923989] [2024-10-10 22:28:08,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:08,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:08,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:08,405 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:08,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 22:28:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:08,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-10 22:28:08,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:08,563 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 22:28:08,564 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 42 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 22:28:08,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940923989] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:08,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:08,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 17 [2024-10-10 22:28:08,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10226202] [2024-10-10 22:28:08,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:08,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-10 22:28:08,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:08,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-10 22:28:08,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:28:08,771 INFO L87 Difference]: Start difference. First operand 568 states and 731 transitions. Second operand has 17 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 17 states have internal predecessors, (120), 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-10-10 22:28:10,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:10,054 INFO L93 Difference]: Finished difference Result 2718 states and 3588 transitions. [2024-10-10 22:28:10,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-10-10 22:28:10,054 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 17 states have internal predecessors, (120), 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-10-10 22:28:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:10,059 INFO L225 Difference]: With dead ends: 2718 [2024-10-10 22:28:10,060 INFO L226 Difference]: Without dead ends: 2134 [2024-10-10 22:28:10,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=586, Invalid=1220, Unknown=0, NotChecked=0, Total=1806 [2024-10-10 22:28:10,062 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 785 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:10,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 260 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:28:10,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2024-10-10 22:28:10,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1758. [2024-10-10 22:28:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1758 states, 1757 states have (on average 1.3130335799658508) internal successors, (2307), 1757 states have internal predecessors, (2307), 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-10-10 22:28:10,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 2307 transitions. [2024-10-10 22:28:10,172 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 2307 transitions. Word has length 70 [2024-10-10 22:28:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:10,172 INFO L471 AbstractCegarLoop]: Abstraction has 1758 states and 2307 transitions. [2024-10-10 22:28:10,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.0588235294117645) internal successors, (120), 17 states have internal predecessors, (120), 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-10-10 22:28:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 2307 transitions. [2024-10-10 22:28:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-10 22:28:10,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:10,174 INFO L215 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, 1] [2024-10-10 22:28:10,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-10 22:28:10,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:10,379 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:10,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:10,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1247838098, now seen corresponding path program 1 times [2024-10-10 22:28:10,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:10,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874428739] [2024-10-10 22:28:10,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:10,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:10,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:28:10,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:10,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874428739] [2024-10-10 22:28:10,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874428739] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:10,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377362323] [2024-10-10 22:28:10,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:10,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:10,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:10,586 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:10,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 22:28:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:10,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-10 22:28:10,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:10,851 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 37 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:28:10,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:11,012 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:28:11,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377362323] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:11,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:11,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2024-10-10 22:28:11,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738928207] [2024-10-10 22:28:11,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:11,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-10 22:28:11,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:11,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-10 22:28:11,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:28:11,014 INFO L87 Difference]: Start difference. First operand 1758 states and 2307 transitions. Second operand has 16 states, 16 states have (on average 9.5625) internal successors, (153), 16 states have internal predecessors, (153), 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-10-10 22:28:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:12,806 INFO L93 Difference]: Finished difference Result 6954 states and 8595 transitions. [2024-10-10 22:28:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-10 22:28:12,806 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 9.5625) internal successors, (153), 16 states have internal predecessors, (153), 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-10-10 22:28:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:12,822 INFO L225 Difference]: With dead ends: 6954 [2024-10-10 22:28:12,822 INFO L226 Difference]: Without dead ends: 6950 [2024-10-10 22:28:12,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=697, Invalid=2273, Unknown=0, NotChecked=0, Total=2970 [2024-10-10 22:28:12,826 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 657 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:12,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1087 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:28:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6950 states. [2024-10-10 22:28:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6950 to 2137. [2024-10-10 22:28:12,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2137 states, 2136 states have (on average 1.372191011235955) internal successors, (2931), 2136 states have internal predecessors, (2931), 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-10-10 22:28:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 2931 transitions. [2024-10-10 22:28:12,958 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 2931 transitions. Word has length 70 [2024-10-10 22:28:12,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:12,958 INFO L471 AbstractCegarLoop]: Abstraction has 2137 states and 2931 transitions. [2024-10-10 22:28:12,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.5625) internal successors, (153), 16 states have internal predecessors, (153), 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-10-10 22:28:12,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 2931 transitions. [2024-10-10 22:28:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-10 22:28:12,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:12,960 INFO L215 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, 1] [2024-10-10 22:28:12,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-10 22:28:13,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:13,162 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:13,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:13,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1299406319, now seen corresponding path program 1 times [2024-10-10 22:28:13,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:13,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513941760] [2024-10-10 22:28:13,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:13,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:13,360 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-10 22:28:13,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:13,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513941760] [2024-10-10 22:28:13,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513941760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:13,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:13,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-10 22:28:13,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187319995] [2024-10-10 22:28:13,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:13,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:28:13,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:13,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:28:13,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:13,363 INFO L87 Difference]: Start difference. First operand 2137 states and 2931 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-10-10 22:28:13,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:13,810 INFO L93 Difference]: Finished difference Result 4186 states and 5707 transitions. [2024-10-10 22:28:13,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-10 22:28:13,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-10-10 22:28:13,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:13,817 INFO L225 Difference]: With dead ends: 4186 [2024-10-10 22:28:13,817 INFO L226 Difference]: Without dead ends: 2835 [2024-10-10 22:28:13,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-10 22:28:13,819 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 250 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:13,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 389 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:28:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2024-10-10 22:28:13,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2141. [2024-10-10 22:28:13,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2141 states, 2140 states have (on average 1.3714953271028036) internal successors, (2935), 2140 states have internal predecessors, (2935), 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-10-10 22:28:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 2935 transitions. [2024-10-10 22:28:13,918 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 2935 transitions. Word has length 70 [2024-10-10 22:28:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:13,918 INFO L471 AbstractCegarLoop]: Abstraction has 2141 states and 2935 transitions. [2024-10-10 22:28:13,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 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-10-10 22:28:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2935 transitions. [2024-10-10 22:28:13,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-10 22:28:13,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:13,920 INFO L215 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-10-10 22:28:13,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-10 22:28:13,920 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:13,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:13,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1385747165, now seen corresponding path program 1 times [2024-10-10 22:28:13,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:13,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294461734] [2024-10-10 22:28:13,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:13,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:14,134 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:28:14,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:14,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294461734] [2024-10-10 22:28:14,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294461734] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:14,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667804242] [2024-10-10 22:28:14,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:14,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:14,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:14,136 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:14,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-10 22:28:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:14,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-10 22:28:14,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:14,377 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 62 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:28:14,379 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:14,484 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 47 proven. 21 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-10 22:28:14,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667804242] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:14,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:14,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-10 22:28:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870499870] [2024-10-10 22:28:14,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:14,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-10 22:28:14,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:14,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-10 22:28:14,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-10-10 22:28:14,486 INFO L87 Difference]: Start difference. First operand 2141 states and 2935 transitions. Second operand has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 13 states have internal predecessors, (141), 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-10-10 22:28:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:14,997 INFO L93 Difference]: Finished difference Result 4256 states and 5638 transitions. [2024-10-10 22:28:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-10 22:28:14,997 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 13 states have internal predecessors, (141), 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-10-10 22:28:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:15,002 INFO L225 Difference]: With dead ends: 4256 [2024-10-10 22:28:15,002 INFO L226 Difference]: Without dead ends: 2141 [2024-10-10 22:28:15,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2024-10-10 22:28:15,004 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 324 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:15,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 647 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2141 states. [2024-10-10 22:28:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2141 to 1489. [2024-10-10 22:28:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1489 states, 1488 states have (on average 1.3178763440860215) internal successors, (1961), 1488 states have internal predecessors, (1961), 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-10-10 22:28:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1489 states to 1489 states and 1961 transitions. [2024-10-10 22:28:15,130 INFO L78 Accepts]: Start accepts. Automaton has 1489 states and 1961 transitions. Word has length 71 [2024-10-10 22:28:15,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:15,130 INFO L471 AbstractCegarLoop]: Abstraction has 1489 states and 1961 transitions. [2024-10-10 22:28:15,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.071428571428571) internal successors, (141), 13 states have internal predecessors, (141), 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-10-10 22:28:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 1489 states and 1961 transitions. [2024-10-10 22:28:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-10 22:28:15,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:15,132 INFO L215 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-10-10 22:28:15,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:15,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-10 22:28:15,336 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:15,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:15,337 INFO L85 PathProgramCache]: Analyzing trace with hash -834326429, now seen corresponding path program 2 times [2024-10-10 22:28:15,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:15,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406667749] [2024-10-10 22:28:15,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:15,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:28:15,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:15,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406667749] [2024-10-10 22:28:15,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406667749] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315597777] [2024-10-10 22:28:15,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:28:15,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:15,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:15,855 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:15,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-10 22:28:15,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:28:15,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:28:15,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-10 22:28:15,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:16,243 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:28:16,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:17,213 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:28:17,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315597777] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:17,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:17,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 22 [2024-10-10 22:28:17,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630024126] [2024-10-10 22:28:17,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:17,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-10 22:28:17,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:17,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-10 22:28:17,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-10-10 22:28:17,214 INFO L87 Difference]: Start difference. First operand 1489 states and 1961 transitions. Second operand has 22 states, 22 states have (on average 7.409090909090909) internal successors, (163), 22 states have internal predecessors, (163), 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-10-10 22:28:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:19,526 INFO L93 Difference]: Finished difference Result 7652 states and 9572 transitions. [2024-10-10 22:28:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-10-10 22:28:19,526 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 7.409090909090909) internal successors, (163), 22 states have internal predecessors, (163), 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-10-10 22:28:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:19,541 INFO L225 Difference]: With dead ends: 7652 [2024-10-10 22:28:19,541 INFO L226 Difference]: Without dead ends: 7635 [2024-10-10 22:28:19,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=650, Invalid=2772, Unknown=0, NotChecked=0, Total=3422 [2024-10-10 22:28:19,543 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 480 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:19,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 1274 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:28:19,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7635 states. [2024-10-10 22:28:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7635 to 2631. [2024-10-10 22:28:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2630 states have (on average 1.3406844106463878) internal successors, (3526), 2630 states have internal predecessors, (3526), 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-10-10 22:28:19,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3526 transitions. [2024-10-10 22:28:19,854 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3526 transitions. Word has length 71 [2024-10-10 22:28:19,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:19,854 INFO L471 AbstractCegarLoop]: Abstraction has 2631 states and 3526 transitions. [2024-10-10 22:28:19,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.409090909090909) internal successors, (163), 22 states have internal predecessors, (163), 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-10-10 22:28:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3526 transitions. [2024-10-10 22:28:19,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-10 22:28:19,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:19,860 INFO L215 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] [2024-10-10 22:28:19,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-10 22:28:20,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-10 22:28:20,060 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:20,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:20,061 INFO L85 PathProgramCache]: Analyzing trace with hash -390425755, now seen corresponding path program 1 times [2024-10-10 22:28:20,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:20,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865113] [2024-10-10 22:28:20,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:20,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:20,422 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 77 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:28:20,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:20,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865113] [2024-10-10 22:28:20,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865113] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:20,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280700422] [2024-10-10 22:28:20,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:20,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:20,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:20,427 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:20,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-10 22:28:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:20,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-10 22:28:20,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:20,707 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 60 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:28:20,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:28:20,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280700422] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:20,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:20,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2024-10-10 22:28:20,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789055171] [2024-10-10 22:28:20,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:20,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-10 22:28:20,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:20,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-10 22:28:20,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-10-10 22:28:20,937 INFO L87 Difference]: Start difference. First operand 2631 states and 3526 transitions. Second operand has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 20 states have internal predecessors, (180), 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-10-10 22:28:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:23,030 INFO L93 Difference]: Finished difference Result 6014 states and 7815 transitions. [2024-10-10 22:28:23,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-10 22:28:23,031 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 20 states have internal predecessors, (180), 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-10-10 22:28:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:23,042 INFO L225 Difference]: With dead ends: 6014 [2024-10-10 22:28:23,046 INFO L226 Difference]: Without dead ends: 5997 [2024-10-10 22:28:23,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=509, Invalid=2041, Unknown=0, NotChecked=0, Total=2550 [2024-10-10 22:28:23,052 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 413 mSDsluCounter, 1478 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:23,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1655 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:28:23,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5997 states. [2024-10-10 22:28:23,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5997 to 3072. [2024-10-10 22:28:23,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3071 states have (on average 1.3516769781830023) internal successors, (4151), 3071 states have internal predecessors, (4151), 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-10-10 22:28:23,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4151 transitions. [2024-10-10 22:28:23,229 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4151 transitions. Word has length 71 [2024-10-10 22:28:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:23,229 INFO L471 AbstractCegarLoop]: Abstraction has 3072 states and 4151 transitions. [2024-10-10 22:28:23,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 8.571428571428571) internal successors, (180), 20 states have internal predecessors, (180), 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-10-10 22:28:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4151 transitions. [2024-10-10 22:28:23,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-10 22:28:23,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:23,231 INFO L215 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] [2024-10-10 22:28:23,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-10 22:28:23,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-10 22:28:23,436 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:23,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash 831704474, now seen corresponding path program 1 times [2024-10-10 22:28:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038251116] [2024-10-10 22:28:23,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:23,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:23,775 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:28:23,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:23,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038251116] [2024-10-10 22:28:23,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038251116] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:23,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63181989] [2024-10-10 22:28:23,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:23,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:23,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:23,780 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:23,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-10 22:28:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:23,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:28:23,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 22:28:23,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:23,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63181989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:23,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:23,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 10 [2024-10-10 22:28:23,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379891222] [2024-10-10 22:28:23,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:23,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:23,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:23,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:23,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:28:23,978 INFO L87 Difference]: Start difference. First operand 3072 states and 4151 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-10-10 22:28:24,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:24,164 INFO L93 Difference]: Finished difference Result 3089 states and 4172 transitions. [2024-10-10 22:28:24,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:24,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-10-10 22:28:24,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:24,169 INFO L225 Difference]: With dead ends: 3089 [2024-10-10 22:28:24,169 INFO L226 Difference]: Without dead ends: 3085 [2024-10-10 22:28:24,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:28:24,171 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 3 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:24,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 205 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:24,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2024-10-10 22:28:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 3072. [2024-10-10 22:28:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3071 states have (on average 1.3516769781830023) internal successors, (4151), 3071 states have internal predecessors, (4151), 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-10-10 22:28:24,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4151 transitions. [2024-10-10 22:28:24,383 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4151 transitions. Word has length 72 [2024-10-10 22:28:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:24,383 INFO L471 AbstractCegarLoop]: Abstraction has 3072 states and 4151 transitions. [2024-10-10 22:28:24,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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-10-10 22:28:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4151 transitions. [2024-10-10 22:28:24,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-10 22:28:24,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:24,386 INFO L215 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-10-10 22:28:24,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-10 22:28:24,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:24,586 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:24,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:24,587 INFO L85 PathProgramCache]: Analyzing trace with hash 65806472, now seen corresponding path program 1 times [2024-10-10 22:28:24,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:24,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809976327] [2024-10-10 22:28:24,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:24,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:25,331 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 15 proven. 64 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:28:25,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:25,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809976327] [2024-10-10 22:28:25,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809976327] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:25,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210678051] [2024-10-10 22:28:25,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:25,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:25,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:25,337 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:25,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-10 22:28:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:25,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-10 22:28:25,524 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:25,621 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-10-10 22:28:25,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:25,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210678051] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:25,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:28:25,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-10-10 22:28:25,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739691579] [2024-10-10 22:28:25,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:25,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:25,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:25,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:25,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-10 22:28:25,622 INFO L87 Difference]: Start difference. First operand 3072 states and 4151 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-10-10 22:28:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:25,858 INFO L93 Difference]: Finished difference Result 3089 states and 4172 transitions. [2024-10-10 22:28:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:25,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-10-10 22:28:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:25,865 INFO L225 Difference]: With dead ends: 3089 [2024-10-10 22:28:25,865 INFO L226 Difference]: Without dead ends: 3085 [2024-10-10 22:28:25,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-10-10 22:28:25,866 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 2 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:25,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 215 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2024-10-10 22:28:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 2691. [2024-10-10 22:28:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 2690 states have (on average 1.3427509293680298) internal successors, (3612), 2690 states have internal predecessors, (3612), 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-10-10 22:28:26,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 3612 transitions. [2024-10-10 22:28:26,025 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 3612 transitions. Word has length 73 [2024-10-10 22:28:26,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:26,026 INFO L471 AbstractCegarLoop]: Abstraction has 2691 states and 3612 transitions. [2024-10-10 22:28:26,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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-10-10 22:28:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3612 transitions. [2024-10-10 22:28:26,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-10 22:28:26,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:26,027 INFO L215 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] [2024-10-10 22:28:26,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-10 22:28:26,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-10 22:28:26,232 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:26,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:26,232 INFO L85 PathProgramCache]: Analyzing trace with hash 402003737, now seen corresponding path program 1 times [2024-10-10 22:28:26,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:26,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081689475] [2024-10-10 22:28:26,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:26,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:28:26,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:26,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081689475] [2024-10-10 22:28:26,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081689475] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:26,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667986699] [2024-10-10 22:28:26,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:26,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:26,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:26,489 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:26,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-10 22:28:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:26,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-10 22:28:26,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:28:26,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:28:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667986699] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:26,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:26,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-10-10 22:28:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896459750] [2024-10-10 22:28:26,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:26,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-10 22:28:26,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:26,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-10 22:28:26,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-10-10 22:28:26,920 INFO L87 Difference]: Start difference. First operand 2691 states and 3612 transitions. Second operand has 17 states, 17 states have (on average 12.176470588235293) internal successors, (207), 16 states have internal predecessors, (207), 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-10-10 22:28:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:28,052 INFO L93 Difference]: Finished difference Result 7184 states and 9392 transitions. [2024-10-10 22:28:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-10 22:28:28,053 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.176470588235293) internal successors, (207), 16 states have internal predecessors, (207), 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 74 [2024-10-10 22:28:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:28,061 INFO L225 Difference]: With dead ends: 7184 [2024-10-10 22:28:28,061 INFO L226 Difference]: Without dead ends: 7173 [2024-10-10 22:28:28,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=423, Invalid=1217, Unknown=0, NotChecked=0, Total=1640 [2024-10-10 22:28:28,062 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 468 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:28,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 832 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7173 states. [2024-10-10 22:28:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7173 to 3839. [2024-10-10 22:28:28,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3839 states, 3838 states have (on average 1.3939551849921834) internal successors, (5350), 3838 states have internal predecessors, (5350), 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-10-10 22:28:28,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 5350 transitions. [2024-10-10 22:28:28,361 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 5350 transitions. Word has length 74 [2024-10-10 22:28:28,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:28,361 INFO L471 AbstractCegarLoop]: Abstraction has 3839 states and 5350 transitions. [2024-10-10 22:28:28,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.176470588235293) internal successors, (207), 16 states have internal predecessors, (207), 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-10-10 22:28:28,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 5350 transitions. [2024-10-10 22:28:28,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-10 22:28:28,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:28,363 INFO L215 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, 1] [2024-10-10 22:28:28,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-10 22:28:28,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-10 22:28:28,564 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:28,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:28,565 INFO L85 PathProgramCache]: Analyzing trace with hash 410467603, now seen corresponding path program 1 times [2024-10-10 22:28:28,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:28,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924493084] [2024-10-10 22:28:28,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:28,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:28,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 15 proven. 56 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:28:29,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:29,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924493084] [2024-10-10 22:28:29,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924493084] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:29,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126887698] [2024-10-10 22:28:29,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:29,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:29,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:29,024 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:29,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-10 22:28:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:29,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-10 22:28:29,186 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:29,477 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 9 proven. 74 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:28:29,477 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:29,916 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 49 proven. 22 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-10 22:28:29,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126887698] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:29,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:29,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 8] total 26 [2024-10-10 22:28:29,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631610028] [2024-10-10 22:28:29,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:29,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-10 22:28:29,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:29,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-10 22:28:29,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2024-10-10 22:28:29,920 INFO L87 Difference]: Start difference. First operand 3839 states and 5350 transitions. Second operand has 26 states, 26 states have (on average 7.576923076923077) internal successors, (197), 26 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-10-10 22:28:34,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:34,128 INFO L93 Difference]: Finished difference Result 14313 states and 18721 transitions. [2024-10-10 22:28:34,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-10-10 22:28:34,129 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.576923076923077) internal successors, (197), 26 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 75 [2024-10-10 22:28:34,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:34,146 INFO L225 Difference]: With dead ends: 14313 [2024-10-10 22:28:34,147 INFO L226 Difference]: Without dead ends: 14302 [2024-10-10 22:28:34,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2647 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1558, Invalid=7948, Unknown=0, NotChecked=0, Total=9506 [2024-10-10 22:28:34,151 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 561 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1163 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:34,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 2299 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1163 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:28:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14302 states. [2024-10-10 22:28:34,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14302 to 4626. [2024-10-10 22:28:34,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4626 states, 4625 states have (on average 1.3881081081081081) internal successors, (6420), 4625 states have internal predecessors, (6420), 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-10-10 22:28:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4626 states to 4626 states and 6420 transitions. [2024-10-10 22:28:34,585 INFO L78 Accepts]: Start accepts. Automaton has 4626 states and 6420 transitions. Word has length 75 [2024-10-10 22:28:34,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:34,585 INFO L471 AbstractCegarLoop]: Abstraction has 4626 states and 6420 transitions. [2024-10-10 22:28:34,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.576923076923077) internal successors, (197), 26 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-10-10 22:28:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 4626 states and 6420 transitions. [2024-10-10 22:28:34,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-10 22:28:34,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:34,588 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1] [2024-10-10 22:28:34,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:34,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-10 22:28:34,788 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:34,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:34,789 INFO L85 PathProgramCache]: Analyzing trace with hash 299577555, now seen corresponding path program 1 times [2024-10-10 22:28:34,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:34,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917832907] [2024-10-10 22:28:34,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:35,421 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 1 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:28:35,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:28:35,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917832907] [2024-10-10 22:28:35,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917832907] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:28:35,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727970915] [2024-10-10 22:28:35,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:35,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:28:35,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:35,424 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:28:35,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-10 22:28:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:35,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-10 22:28:35,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 1 proven. 64 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:28:35,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-10 22:28:36,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727970915] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:36,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:28:36,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2024-10-10 22:28:36,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442975047] [2024-10-10 22:28:36,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:36,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-10 22:28:36,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:28:36,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-10 22:28:36,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2024-10-10 22:28:36,700 INFO L87 Difference]: Start difference. First operand 4626 states and 6420 transitions. Second operand has 27 states, 27 states have (on average 6.851851851851852) internal successors, (185), 27 states have internal predecessors, (185), 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-10-10 22:28:47,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:47,011 INFO L93 Difference]: Finished difference Result 13292 states and 17791 transitions. [2024-10-10 22:28:47,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-10-10 22:28:47,011 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 6.851851851851852) internal successors, (185), 27 states have internal predecessors, (185), 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-10-10 22:28:47,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:47,043 INFO L225 Difference]: With dead ends: 13292 [2024-10-10 22:28:47,043 INFO L226 Difference]: Without dead ends: 13271 [2024-10-10 22:28:47,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 134 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4174 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2349, Invalid=10991, Unknown=0, NotChecked=0, Total=13340 [2024-10-10 22:28:47,052 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 477 mSDsluCounter, 3639 mSDsCounter, 0 mSdLazyCounter, 2670 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:47,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 3884 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2670 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-10 22:28:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13271 states. [2024-10-10 22:28:48,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13271 to 6127. [2024-10-10 22:28:48,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6127 states, 6126 states have (on average 1.390303623898139) internal successors, (8517), 6126 states have internal predecessors, (8517), 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-10-10 22:28:48,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6127 states to 6127 states and 8517 transitions. [2024-10-10 22:28:48,032 INFO L78 Accepts]: Start accepts. Automaton has 6127 states and 8517 transitions. Word has length 75 [2024-10-10 22:28:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:48,032 INFO L471 AbstractCegarLoop]: Abstraction has 6127 states and 8517 transitions. [2024-10-10 22:28:48,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 6.851851851851852) internal successors, (185), 27 states have internal predecessors, (185), 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-10-10 22:28:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 6127 states and 8517 transitions. [2024-10-10 22:28:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-10 22:28:48,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:48,034 INFO L215 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-10-10 22:28:48,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:48,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-10 22:28:48,236 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:48,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1888156227, now seen corresponding path program 1 times [2024-10-10 22:28:48,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:28:48,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488160031] [2024-10-10 22:28:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:28:48,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:28:48,259 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 22:28:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:28:48,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-10 22:28:48,311 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 22:28:48,312 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:28:48,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-10 22:28:48,316 INFO L407 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, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:48,360 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:28:48,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:28:48 BoogieIcfgContainer [2024-10-10 22:28:48,362 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:28:48,363 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:28:48,363 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:28:48,363 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:28:48,363 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:27:58" (3/4) ... [2024-10-10 22:28:48,365 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-10 22:28:48,366 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:28:48,366 INFO L158 Benchmark]: Toolchain (without parser) took 50555.25ms. Allocated memory was 138.4MB in the beginning and 1.3GB in the end (delta: 1.2GB). Free memory was 69.0MB in the beginning and 922.1MB in the end (delta: -853.1MB). Peak memory consumption was 317.7MB. Max. memory is 16.1GB. [2024-10-10 22:28:48,366 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 138.4MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:28:48,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 359.34ms. Allocated memory was 138.4MB in the beginning and 205.5MB in the end (delta: 67.1MB). Free memory was 68.8MB in the beginning and 171.8MB in the end (delta: -103.0MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2024-10-10 22:28:48,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.02ms. Allocated memory is still 205.5MB. Free memory was 171.8MB in the beginning and 168.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-10 22:28:48,367 INFO L158 Benchmark]: Boogie Preprocessor took 88.30ms. Allocated memory is still 205.5MB. Free memory was 168.7MB in the beginning and 165.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-10 22:28:48,367 INFO L158 Benchmark]: RCFGBuilder took 411.80ms. Allocated memory is still 205.5MB. Free memory was 165.6MB in the beginning and 140.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 22:28:48,367 INFO L158 Benchmark]: TraceAbstraction took 49603.09ms. Allocated memory was 205.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 140.4MB in the beginning and 922.1MB in the end (delta: -781.7MB). Peak memory consumption was 320.3MB. Max. memory is 16.1GB. [2024-10-10 22:28:48,367 INFO L158 Benchmark]: Witness Printer took 2.87ms. Allocated memory is still 1.3GB. Free memory is still 922.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:28:48,368 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.14ms. Allocated memory is still 138.4MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 359.34ms. Allocated memory was 138.4MB in the beginning and 205.5MB in the end (delta: 67.1MB). Free memory was 68.8MB in the beginning and 171.8MB in the end (delta: -103.0MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.02ms. Allocated memory is still 205.5MB. Free memory was 171.8MB in the beginning and 168.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.30ms. Allocated memory is still 205.5MB. Free memory was 168.7MB in the beginning and 165.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 411.80ms. Allocated memory is still 205.5MB. Free memory was 165.6MB in the beginning and 140.4MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 49603.09ms. Allocated memory was 205.5MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 140.4MB in the beginning and 922.1MB in the end (delta: -781.7MB). Peak memory consumption was 320.3MB. Max. memory is 16.1GB. * Witness Printer took 2.87ms. Allocated memory is still 1.3GB. Free memory is still 922.1MB. 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=155, 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=155, b1=0, b2=0, b3=0, na=4] [L68] nb = (unsigned char)4 VAL [a0=234770789, a1=917073, a2=3582, a3=13, b0=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, 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=155, b1=0, b2=0, b3=0] [L116] r = r0 | (r1 << 8U) | (r2 << 16U) | ((unsigned int)r3 << 24U) [L118] return r; [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, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.5s, OverallIterations: 30, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 28.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6069 SdHoareTripleChecker+Valid, 10.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6069 mSDsluCounter, 16230 SdHoareTripleChecker+Invalid, 9.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13511 mSDsCounter, 515 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10788 IncrementalHoareTripleChecker+Invalid, 11303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 515 mSolverCounterUnsat, 2719 mSDtfsCounter, 10788 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2353 GetRequests, 1720 SyntacticMatches, 5 SemanticMatches, 628 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10471 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6127occurred in iteration=29, InterpolantAutomatonStates: 512, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 36779 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 11.7s InterpolantComputationTime, 2741 NumberOfCodeBlocks, 2741 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3255 ConstructedInterpolants, 39 QuantifiedInterpolants, 29628 SizeOfPredicates, 38 NumberOfNonLiveVariables, 2822 ConjunctsInSsa, 192 ConjunctsInUnsatCore, 55 InterpolantComputations, 20 PerfectInterpolantSequences, 2072/3523 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-10-10 22:28:48,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-10 22:28:50,661 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:28:50,718 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-10 22:28:50,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:28:50,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:28:50,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:28:50,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:28:50,742 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:28:50,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:28:50,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:28:50,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:28:50,743 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:28:50,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:28:50,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:28:50,745 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:28:50,746 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:28:50,746 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:28:50,746 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:28:50,746 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:28:50,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:28:50,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:28:50,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:28:50,747 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:28:50,747 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-10 22:28:50,748 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-10 22:28:50,748 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:28:50,748 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-10 22:28:50,748 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:28:50,748 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:28:50,748 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:28:50,749 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:28:50,749 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:28:50,749 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:28:50,749 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:28:50,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:28:50,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:28:50,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:28:50,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:28:50,751 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-10 22:28:50,751 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-10 22:28:50,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:28:50,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:28:50,754 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:28:50,754 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:28:50,754 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-10 22:28:50,754 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-clean/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-clean/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-10-10 22:28:51,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:28:51,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:28:51,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:28:51,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:28:51,043 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:28:51,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-10-10 22:28:52,614 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:28:52,794 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:28:52,797 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2024-10-10 22:28:52,804 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/de607baeb/81f7754433a44db882bcdcc1da5186ad/FLAG5237becdf [2024-10-10 22:28:53,181 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/de607baeb/81f7754433a44db882bcdcc1da5186ad [2024-10-10 22:28:53,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:28:53,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:28:53,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:28:53,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:28:53,191 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:28:53,192 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59080539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53, skipping insertion in model container [2024-10-10 22:28:53,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,214 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:28:53,361 WARN L248 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-10-10 22:28:53,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:28:53,414 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:28:53,423 WARN L248 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-10-10 22:28:53,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:28:53,468 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:28:53,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53 WrapperNode [2024-10-10 22:28:53,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:28:53,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:28:53,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:28:53,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:28:53,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,502 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 123 [2024-10-10 22:28:53,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:28:53,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:28:53,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:28:53,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:28:53,512 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,515 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,528 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-10-10 22:28:53,528 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,528 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,540 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,541 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,541 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:28:53,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:28:53,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:28:53,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:28:53,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (1/1) ... [2024-10-10 22:28:53,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:28:53,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:28:53,587 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:28:53,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:28:53,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:28:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-10 22:28:53,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:28:53,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:28:53,704 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:28:53,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:28:53,934 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-10-10 22:28:53,934 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:28:53,975 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:28:53,976 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-10 22:28:53,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:28:53 BoogieIcfgContainer [2024-10-10 22:28:53,976 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:28:53,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:28:53,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:28:53,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:28:53,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:28:53" (1/3) ... [2024-10-10 22:28:53,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c166908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:28:53, skipping insertion in model container [2024-10-10 22:28:53,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:28:53" (2/3) ... [2024-10-10 22:28:53,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c166908 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:28:53, skipping insertion in model container [2024-10-10 22:28:53,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:28:53" (3/3) ... [2024-10-10 22:28:53,989 INFO L112 eAbstractionObserver]: Analyzing ICFG byte_add_1-1.i [2024-10-10 22:28:54,013 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:28:54,013 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:28:54,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:28:54,084 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;@3a9e9b6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:28:54,084 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:28:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 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-10-10 22:28:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 22:28:54,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:54,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:54,094 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:54,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:54,100 INFO L85 PathProgramCache]: Analyzing trace with hash 459643034, now seen corresponding path program 1 times [2024-10-10 22:28:54,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:54,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239732436] [2024-10-10 22:28:54,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:54,111 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-10-10 22:28:54,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:54,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-10 22:28:54,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:54,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-10 22:28:54,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:54,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:54,199 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:54,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:54,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239732436] [2024-10-10 22:28:54,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239732436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:54,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:54,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:28:54,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571032010] [2024-10-10 22:28:54,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:54,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:28:54,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:54,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:28:54,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:28:54,243 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.8611111111111112) internal successors, (67), 37 states have internal predecessors, (67), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-10-10 22:28:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:54,265 INFO L93 Difference]: Finished difference Result 50 states and 85 transitions. [2024-10-10 22:28:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:28:54,267 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-10-10 22:28:54,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:54,273 INFO L225 Difference]: With dead ends: 50 [2024-10-10 22:28:54,273 INFO L226 Difference]: Without dead ends: 36 [2024-10-10 22:28:54,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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-10-10 22:28:54,277 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 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-10-10 22:28:54,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-10 22:28:54,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-10 22:28:54,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.7714285714285714) internal successors, (62), 35 states have internal predecessors, (62), 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-10-10 22:28:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 62 transitions. [2024-10-10 22:28:54,300 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 62 transitions. Word has length 10 [2024-10-10 22:28:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:54,301 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 62 transitions. [2024-10-10 22:28:54,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-10-10 22:28:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 62 transitions. [2024-10-10 22:28:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-10 22:28:54,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:54,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:54,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:54,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-10 22:28:54,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:54,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:54,506 INFO L85 PathProgramCache]: Analyzing trace with hash 371044600, now seen corresponding path program 1 times [2024-10-10 22:28:54,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:54,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2121218367] [2024-10-10 22:28:54,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:54,507 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-10-10 22:28:54,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:54,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-10 22:28:54,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:54,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:28:54,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:54,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:54,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:54,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:54,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2121218367] [2024-10-10 22:28:54,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2121218367] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:54,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:54,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:28:54,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524878759] [2024-10-10 22:28:54,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:54,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:54,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:54,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:54,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:28:54,583 INFO L87 Difference]: Start difference. First operand 36 states and 62 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10-10 22:28:54,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:54,769 INFO L93 Difference]: Finished difference Result 98 states and 176 transitions. [2024-10-10 22:28:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:28:54,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-10-10 22:28:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:54,773 INFO L225 Difference]: With dead ends: 98 [2024-10-10 22:28:54,773 INFO L226 Difference]: Without dead ends: 71 [2024-10-10 22:28:54,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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-10-10 22:28:54,775 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 48 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:54,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 127 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:54,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-10 22:28:54,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2024-10-10 22:28:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.6521739130434783) internal successors, (114), 69 states have internal predecessors, (114), 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-10-10 22:28:54,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 114 transitions. [2024-10-10 22:28:54,790 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 114 transitions. Word has length 10 [2024-10-10 22:28:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:54,791 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 114 transitions. [2024-10-10 22:28:54,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-10-10 22:28:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 114 transitions. [2024-10-10 22:28:54,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-10 22:28:54,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:54,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:54,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-10 22:28:54,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-10 22:28:54,995 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:54,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:54,995 INFO L85 PathProgramCache]: Analyzing trace with hash -450690481, now seen corresponding path program 1 times [2024-10-10 22:28:54,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:54,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714801731] [2024-10-10 22:28:54,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:54,996 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-10-10 22:28:54,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:55,001 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-10 22:28:55,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:55,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:28:55,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:55,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:55,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:55,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714801731] [2024-10-10 22:28:55,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714801731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:55,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:55,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:28:55,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167743655] [2024-10-10 22:28:55,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:55,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:55,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:55,082 INFO L87 Difference]: Start difference. First operand 70 states and 114 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-10-10 22:28:55,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:55,287 INFO L93 Difference]: Finished difference Result 132 states and 228 transitions. [2024-10-10 22:28:55,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:55,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2024-10-10 22:28:55,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:55,288 INFO L225 Difference]: With dead ends: 132 [2024-10-10 22:28:55,290 INFO L226 Difference]: Without dead ends: 105 [2024-10-10 22:28:55,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-10-10 22:28:55,291 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 82 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:55,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 232 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:55,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-10 22:28:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2024-10-10 22:28:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.6521739130434783) internal successors, (114), 69 states have internal predecessors, (114), 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-10-10 22:28:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 114 transitions. [2024-10-10 22:28:55,317 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 114 transitions. Word has length 11 [2024-10-10 22:28:55,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:55,318 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 114 transitions. [2024-10-10 22:28:55,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 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-10-10 22:28:55,318 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 114 transitions. [2024-10-10 22:28:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-10 22:28:55,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:55,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:55,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:55,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-10 22:28:55,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:55,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:55,520 INFO L85 PathProgramCache]: Analyzing trace with hash -950257841, now seen corresponding path program 1 times [2024-10-10 22:28:55,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:55,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601221023] [2024-10-10 22:28:55,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:55,521 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-10-10 22:28:55,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:55,523 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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-10-10 22:28:55,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:55,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:28:55,545 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:55,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:55,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:55,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [601221023] [2024-10-10 22:28:55,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [601221023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:55,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:55,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:28:55,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526908376] [2024-10-10 22:28:55,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:55,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:28:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:55,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:28:55,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:55,572 INFO L87 Difference]: Start difference. First operand 70 states and 114 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-10-10 22:28:55,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:55,700 INFO L93 Difference]: Finished difference Result 166 states and 280 transitions. [2024-10-10 22:28:55,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:28:55,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-10-10 22:28:55,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:55,702 INFO L225 Difference]: With dead ends: 166 [2024-10-10 22:28:55,704 INFO L226 Difference]: Without dead ends: 139 [2024-10-10 22:28:55,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-10-10 22:28:55,705 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 137 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:55,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 392 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-10 22:28:55,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 70. [2024-10-10 22:28:55,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.6521739130434783) internal successors, (114), 69 states have internal predecessors, (114), 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-10-10 22:28:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 114 transitions. [2024-10-10 22:28:55,714 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 114 transitions. Word has length 12 [2024-10-10 22:28:55,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:55,714 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 114 transitions. [2024-10-10 22:28:55,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 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-10-10 22:28:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 114 transitions. [2024-10-10 22:28:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-10 22:28:55,715 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:55,715 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:28:55,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:55,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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-10-10 22:28:55,917 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:55,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:55,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1569702093, now seen corresponding path program 1 times [2024-10-10 22:28:55,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:55,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139372893] [2024-10-10 22:28:55,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:55,919 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-10-10 22:28:55,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:55,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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-10-10 22:28:55,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:55,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:28:55,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:55,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:55,972 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:55,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:55,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139372893] [2024-10-10 22:28:55,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139372893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:55,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:55,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-10 22:28:55,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582666513] [2024-10-10 22:28:55,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:55,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:28:55,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:55,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:28:55,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:55,975 INFO L87 Difference]: Start difference. First operand 70 states and 114 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-10-10 22:28:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:56,080 INFO L93 Difference]: Finished difference Result 178 states and 290 transitions. [2024-10-10 22:28:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:28:56,081 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-10-10 22:28:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:56,082 INFO L225 Difference]: With dead ends: 178 [2024-10-10 22:28:56,082 INFO L226 Difference]: Without dead ends: 151 [2024-10-10 22:28:56,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 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-10-10 22:28:56,083 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 163 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:56,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 514 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-10 22:28:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 82. [2024-10-10 22:28:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.5308641975308641) internal successors, (124), 81 states have internal predecessors, (124), 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-10-10 22:28:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-10-10 22:28:56,089 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 12 [2024-10-10 22:28:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:56,089 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-10-10 22:28:56,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-10-10 22:28:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-10-10 22:28:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-10 22:28:56,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:56,090 INFO L215 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] [2024-10-10 22:28:56,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:56,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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-10-10 22:28:56,293 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:56,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:56,294 INFO L85 PathProgramCache]: Analyzing trace with hash -171126915, now seen corresponding path program 1 times [2024-10-10 22:28:56,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:56,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [806880662] [2024-10-10 22:28:56,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:56,295 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-10-10 22:28:56,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:56,296 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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-10-10 22:28:56,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:56,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:28:56,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:56,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:56,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:56,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [806880662] [2024-10-10 22:28:56,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [806880662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:56,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:56,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:28:56,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532023940] [2024-10-10 22:28:56,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:56,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:28:56,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:56,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:28:56,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:28:56,388 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-10-10 22:28:56,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:56,500 INFO L93 Difference]: Finished difference Result 239 states and 367 transitions. [2024-10-10 22:28:56,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:56,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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 23 [2024-10-10 22:28:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:56,501 INFO L225 Difference]: With dead ends: 239 [2024-10-10 22:28:56,501 INFO L226 Difference]: Without dead ends: 169 [2024-10-10 22:28:56,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-10-10 22:28:56,502 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 47 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:56,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 148 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:56,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-10-10 22:28:56,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 161. [2024-10-10 22:28:56,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.49375) internal successors, (239), 160 states have internal predecessors, (239), 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-10-10 22:28:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 239 transitions. [2024-10-10 22:28:56,510 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 239 transitions. Word has length 23 [2024-10-10 22:28:56,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:56,511 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 239 transitions. [2024-10-10 22:28:56,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-10-10 22:28:56,511 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 239 transitions. [2024-10-10 22:28:56,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-10 22:28:56,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:56,511 INFO L215 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] [2024-10-10 22:28:56,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:56,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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-10-10 22:28:56,713 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:56,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:56,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1205485431, now seen corresponding path program 1 times [2024-10-10 22:28:56,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:56,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173484534] [2024-10-10 22:28:56,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:56,714 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-10-10 22:28:56,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:56,716 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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-10-10 22:28:56,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:56,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:28:56,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:56,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 22:28:56,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:56,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:56,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173484534] [2024-10-10 22:28:56,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173484534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:56,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:56,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:28:56,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014241467] [2024-10-10 22:28:56,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:56,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:28:56,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:56,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:28:56,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:56,759 INFO L87 Difference]: Start difference. First operand 161 states and 239 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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-10-10 22:28:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:56,769 INFO L93 Difference]: Finished difference Result 165 states and 242 transitions. [2024-10-10 22:28:56,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:28:56,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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 24 [2024-10-10 22:28:56,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:56,770 INFO L225 Difference]: With dead ends: 165 [2024-10-10 22:28:56,770 INFO L226 Difference]: Without dead ends: 85 [2024-10-10 22:28:56,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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-10-10 22:28:56,771 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 43 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:56,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 45 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:56,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-10 22:28:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-10 22:28:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.4285714285714286) internal successors, (120), 84 states have internal predecessors, (120), 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-10-10 22:28:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 120 transitions. [2024-10-10 22:28:56,775 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 120 transitions. Word has length 24 [2024-10-10 22:28:56,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:56,775 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 120 transitions. [2024-10-10 22:28:56,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 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-10-10 22:28:56,776 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2024-10-10 22:28:56,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:28:56,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:56,776 INFO L215 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] [2024-10-10 22:28:56,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:56,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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-10-10 22:28:56,982 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:56,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:56,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1173091825, now seen corresponding path program 1 times [2024-10-10 22:28:56,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:56,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164074549] [2024-10-10 22:28:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:56,983 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-10-10 22:28:56,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:56,986 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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-10-10 22:28:56,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:57,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:57,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:28:57,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:57,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:57,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:57,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:57,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164074549] [2024-10-10 22:28:57,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164074549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:57,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:57,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:28:57,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595717159] [2024-10-10 22:28:57,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:57,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:28:57,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:57,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:28:57,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:28:57,041 INFO L87 Difference]: Start difference. First operand 85 states and 120 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-10-10 22:28:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:57,051 INFO L93 Difference]: Finished difference Result 112 states and 156 transitions. [2024-10-10 22:28:57,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:28:57,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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 27 [2024-10-10 22:28:57,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:57,052 INFO L225 Difference]: With dead ends: 112 [2024-10-10 22:28:57,052 INFO L226 Difference]: Without dead ends: 107 [2024-10-10 22:28:57,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-10-10 22:28:57,053 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:57,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:28:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-10 22:28:57,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-10 22:28:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.4150943396226414) internal successors, (150), 106 states have internal predecessors, (150), 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-10-10 22:28:57,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 150 transitions. [2024-10-10 22:28:57,058 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 150 transitions. Word has length 27 [2024-10-10 22:28:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:57,058 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 150 transitions. [2024-10-10 22:28:57,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 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-10-10 22:28:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 150 transitions. [2024-10-10 22:28:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-10 22:28:57,059 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:57,059 INFO L215 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] [2024-10-10 22:28:57,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:57,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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-10-10 22:28:57,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:57,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1874156403, now seen corresponding path program 1 times [2024-10-10 22:28:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:57,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342105780] [2024-10-10 22:28:57,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:57,260 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-10-10 22:28:57,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:57,263 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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-10-10 22:28:57,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:57,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:28:57,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:57,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:57,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:57,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342105780] [2024-10-10 22:28:57,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342105780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:57,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:57,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-10 22:28:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350281119] [2024-10-10 22:28:57,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:57,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:57,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:57,393 INFO L87 Difference]: Start difference. First operand 107 states and 150 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-10-10 22:28:57,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:57,523 INFO L93 Difference]: Finished difference Result 246 states and 355 transitions. [2024-10-10 22:28:57,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:57,524 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 27 [2024-10-10 22:28:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:57,524 INFO L225 Difference]: With dead ends: 246 [2024-10-10 22:28:57,524 INFO L226 Difference]: Without dead ends: 190 [2024-10-10 22:28:57,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-10-10 22:28:57,525 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 61 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:57,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 80 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:57,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-10 22:28:57,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 178. [2024-10-10 22:28:57,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.384180790960452) internal successors, (245), 177 states have internal predecessors, (245), 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-10-10 22:28:57,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 245 transitions. [2024-10-10 22:28:57,532 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 245 transitions. Word has length 27 [2024-10-10 22:28:57,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:57,532 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 245 transitions. [2024-10-10 22:28:57,532 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-10-10 22:28:57,532 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 245 transitions. [2024-10-10 22:28:57,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-10 22:28:57,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:57,533 INFO L215 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] [2024-10-10 22:28:57,540 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-10 22:28:57,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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-10-10 22:28:57,740 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:57,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:57,740 INFO L85 PathProgramCache]: Analyzing trace with hash -512752900, now seen corresponding path program 1 times [2024-10-10 22:28:57,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:57,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [523878944] [2024-10-10 22:28:57,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:57,741 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-10-10 22:28:57,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:57,742 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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-10-10 22:28:57,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:57,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:28:57,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:57,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:57,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:57,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [523878944] [2024-10-10 22:28:57,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [523878944] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:57,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:57,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 22:28:57,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094411472] [2024-10-10 22:28:57,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:57,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 22:28:57,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:57,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 22:28:57,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:28:57,846 INFO L87 Difference]: Start difference. First operand 178 states and 245 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-10 22:28:57,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:57,974 INFO L93 Difference]: Finished difference Result 317 states and 450 transitions. [2024-10-10 22:28:57,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 22:28:57,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 28 [2024-10-10 22:28:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:57,975 INFO L225 Difference]: With dead ends: 317 [2024-10-10 22:28:57,975 INFO L226 Difference]: Without dead ends: 261 [2024-10-10 22:28:57,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 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-10-10 22:28:57,976 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 96 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:57,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 137 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-10 22:28:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 178. [2024-10-10 22:28:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.384180790960452) internal successors, (245), 177 states have internal predecessors, (245), 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-10-10 22:28:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 245 transitions. [2024-10-10 22:28:57,992 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 245 transitions. Word has length 28 [2024-10-10 22:28:57,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:57,992 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 245 transitions. [2024-10-10 22:28:57,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-10 22:28:57,992 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 245 transitions. [2024-10-10 22:28:57,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 22:28:57,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:57,993 INFO L215 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-10-10 22:28:57,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:58,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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-10-10 22:28:58,195 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:58,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:58,195 INFO L85 PathProgramCache]: Analyzing trace with hash -869831172, now seen corresponding path program 1 times [2024-10-10 22:28:58,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:58,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024964315] [2024-10-10 22:28:58,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:58,196 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-10-10 22:28:58,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:58,200 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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-10-10 22:28:58,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:58,240 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:28:58,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:58,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:58,297 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:58,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:58,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024964315] [2024-10-10 22:28:58,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024964315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:58,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:58,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-10 22:28:58,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895558827] [2024-10-10 22:28:58,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:58,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 22:28:58,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:58,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 22:28:58,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:58,298 INFO L87 Difference]: Start difference. First operand 178 states and 245 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-10-10 22:28:58,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:58,480 INFO L93 Difference]: Finished difference Result 336 states and 470 transitions. [2024-10-10 22:28:58,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 22:28:58,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-10-10 22:28:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:58,481 INFO L225 Difference]: With dead ends: 336 [2024-10-10 22:28:58,481 INFO L226 Difference]: Without dead ends: 280 [2024-10-10 22:28:58,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-10 22:28:58,482 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 129 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:58,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 281 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-10-10 22:28:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 126. [2024-10-10 22:28:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.36) internal successors, (170), 125 states have internal predecessors, (170), 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-10-10 22:28:58,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 170 transitions. [2024-10-10 22:28:58,486 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 170 transitions. Word has length 29 [2024-10-10 22:28:58,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:58,486 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 170 transitions. [2024-10-10 22:28:58,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 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-10-10 22:28:58,486 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 170 transitions. [2024-10-10 22:28:58,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-10 22:28:58,487 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:58,487 INFO L215 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-10-10 22:28:58,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:28:58,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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-10-10 22:28:58,688 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:58,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:58,688 INFO L85 PathProgramCache]: Analyzing trace with hash -735817666, now seen corresponding path program 1 times [2024-10-10 22:28:58,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:58,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246532384] [2024-10-10 22:28:58,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:58,689 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-10-10 22:28:58,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:58,691 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/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-10-10 22:28:58,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:58,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-10 22:28:58,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:58,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:28:58,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:58,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246532384] [2024-10-10 22:28:58,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246532384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:28:58,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:28:58,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 22:28:58,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246981350] [2024-10-10 22:28:58,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:28:58,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 22:28:58,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:58,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 22:28:58,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:28:58,823 INFO L87 Difference]: Start difference. First operand 126 states and 170 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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-10-10 22:28:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:58,930 INFO L93 Difference]: Finished difference Result 206 states and 283 transitions. [2024-10-10 22:28:58,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 22:28:58,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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-10-10 22:28:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:58,931 INFO L225 Difference]: With dead ends: 206 [2024-10-10 22:28:58,932 INFO L226 Difference]: Without dead ends: 160 [2024-10-10 22:28:58,932 INFO L431 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-10-10 22:28:58,933 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 65 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:58,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 45 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:28:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-10 22:28:58,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 141. [2024-10-10 22:28:58,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 140 states have (on average 1.3285714285714285) internal successors, (186), 140 states have internal predecessors, (186), 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-10-10 22:28:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 186 transitions. [2024-10-10 22:28:58,939 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 186 transitions. Word has length 29 [2024-10-10 22:28:58,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:58,939 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 186 transitions. [2024-10-10 22:28:58,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 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-10-10 22:28:58,940 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 186 transitions. [2024-10-10 22:28:58,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 22:28:58,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:58,941 INFO L215 NwaCegarLoop]: trace histogram [2, 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, 1, 1] [2024-10-10 22:28:58,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:59,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/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-10-10 22:28:59,144 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:59,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash 254164507, now seen corresponding path program 1 times [2024-10-10 22:28:59,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:59,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246525294] [2024-10-10 22:28:59,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:59,145 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-10-10 22:28:59,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:59,146 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/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-10-10 22:28:59,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:59,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:28:59,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:59,310 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:28:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:28:59,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:28:59,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246525294] [2024-10-10 22:28:59,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246525294] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:28:59,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:28:59,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-10 22:28:59,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429175483] [2024-10-10 22:28:59,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:28:59,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:28:59,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:28:59,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:28:59,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:28:59,390 INFO L87 Difference]: Start difference. First operand 141 states and 186 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 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-10-10 22:28:59,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:28:59,621 INFO L93 Difference]: Finished difference Result 396 states and 573 transitions. [2024-10-10 22:28:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-10 22:28:59,621 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 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-10-10 22:28:59,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:28:59,622 INFO L225 Difference]: With dead ends: 396 [2024-10-10 22:28:59,622 INFO L226 Difference]: Without dead ends: 268 [2024-10-10 22:28:59,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2024-10-10 22:28:59,623 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 169 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:28:59,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 78 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:28:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-10 22:28:59,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 214. [2024-10-10 22:28:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 213 states have (on average 1.352112676056338) internal successors, (288), 213 states have internal predecessors, (288), 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-10-10 22:28:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 288 transitions. [2024-10-10 22:28:59,630 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 288 transitions. Word has length 42 [2024-10-10 22:28:59,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:28:59,630 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 288 transitions. [2024-10-10 22:28:59,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 9 states have internal predecessors, (80), 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-10-10 22:28:59,630 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 288 transitions. [2024-10-10 22:28:59,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-10 22:28:59,631 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:28:59,631 INFO L215 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] [2024-10-10 22:28:59,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:59,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-clean/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-10-10 22:28:59,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:28:59,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:28:59,832 INFO L85 PathProgramCache]: Analyzing trace with hash -647345805, now seen corresponding path program 1 times [2024-10-10 22:28:59,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:28:59,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726883936] [2024-10-10 22:28:59,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:28:59,833 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-10-10 22:28:59,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:28:59,835 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/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-10-10 22:28:59,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:28:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:28:59,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:28:59,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:28:59,959 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 53 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:28:59,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-10 22:29:00,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:29:00,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726883936] [2024-10-10 22:29:00,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726883936] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:00,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:29:00,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-10 22:29:00,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161883174] [2024-10-10 22:29:00,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:00,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:29:00,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:29:00,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:29:00,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:29:00,025 INFO L87 Difference]: Start difference. First operand 214 states and 288 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 9 states have internal predecessors, (88), 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-10-10 22:29:00,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:00,216 INFO L93 Difference]: Finished difference Result 636 states and 837 transitions. [2024-10-10 22:29:00,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:29:00,217 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 9 states have internal predecessors, (88), 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-10-10 22:29:00,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:00,218 INFO L225 Difference]: With dead ends: 636 [2024-10-10 22:29:00,218 INFO L226 Difference]: Without dead ends: 436 [2024-10-10 22:29:00,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 126 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-10-10 22:29:00,219 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 172 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:00,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 226 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-10 22:29:00,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 280. [2024-10-10 22:29:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 1.3727598566308243) internal successors, (383), 279 states have internal predecessors, (383), 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-10-10 22:29:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 383 transitions. [2024-10-10 22:29:00,230 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 383 transitions. Word has length 68 [2024-10-10 22:29:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:00,231 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 383 transitions. [2024-10-10 22:29:00,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 9 states have internal predecessors, (88), 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-10-10 22:29:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 383 transitions. [2024-10-10 22:29:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-10 22:29:00,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:00,232 INFO L215 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] [2024-10-10 22:29:00,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-10 22:29:00,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/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-10-10 22:29:00,434 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:00,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash 12185717, now seen corresponding path program 2 times [2024-10-10 22:29:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:29:00,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656474422] [2024-10-10 22:29:00,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 22:29:00,435 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-10-10 22:29:00,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:29:00,438 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/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-10-10 22:29:00,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:29:00,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 22:29:00,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:29:00,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-10 22:29:00,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 65 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-10 22:29:00,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 68 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-10 22:29:00,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:29:00,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1656474422] [2024-10-10 22:29:00,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1656474422] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:00,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:29:00,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-10 22:29:00,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058758419] [2024-10-10 22:29:00,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:00,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-10 22:29:00,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:29:00,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-10 22:29:00,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-10 22:29:00,757 INFO L87 Difference]: Start difference. First operand 280 states and 383 transitions. Second operand has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-10-10 22:29:00,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:00,983 INFO L93 Difference]: Finished difference Result 651 states and 862 transitions. [2024-10-10 22:29:00,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-10 22:29:00,984 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-10-10 22:29:00,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:00,985 INFO L225 Difference]: With dead ends: 651 [2024-10-10 22:29:00,985 INFO L226 Difference]: Without dead ends: 385 [2024-10-10 22:29:00,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 134 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-10-10 22:29:00,987 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 176 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:00,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 222 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-10 22:29:00,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-10-10 22:29:00,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 251. [2024-10-10 22:29:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 250 states have (on average 1.34) internal successors, (335), 250 states have internal predecessors, (335), 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-10-10 22:29:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 335 transitions. [2024-10-10 22:29:00,999 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 335 transitions. Word has length 68 [2024-10-10 22:29:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:01,000 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 335 transitions. [2024-10-10 22:29:01,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.222222222222221) internal successors, (110), 9 states have internal predecessors, (110), 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-10-10 22:29:01,000 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 335 transitions. [2024-10-10 22:29:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-10 22:29:01,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:01,000 INFO L215 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] [2024-10-10 22:29:01,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:29:01,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/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-10-10 22:29:01,201 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:01,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash -121827789, now seen corresponding path program 3 times [2024-10-10 22:29:01,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:29:01,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039373153] [2024-10-10 22:29:01,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-10 22:29:01,202 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-10-10 22:29:01,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:29:01,204 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/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-10-10 22:29:01,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:29:01,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-10 22:29:01,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 22:29:01,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-10 22:29:01,238 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:29:03,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:29:06,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:29:06,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039373153] [2024-10-10 22:29:06,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039373153] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:06,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:29:06,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2024-10-10 22:29:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902941854] [2024-10-10 22:29:06,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:06,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-10 22:29:06,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:29:06,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-10 22:29:06,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1662, Unknown=0, NotChecked=0, Total=1806 [2024-10-10 22:29:06,028 INFO L87 Difference]: Start difference. First operand 251 states and 335 transitions. Second operand has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 42 states have internal predecessors, (135), 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-10-10 22:29:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:18,337 INFO L93 Difference]: Finished difference Result 1374 states and 1760 transitions. [2024-10-10 22:29:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2024-10-10 22:29:18,337 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 42 states have internal predecessors, (135), 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-10-10 22:29:18,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:18,341 INFO L225 Difference]: With dead ends: 1374 [2024-10-10 22:29:18,341 INFO L226 Difference]: Without dead ends: 1278 [2024-10-10 22:29:18,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3729 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=2827, Invalid=13943, Unknown=0, NotChecked=0, Total=16770 [2024-10-10 22:29:18,346 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1885 mSDsluCounter, 5453 mSDsCounter, 0 mSdLazyCounter, 3879 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1885 SdHoareTripleChecker+Valid, 5744 SdHoareTripleChecker+Invalid, 3978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:18,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1885 Valid, 5744 Invalid, 3978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3879 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-10 22:29:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2024-10-10 22:29:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 502. [2024-10-10 22:29:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 1.3233532934131738) internal successors, (663), 501 states have internal predecessors, (663), 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-10-10 22:29:18,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 663 transitions. [2024-10-10 22:29:18,388 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 663 transitions. Word has length 68 [2024-10-10 22:29:18,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:18,388 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 663 transitions. [2024-10-10 22:29:18,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 3.13953488372093) internal successors, (135), 42 states have internal predecessors, (135), 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-10-10 22:29:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 663 transitions. [2024-10-10 22:29:18,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-10 22:29:18,389 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:18,389 INFO L215 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] [2024-10-10 22:29:18,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-10 22:29:18,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/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-10-10 22:29:18,592 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:18,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash -757023828, now seen corresponding path program 1 times [2024-10-10 22:29:18,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:29:18,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443707830] [2024-10-10 22:29:18,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:18,593 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-10-10 22:29:18,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:29:18,596 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/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-10-10 22:29:18,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-10 22:29:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:18,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 22:29:18,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:29:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 63 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-10 22:29:18,761 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:29:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 48 proven. 31 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-10 22:29:18,855 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-10 22:29:18,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443707830] [2024-10-10 22:29:18,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443707830] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:29:18,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-10 22:29:18,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-10-10 22:29:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857307931] [2024-10-10 22:29:18,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-10 22:29:18,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:29:18,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-10 22:29:18,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:29:18,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:29:18,859 INFO L87 Difference]: Start difference. First operand 502 states and 663 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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-10-10 22:29:19,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:29:19,346 INFO L93 Difference]: Finished difference Result 1038 states and 1405 transitions. [2024-10-10 22:29:19,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-10 22:29:19,347 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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-10-10 22:29:19,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:29:19,350 INFO L225 Difference]: With dead ends: 1038 [2024-10-10 22:29:19,350 INFO L226 Difference]: Without dead ends: 875 [2024-10-10 22:29:19,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2024-10-10 22:29:19,351 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 199 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:29:19,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 101 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:29:19,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-10 22:29:19,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 792. [2024-10-10 22:29:19,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 1.3375474083438685) internal successors, (1058), 791 states have internal predecessors, (1058), 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-10-10 22:29:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1058 transitions. [2024-10-10 22:29:19,428 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1058 transitions. Word has length 70 [2024-10-10 22:29:19,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:29:19,428 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1058 transitions. [2024-10-10 22:29:19,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 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-10-10 22:29:19,429 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1058 transitions. [2024-10-10 22:29:19,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-10 22:29:19,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:29:19,430 INFO L215 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] [2024-10-10 22:29:19,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Ended with exit code 0 [2024-10-10 22:29:19,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-clean/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-10-10 22:29:19,633 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:29:19,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:29:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash -753152637, now seen corresponding path program 1 times [2024-10-10 22:29:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-10 22:29:19,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779309464] [2024-10-10 22:29:19,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:29:19,635 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-10-10 22:29:19,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-10 22:29:19,636 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/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-10-10 22:29:19,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 (19)] Waiting until timeout for monitored process [2024-10-10 22:29:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:29:19,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-10 22:29:19,677 INFO L278 TraceCheckSpWp]: Computing forward predicates...