./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:55:02,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:55:02,972 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:55:02,976 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:55:02,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:55:02,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:55:02,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:55:02,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:55:02,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:55:02,993 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:55:02,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:55:02,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:55:02,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:55:02,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:55:02,995 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:55:02,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:55:02,996 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:55:02,996 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:55:02,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:55:02,996 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:55:02,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:55:03,000 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:55:03,000 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:55:03,000 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:55:03,001 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:55:03,001 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:55:03,001 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:55:03,001 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:55:03,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:55:03,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:55:03,002 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:55:03,002 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:55:03,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:55:03,002 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:55:03,003 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:55:03,003 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:55:03,003 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:55:03,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:55:03,003 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:55:03,004 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:55:03,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:55:03,005 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:55:03,005 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 [2024-11-19 20:55:03,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:55:03,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:55:03,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:55:03,222 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:55:03,223 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:55:03,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-19 20:55:04,533 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:55:04,702 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:55:04,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-19 20:55:04,708 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ed43ab3/c81456b9c4da4cb8b15428d3504be2c6/FLAG289e0689e [2024-11-19 20:55:05,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08ed43ab3/c81456b9c4da4cb8b15428d3504be2c6 [2024-11-19 20:55:05,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:55:05,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:55:05,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:55:05,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:55:05,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:55:05,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f6ca0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05, skipping insertion in model container [2024-11-19 20:55:05,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:55:05,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2024-11-19 20:55:05,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:55:05,327 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:55:05,354 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2024-11-19 20:55:05,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:55:05,421 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:55:05,421 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05 WrapperNode [2024-11-19 20:55:05,421 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:55:05,422 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:55:05,422 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:55:05,422 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:55:05,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,447 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,467 INFO L138 Inliner]: procedures = 42, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2024-11-19 20:55:05,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:55:05,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:55:05,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:55:05,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:55:05,478 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,480 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,495 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 10, 1]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-19 20:55:05,495 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,495 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,508 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:55:05,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:55:05,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:55:05,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:55:05,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (1/1) ... [2024-11-19 20:55:05,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:55:05,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:55:05,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 20:55:05,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 20:55:05,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:55:05,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:55:05,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 20:55:05,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 20:55:05,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 20:55:05,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 20:55:05,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 20:55:05,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 20:55:05,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:55:05,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:55:05,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 20:55:05,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:55:05,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:55:05,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:55:05,683 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:55:05,685 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:55:05,850 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-19 20:55:05,850 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:55:05,860 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:55:05,860 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 20:55:05,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:55:05 BoogieIcfgContainer [2024-11-19 20:55:05,860 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:55:05,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:55:05,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:55:05,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:55:05,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:55:05" (1/3) ... [2024-11-19 20:55:05,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f46769a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:55:05, skipping insertion in model container [2024-11-19 20:55:05,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:05" (2/3) ... [2024-11-19 20:55:05,869 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f46769a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:55:05, skipping insertion in model container [2024-11-19 20:55:05,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:55:05" (3/3) ... [2024-11-19 20:55:05,870 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-19 20:55:05,881 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:55:05,882 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:55:05,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:55:05,925 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;@28ac0f81, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:55:05,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:55:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 20:55:05,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:05,935 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-11-19 20:55:05,935 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:05,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1672152255, now seen corresponding path program 1 times [2024-11-19 20:55:05,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:05,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365665219] [2024-11-19 20:55:05,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:05,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365665219] [2024-11-19 20:55:06,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365665219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:06,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:06,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:55:06,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532949345] [2024-11-19 20:55:06,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:06,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:55:06,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:06,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:55:06,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:55:06,174 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 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) Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-11-19 20:55:06,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:06,206 INFO L93 Difference]: Finished difference Result 72 states and 106 transitions. [2024-11-19 20:55:06,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:55:06,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-11-19 20:55:06,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:06,214 INFO L225 Difference]: With dead ends: 72 [2024-11-19 20:55:06,214 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 20:55:06,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:55:06,219 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 1 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:06,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:06,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 20:55:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-19 20:55:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 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-11-19 20:55:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-19 20:55:06,242 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 19 [2024-11-19 20:55:06,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:06,243 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-19 20:55:06,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-11-19 20:55:06,243 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-19 20:55:06,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 20:55:06,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:06,244 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] [2024-11-19 20:55:06,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:55:06,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:06,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1194375668, now seen corresponding path program 1 times [2024-11-19 20:55:06,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:06,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159031434] [2024-11-19 20:55:06,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:06,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:06,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:06,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:06,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159031434] [2024-11-19 20:55:06,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159031434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:55:06,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256532673] [2024-11-19 20:55:06,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:06,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:06,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:55:06,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:55:06,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 20:55:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:06,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 20:55:06,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:55:06,437 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:55:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256532673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:06,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 20:55:06,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-19 20:55:06,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562711386] [2024-11-19 20:55:06,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:06,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:55:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:06,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:55:06,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:55:06,440 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:06,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:06,452 INFO L93 Difference]: Finished difference Result 60 states and 80 transitions. [2024-11-19 20:55:06,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:55:06,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-19 20:55:06,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:06,453 INFO L225 Difference]: With dead ends: 60 [2024-11-19 20:55:06,453 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 20:55:06,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:55:06,455 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:06,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 20:55:06,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-19 20:55:06,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:06,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-11-19 20:55:06,473 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 25 [2024-11-19 20:55:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:06,474 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-11-19 20:55:06,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-11-19 20:55:06,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 20:55:06,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:06,475 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] [2024-11-19 20:55:06,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:06,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:06,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:06,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:06,678 INFO L85 PathProgramCache]: Analyzing trace with hash -85488010, now seen corresponding path program 1 times [2024-11-19 20:55:06,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:06,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753902790] [2024-11-19 20:55:06,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:06,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:06,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:06,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753902790] [2024-11-19 20:55:06,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753902790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:55:06,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484357210] [2024-11-19 20:55:06,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:06,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:06,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:55:06,761 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:55:06,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 20:55:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:06,844 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 20:55:06,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:06,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 20:55:06,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:55:06,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484357210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:06,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 20:55:06,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2024-11-19 20:55:06,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680949640] [2024-11-19 20:55:06,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:06,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:55:06,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:06,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:55:06,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:55:06,935 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:07,009 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2024-11-19 20:55:07,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 20:55:07,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-19 20:55:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:07,011 INFO L225 Difference]: With dead ends: 72 [2024-11-19 20:55:07,011 INFO L226 Difference]: Without dead ends: 45 [2024-11-19 20:55:07,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 20:55:07,012 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:07,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:07,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-19 20:55:07,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2024-11-19 20:55:07,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:07,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2024-11-19 20:55:07,016 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 25 [2024-11-19 20:55:07,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:07,016 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2024-11-19 20:55:07,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:07,017 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2024-11-19 20:55:07,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 20:55:07,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:07,017 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] [2024-11-19 20:55:07,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 20:55:07,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 20:55:07,219 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:07,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:07,219 INFO L85 PathProgramCache]: Analyzing trace with hash -26382666, now seen corresponding path program 1 times [2024-11-19 20:55:07,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:07,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460225704] [2024-11-19 20:55:07,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:07,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:07,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:07,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460225704] [2024-11-19 20:55:07,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460225704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:55:07,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [769679762] [2024-11-19 20:55:07,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:07,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:07,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:55:07,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:55:07,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 20:55:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:07,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 20:55:07,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:07,365 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:07,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:07,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [769679762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:07,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:55:07,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-19 20:55:07,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720906080] [2024-11-19 20:55:07,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:07,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 20:55:07,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 20:55:07,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:55:07,400 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:07,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:07,424 INFO L93 Difference]: Finished difference Result 77 states and 99 transitions. [2024-11-19 20:55:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 20:55:07,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-19 20:55:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:07,425 INFO L225 Difference]: With dead ends: 77 [2024-11-19 20:55:07,426 INFO L226 Difference]: Without dead ends: 44 [2024-11-19 20:55:07,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:55:07,427 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:07,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 114 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:07,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-19 20:55:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-11-19 20:55:07,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:07,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2024-11-19 20:55:07,432 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 25 [2024-11-19 20:55:07,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:07,432 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2024-11-19 20:55:07,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:07,433 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2024-11-19 20:55:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 20:55:07,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:07,434 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:07,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 20:55:07,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:07,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:07,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:07,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1034544144, now seen corresponding path program 2 times [2024-11-19 20:55:07,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:07,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518465437] [2024-11-19 20:55:07,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:07,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:07,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:07,811 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:07,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:07,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518465437] [2024-11-19 20:55:07,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518465437] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:55:07,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580832376] [2024-11-19 20:55:07,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:55:07,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:07,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:55:07,816 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:55:07,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 20:55:07,884 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 20:55:07,884 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:55:07,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 20:55:07,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:55:07,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:55:07,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580832376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:07,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 20:55:07,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-19 20:55:07,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363428053] [2024-11-19 20:55:07,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:07,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:55:07,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:07,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:55:07,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-19 20:55:07,989 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:08,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:08,078 INFO L93 Difference]: Finished difference Result 126 states and 162 transitions. [2024-11-19 20:55:08,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 20:55:08,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 20:55:08,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:08,079 INFO L225 Difference]: With dead ends: 126 [2024-11-19 20:55:08,079 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 20:55:08,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-19 20:55:08,080 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 50 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:08,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 133 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:55:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 20:55:08,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 51. [2024-11-19 20:55:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.24) internal successors, (62), 50 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-11-19 20:55:08,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 62 transitions. [2024-11-19 20:55:08,086 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 62 transitions. Word has length 31 [2024-11-19 20:55:08,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:08,087 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 62 transitions. [2024-11-19 20:55:08,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:08,087 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2024-11-19 20:55:08,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 20:55:08,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:08,088 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:08,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:08,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:08,292 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:08,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash -776378706, now seen corresponding path program 1 times [2024-11-19 20:55:08,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:08,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718153878] [2024-11-19 20:55:08,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:08,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:08,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:55:08,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:08,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718153878] [2024-11-19 20:55:08,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718153878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:08,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:08,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 20:55:08,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745986153] [2024-11-19 20:55:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:08,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:55:08,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:08,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:55:08,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:55:08,477 INFO L87 Difference]: Start difference. First operand 51 states and 62 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:08,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:08,591 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2024-11-19 20:55:08,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 20:55:08,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 20:55:08,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:08,595 INFO L225 Difference]: With dead ends: 88 [2024-11-19 20:55:08,596 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 20:55:08,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:55:08,600 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:08,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 111 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:55:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 20:55:08,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 74. [2024-11-19 20:55:08,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 73 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:08,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2024-11-19 20:55:08,609 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 31 [2024-11-19 20:55:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:08,610 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2024-11-19 20:55:08,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2024-11-19 20:55:08,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 20:55:08,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:08,611 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:08,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 20:55:08,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:08,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:08,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1117920663, now seen corresponding path program 1 times [2024-11-19 20:55:08,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:08,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299376319] [2024-11-19 20:55:08,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:08,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:55:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:08,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299376319] [2024-11-19 20:55:08,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299376319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:08,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:08,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:55:08,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654504761] [2024-11-19 20:55:08,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:08,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:55:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:08,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:55:08,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:55:08,676 INFO L87 Difference]: Start difference. First operand 74 states and 92 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-11-19 20:55:08,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:08,691 INFO L93 Difference]: Finished difference Result 109 states and 138 transitions. [2024-11-19 20:55:08,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:55:08,692 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 33 [2024-11-19 20:55:08,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:08,692 INFO L225 Difference]: With dead ends: 109 [2024-11-19 20:55:08,692 INFO L226 Difference]: Without dead ends: 78 [2024-11-19 20:55:08,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:55:08,693 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:08,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:08,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-19 20:55:08,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-19 20:55:08,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 77 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:08,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2024-11-19 20:55:08,698 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 33 [2024-11-19 20:55:08,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:08,698 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2024-11-19 20:55:08,698 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-11-19 20:55:08,698 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2024-11-19 20:55:08,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 20:55:08,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:08,699 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:08,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 20:55:08,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:08,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1510947673, now seen corresponding path program 1 times [2024-11-19 20:55:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:08,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189453501] [2024-11-19 20:55:08,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:08,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:08,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:08,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189453501] [2024-11-19 20:55:08,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189453501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:55:08,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081867478] [2024-11-19 20:55:08,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:08,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:08,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:55:08,772 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:55:08,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 20:55:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:08,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 20:55:08,844 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:08,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:08,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081867478] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:08,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:55:08,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2024-11-19 20:55:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191963297] [2024-11-19 20:55:08,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:08,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 20:55:08,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:08,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 20:55:08,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-19 20:55:08,912 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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-11-19 20:55:08,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:08,939 INFO L93 Difference]: Finished difference Result 151 states and 189 transitions. [2024-11-19 20:55:08,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 20:55:08,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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 33 [2024-11-19 20:55:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:08,941 INFO L225 Difference]: With dead ends: 151 [2024-11-19 20:55:08,941 INFO L226 Difference]: Without dead ends: 84 [2024-11-19 20:55:08,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2024-11-19 20:55:08,942 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:08,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 188 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:08,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-19 20:55:08,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-19 20:55:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.2289156626506024) internal successors, (102), 83 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-11-19 20:55:08,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2024-11-19 20:55:08,951 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 33 [2024-11-19 20:55:08,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:08,954 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2024-11-19 20:55:08,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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-11-19 20:55:08,954 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2024-11-19 20:55:08,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-19 20:55:08,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:08,955 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:08,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:09,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:09,156 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:09,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:09,156 INFO L85 PathProgramCache]: Analyzing trace with hash -664954911, now seen corresponding path program 2 times [2024-11-19 20:55:09,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:09,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823197899] [2024-11-19 20:55:09,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:09,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:09,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:09,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823197899] [2024-11-19 20:55:09,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823197899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:09,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:09,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 20:55:09,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083026784] [2024-11-19 20:55:09,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:09,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:55:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:09,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:55:09,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:55:09,266 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:09,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:09,312 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2024-11-19 20:55:09,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 20:55:09,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 39 [2024-11-19 20:55:09,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:09,313 INFO L225 Difference]: With dead ends: 151 [2024-11-19 20:55:09,313 INFO L226 Difference]: Without dead ends: 104 [2024-11-19 20:55:09,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 20:55:09,315 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 26 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:09,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 149 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:09,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-19 20:55:09,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 87. [2024-11-19 20:55:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.2209302325581395) internal successors, (105), 86 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2024-11-19 20:55:09,325 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 39 [2024-11-19 20:55:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:09,325 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2024-11-19 20:55:09,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2024-11-19 20:55:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 20:55:09,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:09,326 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:09,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 20:55:09,326 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:09,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:09,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1636169070, now seen corresponding path program 1 times [2024-11-19 20:55:09,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:09,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799219591] [2024-11-19 20:55:09,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:09,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-19 20:55:09,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:09,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799219591] [2024-11-19 20:55:09,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799219591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:09,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:09,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 20:55:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818393121] [2024-11-19 20:55:09,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:09,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 20:55:09,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:09,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 20:55:09,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:55:09,445 INFO L87 Difference]: Start difference. First operand 87 states and 105 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-11-19 20:55:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:09,516 INFO L93 Difference]: Finished difference Result 160 states and 197 transitions. [2024-11-19 20:55:09,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 20:55:09,517 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 42 [2024-11-19 20:55:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:09,517 INFO L225 Difference]: With dead ends: 160 [2024-11-19 20:55:09,517 INFO L226 Difference]: Without dead ends: 122 [2024-11-19 20:55:09,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-19 20:55:09,518 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 49 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:09,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 188 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:55:09,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-19 20:55:09,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 101. [2024-11-19 20:55:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.24) internal successors, (124), 100 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-11-19 20:55:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 124 transitions. [2024-11-19 20:55:09,523 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 124 transitions. Word has length 42 [2024-11-19 20:55:09,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:09,528 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 124 transitions. [2024-11-19 20:55:09,528 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-11-19 20:55:09,529 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 124 transitions. [2024-11-19 20:55:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 20:55:09,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:09,529 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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-11-19 20:55:09,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 20:55:09,530 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:09,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:09,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1159200651, now seen corresponding path program 1 times [2024-11-19 20:55:09,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:09,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569618642] [2024-11-19 20:55:09,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:09,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:09,596 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:09,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:09,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569618642] [2024-11-19 20:55:09,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569618642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:55:09,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907722006] [2024-11-19 20:55:09,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:09,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:09,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:55:09,602 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:55:09,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 20:55:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:09,692 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 20:55:09,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:09,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:09,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907722006] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:09,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:55:09,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2024-11-19 20:55:09,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368957446] [2024-11-19 20:55:09,763 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:09,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 20:55:09,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:09,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 20:55:09,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:55:09,764 INFO L87 Difference]: Start difference. First operand 101 states and 124 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:09,832 INFO L93 Difference]: Finished difference Result 226 states and 276 transitions. [2024-11-19 20:55:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 20:55:09,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 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 44 [2024-11-19 20:55:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:09,833 INFO L225 Difference]: With dead ends: 226 [2024-11-19 20:55:09,834 INFO L226 Difference]: Without dead ends: 163 [2024-11-19 20:55:09,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-19 20:55:09,835 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 61 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:09,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 167 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-19 20:55:09,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 137. [2024-11-19 20:55:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.213235294117647) internal successors, (165), 136 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 165 transitions. [2024-11-19 20:55:09,845 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 165 transitions. Word has length 44 [2024-11-19 20:55:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:09,845 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 165 transitions. [2024-11-19 20:55:09,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 165 transitions. [2024-11-19 20:55:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 20:55:09,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:09,846 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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] [2024-11-19 20:55:09,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:10,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:10,047 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:10,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:10,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1026725283, now seen corresponding path program 2 times [2024-11-19 20:55:10,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:10,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116907416] [2024-11-19 20:55:10,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:10,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:10,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:10,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116907416] [2024-11-19 20:55:10,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116907416] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:55:10,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187853108] [2024-11-19 20:55:10,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:55:10,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:10,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:55:10,249 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:55:10,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 20:55:10,336 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 20:55:10,336 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:55:10,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 20:55:10,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:10,481 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:10,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:10,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187853108] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:10,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:55:10,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 20 [2024-11-19 20:55:10,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349407038] [2024-11-19 20:55:10,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:10,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 20:55:10,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:10,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 20:55:10,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-11-19 20:55:10,572 INFO L87 Difference]: Start difference. First operand 137 states and 165 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 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-11-19 20:55:11,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:11,086 INFO L93 Difference]: Finished difference Result 444 states and 565 transitions. [2024-11-19 20:55:11,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 20:55:11,087 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 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 49 [2024-11-19 20:55:11,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:11,088 INFO L225 Difference]: With dead ends: 444 [2024-11-19 20:55:11,088 INFO L226 Difference]: Without dead ends: 241 [2024-11-19 20:55:11,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2024-11-19 20:55:11,089 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 360 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:11,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 587 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:55:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-19 20:55:11,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 159. [2024-11-19 20:55:11,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.2215189873417722) internal successors, (193), 158 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 193 transitions. [2024-11-19 20:55:11,094 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 193 transitions. Word has length 49 [2024-11-19 20:55:11,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:11,094 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 193 transitions. [2024-11-19 20:55:11,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 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-11-19 20:55:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 193 transitions. [2024-11-19 20:55:11,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 20:55:11,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:11,095 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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] [2024-11-19 20:55:11,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:11,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:11,300 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:11,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:11,301 INFO L85 PathProgramCache]: Analyzing trace with hash 15608033, now seen corresponding path program 1 times [2024-11-19 20:55:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:11,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123582183] [2024-11-19 20:55:11,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:11,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:11,465 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:11,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:55:11,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123582183] [2024-11-19 20:55:11,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123582183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:55:11,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840305145] [2024-11-19 20:55:11,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:11,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:55:11,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:55:11,467 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 20:55:11,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 20:55:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:11,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 20:55:11,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:11,758 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:11,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840305145] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:11,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:55:11,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2024-11-19 20:55:11,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344428709] [2024-11-19 20:55:11,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:11,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 20:55:11,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:55:11,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 20:55:11,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2024-11-19 20:55:11,870 INFO L87 Difference]: Start difference. First operand 159 states and 193 transitions. Second operand has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:12,196 INFO L93 Difference]: Finished difference Result 281 states and 337 transitions. [2024-11-19 20:55:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-19 20:55:12,196 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 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 49 [2024-11-19 20:55:12,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:12,197 INFO L225 Difference]: With dead ends: 281 [2024-11-19 20:55:12,197 INFO L226 Difference]: Without dead ends: 279 [2024-11-19 20:55:12,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=271, Invalid=919, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 20:55:12,198 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 287 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:12,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 296 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 20:55:12,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-19 20:55:12,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 181. [2024-11-19 20:55:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.2555555555555555) internal successors, (226), 180 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:12,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 226 transitions. [2024-11-19 20:55:12,203 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 226 transitions. Word has length 49 [2024-11-19 20:55:12,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:12,203 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 226 transitions. [2024-11-19 20:55:12,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.454545454545454) internal successors, (98), 22 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:12,204 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 226 transitions. [2024-11-19 20:55:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 20:55:12,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:12,204 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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] [2024-11-19 20:55:12,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 20:55:12,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-19 20:55:12,409 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:12,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:12,409 INFO L85 PathProgramCache]: Analyzing trace with hash 17455075, now seen corresponding path program 1 times [2024-11-19 20:55:12,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:55:12,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454749587] [2024-11-19 20:55:12,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:12,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:55:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 20:55:12,435 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 20:55:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 20:55:12,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 20:55:12,463 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 20:55:12,464 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 20:55:12,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 20:55:12,467 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:12,489 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 20:55:12,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:55:12 BoogieIcfgContainer [2024-11-19 20:55:12,491 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 20:55:12,491 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 20:55:12,491 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 20:55:12,492 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 20:55:12,492 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:55:05" (3/4) ... [2024-11-19 20:55:12,493 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 20:55:12,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 20:55:12,495 INFO L158 Benchmark]: Toolchain (without parser) took 7386.57ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 95.0MB in the beginning and 129.4MB in the end (delta: -34.4MB). Peak memory consumption was 85.2MB. Max. memory is 16.1GB. [2024-11-19 20:55:12,495 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 167.8MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 20:55:12,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.61ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 138.3MB in the end (delta: -43.5MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2024-11-19 20:55:12,495 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.85ms. Allocated memory is still 167.8MB. Free memory was 138.3MB in the beginning and 136.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:55:12,495 INFO L158 Benchmark]: Boogie Preprocessor took 45.23ms. Allocated memory is still 167.8MB. Free memory was 136.2MB in the beginning and 134.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:55:12,496 INFO L158 Benchmark]: RCFGBuilder took 344.22ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 117.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 20:55:12,496 INFO L158 Benchmark]: TraceAbstraction took 6629.14ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 116.3MB in the beginning and 129.4MB in the end (delta: -13.1MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. [2024-11-19 20:55:12,496 INFO L158 Benchmark]: Witness Printer took 3.01ms. Allocated memory is still 285.2MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 20:55:12,497 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 167.8MB. Free memory is still 121.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.61ms. Allocated memory is still 167.8MB. Free memory was 94.8MB in the beginning and 138.3MB in the end (delta: -43.5MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.85ms. Allocated memory is still 167.8MB. Free memory was 138.3MB in the beginning and 136.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.23ms. Allocated memory is still 167.8MB. Free memory was 136.2MB in the beginning and 134.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 344.22ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 117.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6629.14ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 116.3MB in the beginning and 129.4MB in the end (delta: -13.1MB). Peak memory consumption was 105.3MB. Max. memory is 16.1GB. * Witness Printer took 3.01ms. Allocated memory is still 285.2MB. Free memory is still 129.4MB. 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: 16]: 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 strncpy at line 42. Possible FailurePath: [L86] char A [2 + 2 + 4 +1]; [L87] int i = 0; VAL [A={10:0}, i=0] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=1] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=2] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=3] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=4] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=5] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=6] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={10:0}, i=7] [L87] COND FALSE !(i<2 + 2 + 4 -1) VAL [A={10:0}] [L90] A[2 + 2 + 4] = 0 [L91] CALL parse_expression_list (A) [L60] int start=0, i=-1, j=-1; [L61] char str2[2]; VAL [i=-1, start=0, str2={7:0}, str={10:0}] [L62] COND FALSE !(!str) VAL [i=-1, start=0, str2={7:0}, str={10:0}] [L64] i++ [L65] str[i] [L66] case 0: VAL [i=0, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=1, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=2, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={10:0}] [L67] (str[start] == ' ') || (str[start] == '\t') [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={10:0}] [L67] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L68] str[start] [L66] case 0: [L69] j = i-1 VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L70] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L71] EXPR str[j] [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={10:0}] [L66] case 0: [L66] case 0: [L73] CALL r_strncpy(str2, str+start, j-start+1) [L42] return strncpy(dest,src,n); [L73] RET r_strncpy(str2, str+start, j-start+1) [L74] CALL __VERIFIER_assert(j - start + 1 < 2) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 872 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 872 mSDsluCounter, 2328 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1817 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1429 IncrementalHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 511 mSDtfsCounter, 1429 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 590 GetRequests, 447 SyntacticMatches, 12 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=13, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 287 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 775 NumberOfCodeBlocks, 767 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 900 ConstructedInterpolants, 0 QuantifiedInterpolants, 2276 SizeOfPredicates, 13 NumberOfNonLiveVariables, 1331 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 591/720 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 20:55:12,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:55:14,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:55:14,586 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 20:55:14,590 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:55:14,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:55:14,621 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:55:14,622 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:55:14,622 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:55:14,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:55:14,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:55:14,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:55:14,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:55:14,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:55:14,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:55:14,624 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:55:14,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:55:14,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:55:14,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:55:14,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:55:14,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:55:14,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:55:14,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:55:14,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:55:14,631 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 20:55:14,631 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 20:55:14,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:55:14,631 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 20:55:14,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:55:14,632 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:55:14,632 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:55:14,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:55:14,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:55:14,632 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:55:14,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:55:14,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:55:14,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:55:14,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:55:14,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:55:14,633 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 20:55:14,633 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 20:55:14,633 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:55:14,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:55:14,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:55:14,635 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:55:14,635 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1599706a72281425c0fc51552af364ca390697b315c5af0e88e5d6de4e668c6 [2024-11-19 20:55:14,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:55:14,921 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:55:14,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:55:14,925 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:55:14,925 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:55:14,927 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-19 20:55:16,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:55:16,506 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:55:16,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-19 20:55:16,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40504dc4/d1efc9d624ba44dc8ce874021cf04112/FLAG1f656cd90 [2024-11-19 20:55:16,524 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f40504dc4/d1efc9d624ba44dc8ce874021cf04112 [2024-11-19 20:55:16,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:55:16,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:55:16,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:55:16,528 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:55:16,532 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:55:16,533 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b44e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16, skipping insertion in model container [2024-11-19 20:55:16,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:55:16,713 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2024-11-19 20:55:16,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:55:16,768 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:55:16,778 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/verisec_OpenSER_cases1_stripFullBoth_arr.i[882,895] [2024-11-19 20:55:16,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:55:16,818 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:55:16,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16 WrapperNode [2024-11-19 20:55:16,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:55:16,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:55:16,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:55:16,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:55:16,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,852 INFO L138 Inliner]: procedures = 42, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2024-11-19 20:55:16,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:55:16,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:55:16,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:55:16,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:55:16,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,884 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 10, 1]. 77 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 3 writes are split as follows [0, 2, 1]. [2024-11-19 20:55:16,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,888 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,891 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,892 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,894 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:55:16,895 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:55:16,895 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:55:16,895 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:55:16,895 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (1/1) ... [2024-11-19 20:55:16,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:55:16,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:55:16,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 20:55:16,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 20:55:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:55:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 20:55:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 20:55:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 20:55:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 20:55:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 20:55:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 20:55:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 20:55:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:55:16,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:55:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 20:55:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 20:55:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 20:55:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:55:17,026 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:55:17,027 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:55:17,271 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-19 20:55:17,271 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:55:17,281 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:55:17,282 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 20:55:17,283 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:55:17 BoogieIcfgContainer [2024-11-19 20:55:17,283 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:55:17,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:55:17,285 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:55:17,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:55:17,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:55:16" (1/3) ... [2024-11-19 20:55:17,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b67adc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:55:17, skipping insertion in model container [2024-11-19 20:55:17,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:16" (2/3) ... [2024-11-19 20:55:17,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b67adc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:55:17, skipping insertion in model container [2024-11-19 20:55:17,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:55:17" (3/3) ... [2024-11-19 20:55:17,290 INFO L112 eAbstractionObserver]: Analyzing ICFG verisec_OpenSER_cases1_stripFullBoth_arr.i [2024-11-19 20:55:17,303 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:55:17,304 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 20:55:17,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:55:17,363 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;@27d5230a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:55:17,363 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 20:55:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-19 20:55:17,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:17,371 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-11-19 20:55:17,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:17,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1672152255, now seen corresponding path program 1 times [2024-11-19 20:55:17,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:17,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451397355] [2024-11-19 20:55:17,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:17,385 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:17,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:17,388 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:17,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 20:55:17,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:17,470 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 20:55:17,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:17,488 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:55:17,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:17,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451397355] [2024-11-19 20:55:17,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451397355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:17,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:17,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 20:55:17,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277056583] [2024-11-19 20:55:17,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:17,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 20:55:17,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:17,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 20:55:17,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:55:17,510 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.542857142857143) internal successors, (54), 36 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) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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-11-19 20:55:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:17,521 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2024-11-19 20:55:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 20:55:17,523 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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-11-19 20:55:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:17,528 INFO L225 Difference]: With dead ends: 70 [2024-11-19 20:55:17,528 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 20:55:17,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:55:17,534 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:17,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:17,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 20:55:17,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-19 20:55:17,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 31 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-11-19 20:55:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-11-19 20:55:17,563 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 19 [2024-11-19 20:55:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:17,563 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-11-19 20:55:17,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 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-11-19 20:55:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-11-19 20:55:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 20:55:17,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:17,565 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-11-19 20:55:17,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:17,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:17,766 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:17,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:17,767 INFO L85 PathProgramCache]: Analyzing trace with hash 573346102, now seen corresponding path program 1 times [2024-11-19 20:55:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548267789] [2024-11-19 20:55:17,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:17,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:17,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:17,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:17,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 20:55:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:17,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 20:55:17,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:17,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:55:17,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:17,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548267789] [2024-11-19 20:55:17,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548267789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:17,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:17,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:55:17,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888693738] [2024-11-19 20:55:17,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:17,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:55:17,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:17,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:55:17,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:55:17,897 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) 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-11-19 20:55:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:17,912 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2024-11-19 20:55:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:55:17,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) 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-11-19 20:55:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:17,914 INFO L225 Difference]: With dead ends: 62 [2024-11-19 20:55:17,915 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 20:55:17,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:55:17,916 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:17,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:17,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 20:55:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-19 20:55:17,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 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-11-19 20:55:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2024-11-19 20:55:17,925 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 23 [2024-11-19 20:55:17,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:17,925 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2024-11-19 20:55:17,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) 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-11-19 20:55:17,926 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2024-11-19 20:55:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 20:55:17,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:17,927 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] [2024-11-19 20:55:17,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:18,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:18,131 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:18,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:18,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1194375668, now seen corresponding path program 1 times [2024-11-19 20:55:18,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:18,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526504630] [2024-11-19 20:55:18,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:18,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:18,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:18,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:18,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 20:55:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:18,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 20:55:18,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:18,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:18,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:18,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526504630] [2024-11-19 20:55:18,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526504630] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:18,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:55:18,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 20:55:18,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956597914] [2024-11-19 20:55:18,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:18,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:55:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:18,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:55:18,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:55:18,278 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:18,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:18,329 INFO L93 Difference]: Finished difference Result 67 states and 89 transitions. [2024-11-19 20:55:18,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 20:55:18,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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 25 [2024-11-19 20:55:18,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:18,333 INFO L225 Difference]: With dead ends: 67 [2024-11-19 20:55:18,333 INFO L226 Difference]: Without dead ends: 39 [2024-11-19 20:55:18,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:55:18,334 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:18,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 188 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:18,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-19 20:55:18,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-19 20:55:18,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:18,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2024-11-19 20:55:18,340 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 25 [2024-11-19 20:55:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:18,340 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2024-11-19 20:55:18,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:18,340 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2024-11-19 20:55:18,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 20:55:18,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:18,341 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:18,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 20:55:18,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:18,541 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:18,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash 186214190, now seen corresponding path program 2 times [2024-11-19 20:55:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:18,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420839340] [2024-11-19 20:55:18,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:55:18,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:18,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:18,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:18,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 20:55:18,610 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 20:55:18,610 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:55:18,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 20:55:18,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 20:55:18,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:55:18,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:18,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420839340] [2024-11-19 20:55:18,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420839340] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:18,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:18,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 20:55:18,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172176236] [2024-11-19 20:55:18,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:18,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 20:55:18,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:18,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 20:55:18,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:55:18,628 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:18,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:18,647 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2024-11-19 20:55:18,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 20:55:18,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-19 20:55:18,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:18,649 INFO L225 Difference]: With dead ends: 66 [2024-11-19 20:55:18,649 INFO L226 Difference]: Without dead ends: 40 [2024-11-19 20:55:18,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 20:55:18,650 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:18,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-19 20:55:18,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-19 20:55:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2024-11-19 20:55:18,654 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 31 [2024-11-19 20:55:18,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:18,656 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2024-11-19 20:55:18,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:18,656 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2024-11-19 20:55:18,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 20:55:18,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:18,657 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:18,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 20:55:18,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:18,858 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:18,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:18,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1093649488, now seen corresponding path program 1 times [2024-11-19 20:55:18,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:18,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717935983] [2024-11-19 20:55:18,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:18,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:18,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:18,862 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:18,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 20:55:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:18,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 20:55:18,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:18,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 20:55:19,039 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:19,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717935983] [2024-11-19 20:55:19,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717935983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:19,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:55:19,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 20:55:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5069471] [2024-11-19 20:55:19,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:19,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 20:55:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:19,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 20:55:19,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2024-11-19 20:55:19,041 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 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-11-19 20:55:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:19,116 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2024-11-19 20:55:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 20:55:19,117 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 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 31 [2024-11-19 20:55:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:19,118 INFO L225 Difference]: With dead ends: 75 [2024-11-19 20:55:19,118 INFO L226 Difference]: Without dead ends: 46 [2024-11-19 20:55:19,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-19 20:55:19,119 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 3 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:19,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 262 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:55:19,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-19 20:55:19,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-19 20:55:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2024-11-19 20:55:19,130 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 31 [2024-11-19 20:55:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:19,130 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2024-11-19 20:55:19,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 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-11-19 20:55:19,131 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2024-11-19 20:55:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:55:19,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:19,131 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:19,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 20:55:19,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:19,336 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:19,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:19,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2031315606, now seen corresponding path program 2 times [2024-11-19 20:55:19,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:19,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962806350] [2024-11-19 20:55:19,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:55:19,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:19,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:19,340 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:19,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 20:55:19,403 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 20:55:19,403 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:55:19,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 20:55:19,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:19,507 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:19,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:55:19,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:19,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962806350] [2024-11-19 20:55:19,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962806350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:19,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:19,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 20:55:19,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320021650] [2024-11-19 20:55:19,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:19,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 20:55:19,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:19,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 20:55:19,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:55:19,508 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:19,658 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2024-11-19 20:55:19,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 20:55:19,659 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-19 20:55:19,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:19,660 INFO L225 Difference]: With dead ends: 139 [2024-11-19 20:55:19,660 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 20:55:19,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 20:55:19,661 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 93 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:19,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 223 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:55:19,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 20:55:19,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2024-11-19 20:55:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2024-11-19 20:55:19,668 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 37 [2024-11-19 20:55:19,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:19,668 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2024-11-19 20:55:19,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:19,668 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-19 20:55:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:55:19,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:19,669 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:19,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 20:55:19,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:19,870 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:19,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:19,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1773150168, now seen corresponding path program 1 times [2024-11-19 20:55:19,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:19,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [252793435] [2024-11-19 20:55:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:19,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:19,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:19,873 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:19,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 20:55:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:19,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 20:55:19,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:19,991 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:19,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:55:19,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:19,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [252793435] [2024-11-19 20:55:19,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [252793435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:19,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:19,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 20:55:19,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129514071] [2024-11-19 20:55:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:19,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:55:19,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:19,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:55:19,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:55:19,993 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:20,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:20,084 INFO L93 Difference]: Finished difference Result 143 states and 190 transitions. [2024-11-19 20:55:20,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 20:55:20,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-19 20:55:20,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:20,085 INFO L225 Difference]: With dead ends: 143 [2024-11-19 20:55:20,085 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 20:55:20,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 20:55:20,086 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 58 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:20,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 144 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:55:20,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 20:55:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 88. [2024-11-19 20:55:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 87 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:20,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2024-11-19 20:55:20,092 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 37 [2024-11-19 20:55:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:20,092 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2024-11-19 20:55:20,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:20,093 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2024-11-19 20:55:20,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 20:55:20,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:20,093 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:20,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:20,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:20,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:20,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1714044824, now seen corresponding path program 1 times [2024-11-19 20:55:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:20,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329736736] [2024-11-19 20:55:20,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:20,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:20,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:20,303 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:20,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 20:55:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:20,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 20:55:20,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:20,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:55:20,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:20,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329736736] [2024-11-19 20:55:20,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329736736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:20,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:20,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 20:55:20,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39372293] [2024-11-19 20:55:20,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:20,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:55:20,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:20,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:55:20,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:55:20,431 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:20,509 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2024-11-19 20:55:20,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 20:55:20,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-19 20:55:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:20,510 INFO L225 Difference]: With dead ends: 145 [2024-11-19 20:55:20,510 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 20:55:20,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:55:20,510 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:20,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 137 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:55:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 20:55:20,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2024-11-19 20:55:20,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3333333333333333) internal successors, (124), 93 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-11-19 20:55:20,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2024-11-19 20:55:20,516 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 124 transitions. Word has length 37 [2024-11-19 20:55:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:20,516 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 124 transitions. [2024-11-19 20:55:20,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 124 transitions. [2024-11-19 20:55:20,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 20:55:20,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:20,517 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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-11-19 20:55:20,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:20,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:20,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:20,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:20,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1288644661, now seen corresponding path program 1 times [2024-11-19 20:55:20,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:20,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446122291] [2024-11-19 20:55:20,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:20,723 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:20,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:20,725 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:20,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 20:55:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:20,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 20:55:20,828 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:20,969 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:20,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:21,106 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:21,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446122291] [2024-11-19 20:55:21,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446122291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:21,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:55:21,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 20:55:21,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388381214] [2024-11-19 20:55:21,107 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:21,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 20:55:21,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:21,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 20:55:21,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-19 20:55:21,108 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:22,199 INFO L93 Difference]: Finished difference Result 397 states and 537 transitions. [2024-11-19 20:55:22,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 20:55:22,200 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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-11-19 20:55:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:22,203 INFO L225 Difference]: With dead ends: 397 [2024-11-19 20:55:22,203 INFO L226 Difference]: Without dead ends: 351 [2024-11-19 20:55:22,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2024-11-19 20:55:22,204 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 507 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:22,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 405 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 20:55:22,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2024-11-19 20:55:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 151. [2024-11-19 20:55:22,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.38) internal successors, (207), 150 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-11-19 20:55:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 207 transitions. [2024-11-19 20:55:22,224 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 207 transitions. Word has length 40 [2024-11-19 20:55:22,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:22,225 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 207 transitions. [2024-11-19 20:55:22,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:22,225 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 207 transitions. [2024-11-19 20:55:22,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 20:55:22,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:22,226 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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-11-19 20:55:22,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 20:55:22,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:22,426 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:22,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:22,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1588600624, now seen corresponding path program 1 times [2024-11-19 20:55:22,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:22,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2073689814] [2024-11-19 20:55:22,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:22,427 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:22,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:22,430 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:22,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 20:55:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:22,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 20:55:22,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:22,558 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:55:22,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:22,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2073689814] [2024-11-19 20:55:22,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2073689814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:22,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:22,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 20:55:22,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552554251] [2024-11-19 20:55:22,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:22,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:55:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:55:22,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:55:22,559 INFO L87 Difference]: Start difference. First operand 151 states and 207 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-11-19 20:55:22,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:22,639 INFO L93 Difference]: Finished difference Result 206 states and 277 transitions. [2024-11-19 20:55:22,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 20:55:22,640 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 40 [2024-11-19 20:55:22,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:22,640 INFO L225 Difference]: With dead ends: 206 [2024-11-19 20:55:22,640 INFO L226 Difference]: Without dead ends: 143 [2024-11-19 20:55:22,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 20:55:22,641 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 32 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:22,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 180 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:55:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-19 20:55:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 126. [2024-11-19 20:55:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 125 states have (on average 1.32) internal successors, (165), 125 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 165 transitions. [2024-11-19 20:55:22,647 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 165 transitions. Word has length 40 [2024-11-19 20:55:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:22,647 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 165 transitions. [2024-11-19 20:55:22,647 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-11-19 20:55:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 165 transitions. [2024-11-19 20:55:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 20:55:22,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:22,648 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:22,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 20:55:22,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:22,849 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:22,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:22,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1695274414, now seen corresponding path program 1 times [2024-11-19 20:55:22,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:22,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1550787951] [2024-11-19 20:55:22,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:22,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:22,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:22,854 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:22,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 20:55:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:22,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 20:55:22,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:22,966 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:22,966 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:23,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:23,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1550787951] [2024-11-19 20:55:23,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1550787951] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:23,032 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:55:23,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-19 20:55:23,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708690708] [2024-11-19 20:55:23,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:23,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 20:55:23,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:23,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 20:55:23,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-19 20:55:23,033 INFO L87 Difference]: Start difference. First operand 126 states and 165 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:23,232 INFO L93 Difference]: Finished difference Result 244 states and 316 transitions. [2024-11-19 20:55:23,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 20:55:23,232 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-19 20:55:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:23,233 INFO L225 Difference]: With dead ends: 244 [2024-11-19 20:55:23,233 INFO L226 Difference]: Without dead ends: 211 [2024-11-19 20:55:23,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-19 20:55:23,234 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 130 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:23,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 379 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:55:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-19 20:55:23,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 171. [2024-11-19 20:55:23,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 170 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 226 transitions. [2024-11-19 20:55:23,240 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 226 transitions. Word has length 42 [2024-11-19 20:55:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:23,241 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 226 transitions. [2024-11-19 20:55:23,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:23,241 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 226 transitions. [2024-11-19 20:55:23,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 20:55:23,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:23,242 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:23,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:23,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:23,442 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:23,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:23,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1378003632, now seen corresponding path program 1 times [2024-11-19 20:55:23,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:23,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108852698] [2024-11-19 20:55:23,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:23,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:23,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:23,445 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:23,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 20:55:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:23,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 20:55:23,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:23,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:23,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:23,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108852698] [2024-11-19 20:55:23,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108852698] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:23,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:55:23,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-19 20:55:23,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705472161] [2024-11-19 20:55:23,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:23,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 20:55:23,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:23,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 20:55:23,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-19 20:55:23,772 INFO L87 Difference]: Start difference. First operand 171 states and 226 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:24,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:24,916 INFO L93 Difference]: Finished difference Result 442 states and 591 transitions. [2024-11-19 20:55:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 20:55:24,916 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-11-19 20:55:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:24,917 INFO L225 Difference]: With dead ends: 442 [2024-11-19 20:55:24,917 INFO L226 Difference]: Without dead ends: 440 [2024-11-19 20:55:24,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2024-11-19 20:55:24,918 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 295 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:24,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 510 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 20:55:24,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-19 20:55:24,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 225. [2024-11-19 20:55:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.3482142857142858) internal successors, (302), 224 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:24,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 302 transitions. [2024-11-19 20:55:24,951 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 302 transitions. Word has length 42 [2024-11-19 20:55:24,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:24,951 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 302 transitions. [2024-11-19 20:55:24,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:24,951 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 302 transitions. [2024-11-19 20:55:24,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 20:55:24,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:24,952 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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] [2024-11-19 20:55:24,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 20:55:25,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:25,158 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:25,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:25,158 INFO L85 PathProgramCache]: Analyzing trace with hash 208496234, now seen corresponding path program 2 times [2024-11-19 20:55:25,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:25,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173793999] [2024-11-19 20:55:25,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 20:55:25,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:25,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:25,161 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:25,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 20:55:25,223 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 20:55:25,223 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 20:55:25,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 20:55:25,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:25,279 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 20:55:25,283 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:55:25,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:25,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173793999] [2024-11-19 20:55:25,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173793999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:25,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:25,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 20:55:25,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188572686] [2024-11-19 20:55:25,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:25,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 20:55:25,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:25,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 20:55:25,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 20:55:25,284 INFO L87 Difference]: Start difference. First operand 225 states and 302 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:25,442 INFO L93 Difference]: Finished difference Result 305 states and 403 transitions. [2024-11-19 20:55:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 20:55:25,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-19 20:55:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:25,444 INFO L225 Difference]: With dead ends: 305 [2024-11-19 20:55:25,444 INFO L226 Difference]: Without dead ends: 243 [2024-11-19 20:55:25,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 20:55:25,444 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:25,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:55:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-11-19 20:55:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 222. [2024-11-19 20:55:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 1.3484162895927603) internal successors, (298), 221 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 298 transitions. [2024-11-19 20:55:25,451 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 298 transitions. Word has length 47 [2024-11-19 20:55:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:25,452 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 298 transitions. [2024-11-19 20:55:25,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:25,452 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 298 transitions. [2024-11-19 20:55:25,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 20:55:25,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:25,452 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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] [2024-11-19 20:55:25,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 20:55:25,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:25,655 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:25,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash 267601578, now seen corresponding path program 1 times [2024-11-19 20:55:25,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:25,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143831890] [2024-11-19 20:55:25,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:25,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:25,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:25,659 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:25,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 20:55:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:25,742 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 20:55:25,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:25,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:25,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:25,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2143831890] [2024-11-19 20:55:25,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2143831890] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:25,926 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:55:25,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2024-11-19 20:55:25,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658968657] [2024-11-19 20:55:25,927 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:25,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 20:55:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 20:55:25,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-19 20:55:25,928 INFO L87 Difference]: Start difference. First operand 222 states and 298 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:26,391 INFO L93 Difference]: Finished difference Result 689 states and 907 transitions. [2024-11-19 20:55:26,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 20:55:26,392 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-19 20:55:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:26,394 INFO L225 Difference]: With dead ends: 689 [2024-11-19 20:55:26,394 INFO L226 Difference]: Without dead ends: 627 [2024-11-19 20:55:26,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2024-11-19 20:55:26,395 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 760 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:26,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 721 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 20:55:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-19 20:55:26,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 509. [2024-11-19 20:55:26,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 508 states have (on average 1.328740157480315) internal successors, (675), 508 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 675 transitions. [2024-11-19 20:55:26,411 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 675 transitions. Word has length 47 [2024-11-19 20:55:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:26,411 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 675 transitions. [2024-11-19 20:55:26,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 675 transitions. [2024-11-19 20:55:26,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 20:55:26,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:26,412 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:26,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:26,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:26,613 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:26,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash 100862541, now seen corresponding path program 1 times [2024-11-19 20:55:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:26,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475223332] [2024-11-19 20:55:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:26,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:26,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:26,616 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:26,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 20:55:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:26,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 20:55:26,710 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-19 20:55:26,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-19 20:55:26,788 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:26,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475223332] [2024-11-19 20:55:26,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475223332] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:26,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:55:26,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-19 20:55:26,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912618087] [2024-11-19 20:55:26,788 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:26,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 20:55:26,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:26,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 20:55:26,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-19 20:55:26,789 INFO L87 Difference]: Start difference. First operand 509 states and 675 transitions. Second operand has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:26,919 INFO L93 Difference]: Finished difference Result 844 states and 1110 transitions. [2024-11-19 20:55:26,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 20:55:26,921 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-19 20:55:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:26,922 INFO L225 Difference]: With dead ends: 844 [2024-11-19 20:55:26,922 INFO L226 Difference]: Without dead ends: 478 [2024-11-19 20:55:26,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-19 20:55:26,925 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 105 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:26,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 358 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:55:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-19 20:55:26,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 470. [2024-11-19 20:55:26,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 469 states have (on average 1.302771855010661) internal successors, (611), 469 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:26,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 611 transitions. [2024-11-19 20:55:26,936 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 611 transitions. Word has length 47 [2024-11-19 20:55:26,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:26,937 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 611 transitions. [2024-11-19 20:55:26,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 611 transitions. [2024-11-19 20:55:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-19 20:55:26,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:26,938 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:26,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 20:55:27,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:27,141 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:27,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:27,141 INFO L85 PathProgramCache]: Analyzing trace with hash 734702770, now seen corresponding path program 1 times [2024-11-19 20:55:27,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:27,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329176554] [2024-11-19 20:55:27,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:27,141 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:27,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:27,143 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:27,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 20:55:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:27,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 20:55:27,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:27,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:27,606 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:27,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329176554] [2024-11-19 20:55:27,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329176554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:27,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:55:27,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 20:55:27,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900920059] [2024-11-19 20:55:27,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:27,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 20:55:27,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:27,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 20:55:27,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-19 20:55:27,607 INFO L87 Difference]: Start difference. First operand 470 states and 611 transitions. Second operand has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:28,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:28,911 INFO L93 Difference]: Finished difference Result 1092 states and 1416 transitions. [2024-11-19 20:55:28,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 20:55:28,916 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-19 20:55:28,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:28,918 INFO L225 Difference]: With dead ends: 1092 [2024-11-19 20:55:28,918 INFO L226 Difference]: Without dead ends: 719 [2024-11-19 20:55:28,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2024-11-19 20:55:28,919 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 412 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:28,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 647 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 20:55:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2024-11-19 20:55:28,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 524. [2024-11-19 20:55:28,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 523 states have (on average 1.311663479923518) internal successors, (686), 523 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 686 transitions. [2024-11-19 20:55:28,937 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 686 transitions. Word has length 48 [2024-11-19 20:55:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:28,938 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 686 transitions. [2024-11-19 20:55:28,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0) internal successors, (64), 16 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:28,938 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 686 transitions. [2024-11-19 20:55:28,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 20:55:28,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:28,938 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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] [2024-11-19 20:55:28,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-19 20:55:29,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:29,139 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:29,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:29,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1419752293, now seen corresponding path program 1 times [2024-11-19 20:55:29,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972909171] [2024-11-19 20:55:29,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:29,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:29,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:29,142 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:29,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 20:55:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:29,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 20:55:29,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-19 20:55:29,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 20:55:29,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:29,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972909171] [2024-11-19 20:55:29,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1972909171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:55:29,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:55:29,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:55:29,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792140462] [2024-11-19 20:55:29,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:55:29,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:55:29,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:29,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:55:29,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:55:29,244 INFO L87 Difference]: Start difference. First operand 524 states and 686 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:29,266 INFO L93 Difference]: Finished difference Result 826 states and 1087 transitions. [2024-11-19 20:55:29,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:55:29,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 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 49 [2024-11-19 20:55:29,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:29,269 INFO L225 Difference]: With dead ends: 826 [2024-11-19 20:55:29,269 INFO L226 Difference]: Without dead ends: 548 [2024-11-19 20:55:29,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:55:29,270 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:29,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:55:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-11-19 20:55:29,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 534. [2024-11-19 20:55:29,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.3058161350844277) internal successors, (696), 533 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 696 transitions. [2024-11-19 20:55:29,291 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 696 transitions. Word has length 49 [2024-11-19 20:55:29,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:29,292 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 696 transitions. [2024-11-19 20:55:29,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:29,292 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 696 transitions. [2024-11-19 20:55:29,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 20:55:29,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:29,293 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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] [2024-11-19 20:55:29,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:29,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:29,494 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:29,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:29,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1026725283, now seen corresponding path program 1 times [2024-11-19 20:55:29,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:29,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780468063] [2024-11-19 20:55:29,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:29,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:29,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:29,501 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:29,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 20:55:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:29,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 20:55:29,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:29,802 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:29,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:29,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:29,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780468063] [2024-11-19 20:55:29,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780468063] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:29,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:55:29,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 20:55:29,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687940683] [2024-11-19 20:55:29,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:29,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 20:55:29,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:29,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 20:55:29,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-19 20:55:29,976 INFO L87 Difference]: Start difference. First operand 534 states and 696 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:30,973 INFO L93 Difference]: Finished difference Result 1005 states and 1302 transitions. [2024-11-19 20:55:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 20:55:30,974 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 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 49 [2024-11-19 20:55:30,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:30,976 INFO L225 Difference]: With dead ends: 1005 [2024-11-19 20:55:30,976 INFO L226 Difference]: Without dead ends: 700 [2024-11-19 20:55:30,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2024-11-19 20:55:30,977 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 669 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 709 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 709 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:30,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 704 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 709 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 20:55:30,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-19 20:55:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 556. [2024-11-19 20:55:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 1.3045045045045045) internal successors, (724), 555 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:30,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 724 transitions. [2024-11-19 20:55:30,993 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 724 transitions. Word has length 49 [2024-11-19 20:55:30,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:30,993 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 724 transitions. [2024-11-19 20:55:30,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 16 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:30,993 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 724 transitions. [2024-11-19 20:55:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 20:55:30,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:30,994 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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] [2024-11-19 20:55:31,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-19 20:55:31,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:31,195 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:31,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:31,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1028572325, now seen corresponding path program 1 times [2024-11-19 20:55:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:31,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450183180] [2024-11-19 20:55:31,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:31,195 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:31,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:31,199 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:31,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 20:55:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:31,347 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 20:55:31,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:31,488 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:31,747 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:31,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:31,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450183180] [2024-11-19 20:55:31,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450183180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:31,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:55:31,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2024-11-19 20:55:31,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088112355] [2024-11-19 20:55:31,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:31,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 20:55:31,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:31,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 20:55:31,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-19 20:55:31,752 INFO L87 Difference]: Start difference. First operand 556 states and 724 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:33,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:33,729 INFO L93 Difference]: Finished difference Result 2184 states and 2856 transitions. [2024-11-19 20:55:33,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-19 20:55:33,729 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 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 49 [2024-11-19 20:55:33,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:33,734 INFO L225 Difference]: With dead ends: 2184 [2024-11-19 20:55:33,734 INFO L226 Difference]: Without dead ends: 2182 [2024-11-19 20:55:33,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=252, Invalid=1008, Unknown=0, NotChecked=0, Total=1260 [2024-11-19 20:55:33,735 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 616 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:33,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 849 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 20:55:33,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2182 states. [2024-11-19 20:55:33,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2182 to 643. [2024-11-19 20:55:33,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.3255451713395638) internal successors, (851), 642 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:33,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 851 transitions. [2024-11-19 20:55:33,762 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 851 transitions. Word has length 49 [2024-11-19 20:55:33,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:33,762 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 851 transitions. [2024-11-19 20:55:33,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 851 transitions. [2024-11-19 20:55:33,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 20:55:33,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:33,763 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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] [2024-11-19 20:55:33,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-19 20:55:33,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:33,981 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:33,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:33,981 INFO L85 PathProgramCache]: Analyzing trace with hash 15608033, now seen corresponding path program 1 times [2024-11-19 20:55:33,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:33,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744779105] [2024-11-19 20:55:33,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:33,982 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:33,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:33,984 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:33,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-19 20:55:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:55:34,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 20:55:34,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:55:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:34,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:55:34,375 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-19 20:55:34,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 20:55:34,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744779105] [2024-11-19 20:55:34,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744779105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:55:34,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 20:55:34,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-19 20:55:34,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396098858] [2024-11-19 20:55:34,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 20:55:34,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 20:55:34,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 20:55:34,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 20:55:34,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-19 20:55:34,378 INFO L87 Difference]: Start difference. First operand 643 states and 851 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:55:37,572 INFO L93 Difference]: Finished difference Result 2536 states and 3312 transitions. [2024-11-19 20:55:37,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2024-11-19 20:55:37,572 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 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 49 [2024-11-19 20:55:37,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:55:37,582 INFO L225 Difference]: With dead ends: 2536 [2024-11-19 20:55:37,582 INFO L226 Difference]: Without dead ends: 2534 [2024-11-19 20:55:37,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=380, Invalid=1782, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 20:55:37,586 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 760 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 1084 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 1144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:55:37,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 1038 Invalid, 1144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1084 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-19 20:55:37,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2534 states. [2024-11-19 20:55:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2534 to 780. [2024-11-19 20:55:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 1.332477535301669) internal successors, (1038), 779 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1038 transitions. [2024-11-19 20:55:37,683 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1038 transitions. Word has length 49 [2024-11-19 20:55:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:55:37,683 INFO L471 AbstractCegarLoop]: Abstraction has 780 states and 1038 transitions. [2024-11-19 20:55:37,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 20:55:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1038 transitions. [2024-11-19 20:55:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 20:55:37,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:55:37,684 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 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] [2024-11-19 20:55:37,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-19 20:55:37,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:37,885 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:55:37,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:55:37,885 INFO L85 PathProgramCache]: Analyzing trace with hash 17455075, now seen corresponding path program 1 times [2024-11-19 20:55:37,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 20:55:37,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1136155229] [2024-11-19 20:55:37,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:55:37,886 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:37,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 20:55:37,887 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 20:55:37,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-19 20:55:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 20:55:37,996 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 20:55:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 20:55:38,078 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 20:55:38,079 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 20:55:38,079 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 20:55:38,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-19 20:55:38,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 20:55:38,284 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:55:38,311 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 20:55:38,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:55:38 BoogieIcfgContainer [2024-11-19 20:55:38,313 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 20:55:38,313 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 20:55:38,313 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 20:55:38,313 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 20:55:38,314 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:55:17" (3/4) ... [2024-11-19 20:55:38,316 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 20:55:38,316 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 20:55:38,317 INFO L158 Benchmark]: Toolchain (without parser) took 21789.78ms. Allocated memory was 81.8MB in the beginning and 195.0MB in the end (delta: 113.2MB). Free memory was 44.8MB in the beginning and 120.5MB in the end (delta: -75.8MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2024-11-19 20:55:38,317 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 81.8MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 20:55:38,317 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.96ms. Allocated memory is still 81.8MB. Free memory was 44.6MB in the beginning and 53.7MB in the end (delta: -9.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2024-11-19 20:55:38,317 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.80ms. Allocated memory is still 81.8MB. Free memory was 53.7MB in the beginning and 51.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:55:38,318 INFO L158 Benchmark]: Boogie Preprocessor took 39.57ms. Allocated memory is still 81.8MB. Free memory was 51.8MB in the beginning and 49.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 20:55:38,318 INFO L158 Benchmark]: RCFGBuilder took 388.28ms. Allocated memory was 81.8MB in the beginning and 134.2MB in the end (delta: 52.4MB). Free memory was 49.3MB in the beginning and 108.2MB in the end (delta: -58.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-19 20:55:38,318 INFO L158 Benchmark]: TraceAbstraction took 21028.34ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 107.2MB in the beginning and 120.5MB in the end (delta: -13.4MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2024-11-19 20:55:38,318 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 195.0MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 20:55:38,319 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.74ms. Allocated memory is still 81.8MB. Free memory is still 50.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.96ms. Allocated memory is still 81.8MB. Free memory was 44.6MB in the beginning and 53.7MB in the end (delta: -9.1MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.80ms. Allocated memory is still 81.8MB. Free memory was 53.7MB in the beginning and 51.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.57ms. Allocated memory is still 81.8MB. Free memory was 51.8MB in the beginning and 49.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 388.28ms. Allocated memory was 81.8MB in the beginning and 134.2MB in the end (delta: 52.4MB). Free memory was 49.3MB in the beginning and 108.2MB in the end (delta: -58.9MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 21028.34ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 107.2MB in the beginning and 120.5MB in the end (delta: -13.4MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 195.0MB. Free memory is still 120.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: 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 strncpy at line 42. Possible FailurePath: [L86] char A [2 + 2 + 4 +1]; [L87] int i = 0; VAL [A={3:0}, i=0] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=1] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=2] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=3] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=4] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=5] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=6] [L87] COND TRUE i<2 + 2 + 4 -1 [L88] A[i] = __VERIFIER_nondet_char() [L87] i++ VAL [A={3:0}, i=7] [L87] COND FALSE !(i<2 + 2 + 4 -1) VAL [A={3:0}] [L90] A[2 + 2 + 4] = 0 [L91] CALL parse_expression_list (A) [L60] int start=0, i=-1, j=-1; [L61] char str2[2]; VAL [i=-1, start=0, str2={7:0}, str={3:0}] [L62] COND FALSE !(!str) VAL [i=-1, start=0, str2={7:0}, str={3:0}] [L64] i++ [L65] str[i] [L66] case 0: VAL [i=0, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=1, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L81] EXPR str[i] [L81] COND TRUE str[i] != 0 [L64] i++ [L65] str[i] [L66] case 0: VAL [i=2, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={3:0}] [L67] (str[start] == ' ') || (str[start] == '\t') [L67] EXPR str[start] [L67] (str[start] == ' ') || (str[start] == '\t') VAL [i=2, start=0, str2={7:0}, str={3:0}] [L67] COND FALSE !((str[start] == ' ') || (str[start] == '\t')) [L68] str[start] [L66] case 0: [L69] j = i-1 VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') [L70] EXPR str[j] [L70] EXPR (str[j] == ' ') || (str[j] == '\t') VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] (0 < j) && ((str[j] == ' ') || (str[j] == '\t')) VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L70] COND FALSE !((0 < j) && ((str[j] == ' ') || (str[j] == '\t'))) [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L71] EXPR str[j] [L71] (0 < j) && (str[j] == '"') VAL [i=2, j=1, start=0, str2={7:0}, str={3:0}] [L66] case 0: [L66] case 0: [L73] CALL r_strncpy(str2, str+start, j-start+1) [L42] return strncpy(dest,src,n); [L73] RET r_strncpy(str2, str+start, j-start+1) [L74] CALL __VERIFIER_assert(j - start + 1 < 2) [L15] COND TRUE !(cond) [L16] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.9s, OverallIterations: 21, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4493 SdHoareTripleChecker+Valid, 7.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4493 mSDsluCounter, 7175 SdHoareTripleChecker+Invalid, 6.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6050 mSDsCounter, 225 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5013 IncrementalHoareTripleChecker+Invalid, 5238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 225 mSolverCounterUnsat, 1125 mSDtfsCounter, 5013 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1357 GetRequests, 1085 SyntacticMatches, 1 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=780occurred in iteration=20, InterpolantAutomatonStates: 256, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 4346 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 838 NumberOfCodeBlocks, 792 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1227 ConstructedInterpolants, 0 QuantifiedInterpolants, 3785 SizeOfPredicates, 26 NumberOfNonLiveVariables, 2165 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 31 InterpolantComputations, 9 PerfectInterpolantSequences, 1219/1365 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 20:55:38,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample