./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/string-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/string-2.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 fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:41:36,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:41:36,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:41:36,668 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:41:36,669 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:41:36,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:41:36,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:41:36,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:41:36,702 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:41:36,703 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:41:36,703 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:41:36,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:41:36,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:41:36,704 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:41:36,704 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:41:36,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:41:36,704 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:41:36,705 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:41:36,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:41:36,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:41:36,705 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:41:36,709 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:41:36,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:41:36,709 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:41:36,709 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:41:36,709 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:41:36,710 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:41:36,710 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:41:36,710 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:41:36,710 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:41:36,710 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:41:36,710 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:41:36,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:41:36,711 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:41:36,711 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:41:36,711 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:41:36,711 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:41:36,711 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:41:36,712 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:41:36,712 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:41:36,712 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:41:36,713 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:41:36,713 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 -> fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 [2024-11-16 06:41:36,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:41:36,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:41:36,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:41:36,933 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:41:36,937 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:41:36,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2024-11-16 06:41:38,340 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:41:38,506 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:41:38,509 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2024-11-16 06:41:38,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878530db1/7f6edd808017484282bc0830459a8d97/FLAG2f78ac610 [2024-11-16 06:41:38,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/878530db1/7f6edd808017484282bc0830459a8d97 [2024-11-16 06:41:38,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:41:38,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:41:38,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:41:38,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:41:38,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:41:38,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:41:38" (1/1) ... [2024-11-16 06:41:38,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dc523cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:38, skipping insertion in model container [2024-11-16 06:41:38,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:41:38" (1/1) ... [2024-11-16 06:41:38,923 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:41:39,090 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/string-2.i[896,909] [2024-11-16 06:41:39,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:41:39,117 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:41:39,126 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/string-2.i[896,909] [2024-11-16 06:41:39,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:41:39,145 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:41:39,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39 WrapperNode [2024-11-16 06:41:39,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:41:39,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:41:39,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:41:39,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:41:39,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (1/1) ... [2024-11-16 06:41:39,156 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (1/1) ... [2024-11-16 06:41:39,169 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2024-11-16 06:41:39,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:41:39,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:41:39,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:41:39,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:41:39,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (1/1) ... [2024-11-16 06:41:39,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (1/1) ... [2024-11-16 06:41:39,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (1/1) ... [2024-11-16 06:41:39,220 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-16 06:41:39,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (1/1) ... [2024-11-16 06:41:39,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (1/1) ... [2024-11-16 06:41:39,224 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (1/1) ... [2024-11-16 06:41:39,225 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (1/1) ... [2024-11-16 06:41:39,225 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (1/1) ... [2024-11-16 06:41:39,226 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (1/1) ... [2024-11-16 06:41:39,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:41:39,228 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:41:39,228 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:41:39,228 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:41:39,229 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (1/1) ... [2024-11-16 06:41:39,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:41:39,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:41:39,269 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-16 06:41:39,274 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-16 06:41:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:41:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:41:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 06:41:39,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 06:41:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 06:41:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 06:41:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 06:41:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 06:41:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:41:39,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:41:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 06:41:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 06:41:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 06:41:39,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 06:41:39,376 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:41:39,378 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:41:39,509 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(main_~#string_A~0#1.base, main_~#string_A~0#1.offset);havoc main_~#string_A~0#1.base, main_~#string_A~0#1.offset;call ULTIMATE.dealloc(main_~#string_B~0#1.base, main_~#string_B~0#1.offset);havoc main_~#string_B~0#1.base, main_~#string_B~0#1.offset; [2024-11-16 06:41:39,523 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-16 06:41:39,523 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:41:39,539 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:41:39,539 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:41:39,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:41:39 BoogieIcfgContainer [2024-11-16 06:41:39,539 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:41:39,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:41:39,542 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:41:39,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:41:39,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:41:38" (1/3) ... [2024-11-16 06:41:39,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acdf3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:41:39, skipping insertion in model container [2024-11-16 06:41:39,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:39" (2/3) ... [2024-11-16 06:41:39,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1acdf3e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:41:39, skipping insertion in model container [2024-11-16 06:41:39,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:41:39" (3/3) ... [2024-11-16 06:41:39,549 INFO L112 eAbstractionObserver]: Analyzing ICFG string-2.i [2024-11-16 06:41:39,562 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:41:39,562 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:41:39,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:41:39,608 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;@63844e95, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:41:39,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:41:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:39,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-16 06:41:39,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:39,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:41:39,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:39,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:39,626 INFO L85 PathProgramCache]: Analyzing trace with hash -512323686, now seen corresponding path program 1 times [2024-11-16 06:41:39,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:41:39,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994059306] [2024-11-16 06:41:39,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:39,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:41:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:39,783 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-16 06:41:39,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:41:39,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994059306] [2024-11-16 06:41:39,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994059306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:41:39,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:41:39,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 06:41:39,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980815531] [2024-11-16 06:41:39,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:41:39,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 06:41:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:41:39,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 06:41:39,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:41:39,811 INFO L87 Difference]: Start difference. First operand has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-16 06:41:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:39,829 INFO L93 Difference]: Finished difference Result 57 states and 85 transitions. [2024-11-16 06:41:39,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 06:41:39,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-11-16 06:41:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:39,836 INFO L225 Difference]: With dead ends: 57 [2024-11-16 06:41:39,836 INFO L226 Difference]: Without dead ends: 26 [2024-11-16 06:41:39,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:41:39,841 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:39,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:41:39,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-16 06:41:39,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-16 06:41:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.28) internal successors, (32), 25 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-16 06:41:39,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2024-11-16 06:41:39,865 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 18 [2024-11-16 06:41:39,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:39,865 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2024-11-16 06:41:39,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 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-16 06:41:39,866 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2024-11-16 06:41:39,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-16 06:41:39,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:39,866 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-16 06:41:39,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:41:39,867 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:39,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:39,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1534030149, now seen corresponding path program 1 times [2024-11-16 06:41:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:41:39,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355052814] [2024-11-16 06:41:39,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:39,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:41:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:39,949 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-16 06:41:39,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:41:39,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355052814] [2024-11-16 06:41:39,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355052814] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:41:39,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:41:39,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:41:39,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945709346] [2024-11-16 06:41:39,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:41:39,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:41:39,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:41:39,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:41:39,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:41:39,952 INFO L87 Difference]: Start difference. First operand 26 states and 32 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-16 06:41:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:39,979 INFO L93 Difference]: Finished difference Result 56 states and 72 transitions. [2024-11-16 06:41:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:41:39,980 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-16 06:41:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:39,981 INFO L225 Difference]: With dead ends: 56 [2024-11-16 06:41:39,981 INFO L226 Difference]: Without dead ends: 34 [2024-11-16 06:41:39,982 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-16 06:41:39,983 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 4 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:39,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:41:39,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-16 06:41:39,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2024-11-16 06:41:39,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:39,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2024-11-16 06:41:39,987 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 23 [2024-11-16 06:41:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:39,988 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2024-11-16 06:41:39,988 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-16 06:41:39,988 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2024-11-16 06:41:39,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-16 06:41:39,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:39,989 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-16 06:41:39,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:41:39,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:39,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:39,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1353013699, now seen corresponding path program 1 times [2024-11-16 06:41:39,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:41:39,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877184103] [2024-11-16 06:41:39,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:39,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:41:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:40,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:41:40,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:41:40,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877184103] [2024-11-16 06:41:40,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877184103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:41:40,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615074456] [2024-11-16 06:41:40,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:40,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:41:40,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:41:40,148 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-16 06:41:40,151 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-16 06:41:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:40,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 06:41:40,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:41:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:41:40,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:41:40,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:41:40,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615074456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:41:40,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:41:40,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-16 06:41:40,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884169568] [2024-11-16 06:41:40,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:41:40,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 06:41:40,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:41:40,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 06:41:40,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:41:40,267 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-16 06:41:40,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:40,321 INFO L93 Difference]: Finished difference Result 85 states and 114 transitions. [2024-11-16 06:41:40,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 06:41:40,322 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-16 06:41:40,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:40,322 INFO L225 Difference]: With dead ends: 85 [2024-11-16 06:41:40,323 INFO L226 Difference]: Without dead ends: 58 [2024-11-16 06:41:40,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 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-16 06:41:40,324 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:40,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 50 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:41:40,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-16 06:41:40,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2024-11-16 06:41:40,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-16 06:41:40,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2024-11-16 06:41:40,329 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 27 [2024-11-16 06:41:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:40,329 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2024-11-16 06:41:40,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-16 06:41:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2024-11-16 06:41:40,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 06:41:40,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:40,330 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:41:40,342 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-16 06:41:40,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:41:40,535 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:40,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:40,535 INFO L85 PathProgramCache]: Analyzing trace with hash -567343421, now seen corresponding path program 2 times [2024-11-16 06:41:40,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:41:40,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374611377] [2024-11-16 06:41:40,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:40,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:41:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:40,810 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 06:41:40,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:41:40,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374611377] [2024-11-16 06:41:40,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374611377] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:41:40,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455518500] [2024-11-16 06:41:40,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:41:40,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:41:40,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:41:40,819 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-16 06:41:40,822 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-16 06:41:40,882 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 06:41:40,882 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:41:40,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 06:41:40,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:41:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-16 06:41:40,965 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:41:40,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455518500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:41:40,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 06:41:40,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-16 06:41:40,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944343155] [2024-11-16 06:41:40,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:41:40,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 06:41:40,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:41:40,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 06:41:40,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-16 06:41:40,966 INFO L87 Difference]: Start difference. First operand 45 states and 52 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-16 06:41:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:40,998 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2024-11-16 06:41:40,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 06:41:40,999 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 39 [2024-11-16 06:41:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:40,999 INFO L225 Difference]: With dead ends: 63 [2024-11-16 06:41:41,000 INFO L226 Difference]: Without dead ends: 47 [2024-11-16 06:41:41,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-16 06:41:41,001 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:41,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:41:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-16 06:41:41,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-16 06:41:41,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.173913043478261) internal successors, (54), 46 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-16 06:41:41,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2024-11-16 06:41:41,005 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 39 [2024-11-16 06:41:41,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:41,005 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2024-11-16 06:41:41,005 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-16 06:41:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2024-11-16 06:41:41,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 06:41:41,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:41,006 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:41:41,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 06:41:41,210 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,SelfDestructingSolverStorable3 [2024-11-16 06:41:41,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:41,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:41,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1704970914, now seen corresponding path program 1 times [2024-11-16 06:41:41,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:41:41,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947223122] [2024-11-16 06:41:41,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:41,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:41:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 06:41:41,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:41:41,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947223122] [2024-11-16 06:41:41,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947223122] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:41:41,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741720350] [2024-11-16 06:41:41,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:41,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:41:41,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:41:41,304 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-16 06:41:41,305 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-16 06:41:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:41,374 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 06:41:41,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:41:41,396 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 06:41:41,397 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:41:41,436 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 06:41:41,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741720350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:41:41,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:41:41,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2024-11-16 06:41:41,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825265422] [2024-11-16 06:41:41,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:41:41,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 06:41:41,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:41:41,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 06:41:41,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-16 06:41:41,438 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-16 06:41:41,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:41,498 INFO L93 Difference]: Finished difference Result 103 states and 131 transitions. [2024-11-16 06:41:41,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 06:41:41,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-16 06:41:41,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:41,499 INFO L225 Difference]: With dead ends: 103 [2024-11-16 06:41:41,499 INFO L226 Difference]: Without dead ends: 68 [2024-11-16 06:41:41,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-16 06:41:41,500 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:41,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 72 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:41:41,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-16 06:41:41,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2024-11-16 06:41:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-16 06:41:41,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2024-11-16 06:41:41,505 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 41 [2024-11-16 06:41:41,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:41,505 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2024-11-16 06:41:41,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-16 06:41:41,505 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2024-11-16 06:41:41,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-16 06:41:41,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:41,506 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:41:41,518 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-16 06:41:41,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:41:41,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:41,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:41,710 INFO L85 PathProgramCache]: Analyzing trace with hash 367576484, now seen corresponding path program 2 times [2024-11-16 06:41:41,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:41:41,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459809152] [2024-11-16 06:41:41,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:41,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:41:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-16 06:41:41,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:41:41,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459809152] [2024-11-16 06:41:41,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459809152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:41:41,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296849414] [2024-11-16 06:41:41,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:41:41,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:41:41,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:41:41,981 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-16 06:41:41,985 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-16 06:41:42,048 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 06:41:42,048 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:41:42,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 06:41:42,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:41:42,094 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-16 06:41:42,094 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:41:42,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296849414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:41:42,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 06:41:42,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-16 06:41:42,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468613268] [2024-11-16 06:41:42,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:41:42,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:41:42,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:41:42,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:41:42,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 06:41:42,097 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:42,108 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2024-11-16 06:41:42,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:41:42,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2024-11-16 06:41:42,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:42,109 INFO L225 Difference]: With dead ends: 56 [2024-11-16 06:41:42,109 INFO L226 Difference]: Without dead ends: 50 [2024-11-16 06:41:42,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-16 06:41:42,110 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:42,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:41:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-16 06:41:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-16 06:41:42,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-16 06:41:42,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-16 06:41:42,116 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 45 [2024-11-16 06:41:42,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:42,117 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-16 06:41:42,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-16 06:41:42,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 06:41:42,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:42,120 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2024-11-16 06:41:42,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-16 06:41:42,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:41:42,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:42,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:42,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1816792967, now seen corresponding path program 1 times [2024-11-16 06:41:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:41:42,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363834562] [2024-11-16 06:41:42,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:42,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:41:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:42,406 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-16 06:41:42,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:41:42,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363834562] [2024-11-16 06:41:42,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363834562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:41:42,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:41:42,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:41:42,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290382056] [2024-11-16 06:41:42,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:41:42,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:41:42,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:41:42,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:41:42,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:41:42,408 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:42,420 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2024-11-16 06:41:42,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:41:42,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-16 06:41:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:42,422 INFO L225 Difference]: With dead ends: 70 [2024-11-16 06:41:42,423 INFO L226 Difference]: Without dead ends: 52 [2024-11-16 06:41:42,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:41:42,424 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:42,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:41:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-16 06:41:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-11-16 06:41:42,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-16 06:41:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2024-11-16 06:41:42,430 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 49 [2024-11-16 06:41:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:42,432 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2024-11-16 06:41:42,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2024-11-16 06:41:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-16 06:41:42,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:42,433 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 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] [2024-11-16 06:41:42,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 06:41:42,433 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:42,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:42,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1970294938, now seen corresponding path program 1 times [2024-11-16 06:41:42,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:41:42,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350949671] [2024-11-16 06:41:42,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:42,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:41:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:41:42,475 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 06:41:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:41:42,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 06:41:42,512 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 06:41:42,513 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 06:41:42,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 06:41:42,517 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2024-11-16 06:41:42,556 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 06:41:42,559 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:41:42 BoogieIcfgContainer [2024-11-16 06:41:42,560 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 06:41:42,560 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 06:41:42,560 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 06:41:42,560 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 06:41:42,561 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:41:39" (3/4) ... [2024-11-16 06:41:42,563 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 06:41:42,563 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 06:41:42,564 INFO L158 Benchmark]: Toolchain (without parser) took 3662.03ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 94.9MB in the beginning and 80.5MB in the end (delta: 14.4MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2024-11-16 06:41:42,564 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 167.8MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:41:42,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.47ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 81.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 06:41:42,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.19ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 79.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 06:41:42,565 INFO L158 Benchmark]: Boogie Preprocessor took 57.87ms. Allocated memory is still 167.8MB. Free memory was 79.9MB in the beginning and 136.5MB in the end (delta: -56.6MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-16 06:41:42,565 INFO L158 Benchmark]: IcfgBuilder took 310.95ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 126.4MB in the end (delta: 10.0MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-16 06:41:42,565 INFO L158 Benchmark]: TraceAbstraction took 3017.72ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 125.3MB in the beginning and 80.5MB in the end (delta: 44.8MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. [2024-11-16 06:41:42,565 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 226.5MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:41:42,567 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.12ms. Allocated memory is still 167.8MB. Free memory is still 120.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.47ms. Allocated memory is still 167.8MB. Free memory was 94.7MB in the beginning and 81.6MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.19ms. Allocated memory is still 167.8MB. Free memory was 81.6MB in the beginning and 79.9MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.87ms. Allocated memory is still 167.8MB. Free memory was 79.9MB in the beginning and 136.5MB in the end (delta: -56.6MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * IcfgBuilder took 310.95ms. Allocated memory is still 167.8MB. Free memory was 136.4MB in the beginning and 126.4MB in the end (delta: 10.0MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3017.72ms. Allocated memory was 167.8MB in the beginning and 226.5MB in the end (delta: 58.7MB). Free memory was 125.3MB in the beginning and 80.5MB in the end (delta: 44.8MB). Peak memory consumption was 102.4MB. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 226.5MB. Free memory is still 80.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: 20]: 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 shiftLeft at line 69. Possible FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 VAL [i=0, string_A={7:0}, string_B={6:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [i=1, string_A={7:0}, string_B={6:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [i=2, string_A={7:0}, string_B={6:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [i=3, string_A={7:0}, string_B={6:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [i=4, string_A={7:0}, string_B={6:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [i=5, string_A={7:0}, string_B={6:0}] [L35] COND FALSE !(i<5) VAL [string_A={7:0}, string_B={6:0}] [L37] EXPR string_A[5 -1] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 VAL [i=0, string_A={7:0}, string_B={6:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [i=1, string_A={7:0}, string_B={6:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [i=2, string_A={7:0}, string_B={6:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [i=3, string_A={7:0}, string_B={6:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [i=4, string_A={7:0}, string_B={6:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [i=5, string_A={7:0}, string_B={6:0}] [L39] COND FALSE !(i<5) VAL [string_A={7:0}, string_B={6:0}] [L41] EXPR string_B[5 -1] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 VAL [nc_A=0, string_A={7:0}, string_B={6:0}] [L44] EXPR string_A[nc_A] [L44] COND TRUE string_A[nc_A]!='\0' [L45] nc_A++ VAL [nc_A=1, string_A={7:0}, string_B={6:0}] [L44] EXPR string_A[nc_A] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 VAL [nc_A=1, nc_B=0, string_A={7:0}, string_B={6:0}] [L48] EXPR string_B[nc_B] [L48] COND TRUE string_B[nc_B]!='\0' [L49] nc_B++ VAL [nc_A=1, nc_B=1, string_A={7:0}, string_B={6:0}] [L48] EXPR string_B[nc_B] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) [L54] EXPR j=0 [L54] i=j=0 VAL [i=0, j=0, nc_A=1, nc_B=1, string_A={7:0}, string_B={6:0}] [L55] COND TRUE (inc_B-1)<nc_B-1)< 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 -> fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 [2024-11-16 06:41:44,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:41:45,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:41:45,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:41:45,014 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:41:45,014 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:41:45,015 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2024-11-16 06:41:46,680 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:41:46,870 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:41:46,872 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2024-11-16 06:41:46,881 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19027e8c/f6128709506f4c6486575e7a504a2b7c/FLAGb85828f42 [2024-11-16 06:41:46,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c19027e8c/f6128709506f4c6486575e7a504a2b7c [2024-11-16 06:41:46,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:41:46,896 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:41:46,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:41:46,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:41:46,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:41:46,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:41:46" (1/1) ... [2024-11-16 06:41:46,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b312a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:46, skipping insertion in model container [2024-11-16 06:41:46,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:41:46" (1/1) ... [2024-11-16 06:41:46,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:41:47,054 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/string-2.i[896,909] [2024-11-16 06:41:47,076 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:41:47,084 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:41:47,093 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/string-2.i[896,909] [2024-11-16 06:41:47,099 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:41:47,111 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:41:47,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47 WrapperNode [2024-11-16 06:41:47,112 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:41:47,113 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:41:47,113 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:41:47,113 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:41:47,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (1/1) ... [2024-11-16 06:41:47,125 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (1/1) ... [2024-11-16 06:41:47,142 INFO L138 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 116 [2024-11-16 06:41:47,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:41:47,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:41:47,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:41:47,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:41:47,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (1/1) ... [2024-11-16 06:41:47,165 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (1/1) ... [2024-11-16 06:41:47,171 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (1/1) ... [2024-11-16 06:41:47,180 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 4, 4]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-16 06:41:47,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (1/1) ... [2024-11-16 06:41:47,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (1/1) ... [2024-11-16 06:41:47,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (1/1) ... [2024-11-16 06:41:47,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (1/1) ... [2024-11-16 06:41:47,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (1/1) ... [2024-11-16 06:41:47,187 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (1/1) ... [2024-11-16 06:41:47,189 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:41:47,190 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:41:47,190 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:41:47,190 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:41:47,191 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (1/1) ... [2024-11-16 06:41:47,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:41:47,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:41:47,243 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-16 06:41:47,249 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-16 06:41:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:41:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 06:41:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 06:41:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-16 06:41:47,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 06:41:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 06:41:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 06:41:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-16 06:41:47,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:41:47,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:41:47,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 06:41:47,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 06:41:47,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-16 06:41:47,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 06:41:47,363 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:41:47,365 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:41:47,544 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L31: call ULTIMATE.dealloc(main_~#string_A~0#1.base, main_~#string_A~0#1.offset);havoc main_~#string_A~0#1.base, main_~#string_A~0#1.offset;call ULTIMATE.dealloc(main_~#string_B~0#1.base, main_~#string_B~0#1.offset);havoc main_~#string_B~0#1.base, main_~#string_B~0#1.offset; [2024-11-16 06:41:47,557 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-16 06:41:47,559 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:41:47,568 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:41:47,569 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:41:47,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:41:47 BoogieIcfgContainer [2024-11-16 06:41:47,570 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:41:47,573 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:41:47,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:41:47,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:41:47,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:41:46" (1/3) ... [2024-11-16 06:41:47,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65209e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:41:47, skipping insertion in model container [2024-11-16 06:41:47,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:41:47" (2/3) ... [2024-11-16 06:41:47,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65209e16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:41:47, skipping insertion in model container [2024-11-16 06:41:47,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:41:47" (3/3) ... [2024-11-16 06:41:47,578 INFO L112 eAbstractionObserver]: Analyzing ICFG string-2.i [2024-11-16 06:41:47,590 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:41:47,590 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:41:47,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:41:47,642 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;@1b77fd59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:41:47,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:41:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 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-16 06:41:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-16 06:41:47,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:47,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:41:47,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:47,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:47,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1843731208, now seen corresponding path program 1 times [2024-11-16 06:41:47,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 06:41:47,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605467877] [2024-11-16 06:41:47,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:47,664 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-16 06:41:47,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 06:41:47,667 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-16 06:41:47,668 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-16 06:41:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:47,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 06:41:47,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:41:47,753 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-16 06:41:47,754 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:41:47,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 06:41:47,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605467877] [2024-11-16 06:41:47,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1605467877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:41:47,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:41:47,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 06:41:47,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445690636] [2024-11-16 06:41:47,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:41:47,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 06:41:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 06:41:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 06:41:47,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:41:47,777 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.5925925925925926) internal successors, (43), 28 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) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 06:41:47,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:47,789 INFO L93 Difference]: Finished difference Result 53 states and 79 transitions. [2024-11-16 06:41:47,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 06:41:47,791 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2024-11-16 06:41:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:47,795 INFO L225 Difference]: With dead ends: 53 [2024-11-16 06:41:47,795 INFO L226 Difference]: Without dead ends: 24 [2024-11-16 06:41:47,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-16 06:41:47,800 INFO L432 NwaCegarLoop]: 36 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, 36 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-16 06:41:47,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:41:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-16 06:41:47,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-16 06:41:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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-16 06:41:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-11-16 06:41:47,839 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 17 [2024-11-16 06:41:47,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:47,839 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-16 06:41:47,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 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-16 06:41:47,840 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-11-16 06:41:47,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 06:41:47,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:47,841 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] [2024-11-16 06:41:47,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 06:41:48,044 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-16 06:41:48,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:48,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:48,046 INFO L85 PathProgramCache]: Analyzing trace with hash 939199051, now seen corresponding path program 1 times [2024-11-16 06:41:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 06:41:48,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [492640562] [2024-11-16 06:41:48,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:48,050 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-16 06:41:48,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 06:41:48,053 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-16 06:41:48,054 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-16 06:41:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:48,091 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 06:41:48,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:41:48,110 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-16 06:41:48,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:41:48,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 06:41:48,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [492640562] [2024-11-16 06:41:48,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [492640562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:41:48,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:41:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:41:48,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287190226] [2024-11-16 06:41:48,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:41:48,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:41:48,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 06:41:48,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:41:48,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:41:48,113 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:48,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:48,139 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-11-16 06:41:48,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:41:48,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-16 06:41:48,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:48,141 INFO L225 Difference]: With dead ends: 52 [2024-11-16 06:41:48,141 INFO L226 Difference]: Without dead ends: 32 [2024-11-16 06:41:48,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-16 06:41:48,142 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:48,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:41:48,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-16 06:41:48,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2024-11-16 06:41:48,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 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-16 06:41:48,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-16 06:41:48,147 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2024-11-16 06:41:48,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:48,147 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-16 06:41:48,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:48,147 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-16 06:41:48,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 06:41:48,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:48,148 INFO L215 NwaCegarLoop]: trace histogram [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-16 06:41:48,152 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 (3)] Ended with exit code 0 [2024-11-16 06:41:48,350 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-16 06:41:48,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:48,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:48,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1924913545, now seen corresponding path program 1 times [2024-11-16 06:41:48,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 06:41:48,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2102843208] [2024-11-16 06:41:48,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:48,352 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-16 06:41:48,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 06:41:48,355 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-16 06:41:48,356 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-16 06:41:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:48,409 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 06:41:48,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:41:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:41:48,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:41:48,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:41:48,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 06:41:48,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2102843208] [2024-11-16 06:41:48,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2102843208] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:41:48,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:41:48,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-16 06:41:48,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715257299] [2024-11-16 06:41:48,453 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:41:48,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 06:41:48,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 06:41:48,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 06:41:48,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 06:41:48,454 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:48,537 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2024-11-16 06:41:48,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 06:41:48,538 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-16 06:41:48,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:48,539 INFO L225 Difference]: With dead ends: 78 [2024-11-16 06:41:48,539 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 06:41:48,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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-16 06:41:48,540 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 36 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:48,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 66 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:41:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 06:41:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 40. [2024-11-16 06:41:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-16 06:41:48,545 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 26 [2024-11-16 06:41:48,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:48,545 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-16 06:41:48,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-16 06:41:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-16 06:41:48,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:48,546 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:41:48,549 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-16 06:41:48,746 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-16 06:41:48,747 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:48,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:48,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1647308099, now seen corresponding path program 2 times [2024-11-16 06:41:48,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 06:41:48,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [548040471] [2024-11-16 06:41:48,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:41:48,749 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-16 06:41:48,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 06:41:48,751 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-16 06:41:48,752 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-16 06:41:48,793 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 06:41:48,793 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:41:48,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 06:41:48,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:41:48,874 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-16 06:41:48,874 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:41:48,874 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 06:41:48,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [548040471] [2024-11-16 06:41:48,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [548040471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:41:48,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:41:48,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 06:41:48,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439778963] [2024-11-16 06:41:48,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:41:48,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 06:41:48,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 06:41:48,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 06:41:48,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 06:41:48,876 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:48,901 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2024-11-16 06:41:48,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 06:41:48,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-16 06:41:48,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:48,902 INFO L225 Difference]: With dead ends: 55 [2024-11-16 06:41:48,902 INFO L226 Difference]: Without dead ends: 42 [2024-11-16 06:41:48,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-16 06:41:48,903 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:48,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:41:48,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-16 06:41:48,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-16 06:41:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-16 06:41:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2024-11-16 06:41:48,907 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 38 [2024-11-16 06:41:48,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:48,908 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2024-11-16 06:41:48,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:48,908 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2024-11-16 06:41:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 06:41:48,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:48,909 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:41:48,913 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 (5)] Forceful destruction successful, exit code 0 [2024-11-16 06:41:49,109 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-16 06:41:49,109 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:49,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:49,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1958997756, now seen corresponding path program 1 times [2024-11-16 06:41:49,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 06:41:49,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983447837] [2024-11-16 06:41:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:49,111 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 06:41:49,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 06:41:49,112 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-16 06:41:49,117 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-16 06:41:49,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:49,183 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 06:41:49,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:41:49,217 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 06:41:49,217 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:41:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-16 06:41:49,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 06:41:49,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983447837] [2024-11-16 06:41:49,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983447837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:41:49,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 06:41:49,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-16 06:41:49,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812080753] [2024-11-16 06:41:49,275 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 06:41:49,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 06:41:49,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 06:41:49,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 06:41:49,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-16 06:41:49,277 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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-16 06:41:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:49,498 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2024-11-16 06:41:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 06:41:49,498 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-16 06:41:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:49,499 INFO L225 Difference]: With dead ends: 96 [2024-11-16 06:41:49,499 INFO L226 Difference]: Without dead ends: 66 [2024-11-16 06:41:49,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-16 06:41:49,500 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:49,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 236 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 06:41:49,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-16 06:41:49,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2024-11-16 06:41:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 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-16 06:41:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2024-11-16 06:41:49,504 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 40 [2024-11-16 06:41:49,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:49,505 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2024-11-16 06:41:49,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 12 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-16 06:41:49,505 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2024-11-16 06:41:49,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-16 06:41:49,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:49,505 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:41:49,511 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-16 06:41:49,706 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-16 06:41:49,706 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:49,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:49,706 INFO L85 PathProgramCache]: Analyzing trace with hash 192531650, now seen corresponding path program 2 times [2024-11-16 06:41:49,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 06:41:49,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497705821] [2024-11-16 06:41:49,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:41:49,707 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-16 06:41:49,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 06:41:49,709 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-16 06:41:49,711 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-16 06:41:49,775 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 06:41:49,776 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:41:49,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 06:41:49,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:41:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-16 06:41:49,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:41:49,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 06:41:49,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497705821] [2024-11-16 06:41:49,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [497705821] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:41:49,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:41:49,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:41:49,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415324443] [2024-11-16 06:41:49,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:41:49,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:41:49,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 06:41:49,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:41:49,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:41:49,845 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:49,872 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-11-16 06:41:49,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:41:49,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-16 06:41:49,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:49,873 INFO L225 Difference]: With dead ends: 54 [2024-11-16 06:41:49,873 INFO L226 Difference]: Without dead ends: 49 [2024-11-16 06:41:49,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 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-16 06:41:49,875 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:49,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:41:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-16 06:41:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2024-11-16 06:41:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-16 06:41:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2024-11-16 06:41:49,880 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 44 [2024-11-16 06:41:49,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:49,880 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2024-11-16 06:41:49,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:49,880 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2024-11-16 06:41:49,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-16 06:41:49,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:49,881 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:41:49,885 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-16 06:41:50,083 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-16 06:41:50,084 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:50,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:50,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2023510177, now seen corresponding path program 1 times [2024-11-16 06:41:50,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 06:41:50,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391805952] [2024-11-16 06:41:50,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:50,085 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-16 06:41:50,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 06:41:50,087 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-16 06:41:50,095 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-16 06:41:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:41:50,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 06:41:50,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:41:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-16 06:41:50,198 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 06:41:50,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 06:41:50,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391805952] [2024-11-16 06:41:50,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391805952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:41:50,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:41:50,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 06:41:50,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924911322] [2024-11-16 06:41:50,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:41:50,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 06:41:50,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 06:41:50,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 06:41:50,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:41:50,199 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:41:50,215 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2024-11-16 06:41:50,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 06:41:50,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-16 06:41:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:41:50,216 INFO L225 Difference]: With dead ends: 66 [2024-11-16 06:41:50,216 INFO L226 Difference]: Without dead ends: 50 [2024-11-16 06:41:50,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-16 06:41:50,217 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:41:50,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:41:50,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-16 06:41:50,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-16 06:41:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 49 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-16 06:41:50,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2024-11-16 06:41:50,221 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 47 [2024-11-16 06:41:50,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:41:50,221 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2024-11-16 06:41:50,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 06:41:50,222 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2024-11-16 06:41:50,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-16 06:41:50,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:41:50,222 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:41:50,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-16 06:41:50,423 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-16 06:41:50,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:41:50,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:41:50,426 INFO L85 PathProgramCache]: Analyzing trace with hash -981945280, now seen corresponding path program 1 times [2024-11-16 06:41:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 06:41:50,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388003732] [2024-11-16 06:41:50,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:41:50,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-16 06:41:50,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 06:41:50,429 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-16 06:41:50,430 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-16 06:41:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:41:50,519 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 06:41:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 06:41:50,655 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-16 06:41:50,659 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 06:41:50,660 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 06:41:50,676 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-16 06:41:50,866 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-16 06:41:50,869 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2024-11-16 06:41:50,913 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 06:41:50,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:41:50 BoogieIcfgContainer [2024-11-16 06:41:50,917 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 06:41:50,917 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 06:41:50,917 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 06:41:50,921 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 06:41:50,921 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:41:47" (3/4) ... [2024-11-16 06:41:50,922 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 06:41:51,010 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 06:41:51,011 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 06:41:51,011 INFO L158 Benchmark]: Toolchain (without parser) took 4114.81ms. Allocated memory was 65.0MB in the beginning and 109.1MB in the end (delta: 44.0MB). Free memory was 43.5MB in the beginning and 52.6MB in the end (delta: -9.1MB). Peak memory consumption was 37.2MB. Max. memory is 16.1GB. [2024-11-16 06:41:51,011 INFO L158 Benchmark]: CDTParser took 1.25ms. Allocated memory is still 65.0MB. Free memory was 41.7MB in the beginning and 41.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:41:51,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.57ms. Allocated memory is still 65.0MB. Free memory was 43.2MB in the beginning and 29.7MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 06:41:51,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.96ms. Allocated memory is still 65.0MB. Free memory was 29.7MB in the beginning and 27.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 06:41:51,012 INFO L158 Benchmark]: Boogie Preprocessor took 44.01ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 27.9MB in the beginning and 69.0MB in the end (delta: -41.1MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-11-16 06:41:51,012 INFO L158 Benchmark]: IcfgBuilder took 380.81ms. Allocated memory is still 90.2MB. Free memory was 69.0MB in the beginning and 53.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 06:41:51,013 INFO L158 Benchmark]: TraceAbstraction took 3344.24ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 52.7MB in the beginning and 55.9MB in the end (delta: -3.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-16 06:41:51,013 INFO L158 Benchmark]: Witness Printer took 93.55ms. Allocated memory is still 109.1MB. Free memory was 55.9MB in the beginning and 52.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 06:41:51,014 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.25ms. Allocated memory is still 65.0MB. Free memory was 41.7MB in the beginning and 41.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.57ms. Allocated memory is still 65.0MB. Free memory was 43.2MB in the beginning and 29.7MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.96ms. Allocated memory is still 65.0MB. Free memory was 29.7MB in the beginning and 27.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.01ms. Allocated memory was 65.0MB in the beginning and 90.2MB in the end (delta: 25.2MB). Free memory was 27.9MB in the beginning and 69.0MB in the end (delta: -41.1MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * IcfgBuilder took 380.81ms. Allocated memory is still 90.2MB. Free memory was 69.0MB in the beginning and 53.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3344.24ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 52.7MB in the beginning and 55.9MB in the end (delta: -3.2MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Witness Printer took 93.55ms. Allocated memory is still 109.1MB. Free memory was 55.9MB in the beginning and 52.6MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. 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 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 VAL [i=0, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [i=1, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [i=2, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [i=3, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [i=4, string_A={7:0}, string_B={3:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [i=5, string_A={7:0}, string_B={3:0}] [L35] COND FALSE !(i<5) VAL [string_A={7:0}, string_B={3:0}] [L37] EXPR string_A[5 -1] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 VAL [i=0, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [i=1, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [i=2, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [i=3, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [i=4, string_A={7:0}, string_B={3:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [i=5, string_A={7:0}, string_B={3:0}] [L39] COND FALSE !(i<5) VAL [string_A={7:0}, string_B={3:0}] [L41] EXPR string_B[5 -1] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 VAL [nc_A=0, string_A={7:0}, string_B={3:0}] [L44] EXPR string_A[nc_A] [L44] COND TRUE string_A[nc_A]!='\0' [L45] nc_A++ VAL [nc_A=1, string_A={7:0}, string_B={3:0}] [L44] EXPR string_A[nc_A] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 VAL [nc_A=1, nc_B=0, string_A={7:0}, string_B={3:0}] [L48] EXPR string_B[nc_B] [L48] COND TRUE string_B[nc_B]!='\0' [L49] nc_B++ VAL [nc_A=1, nc_B=1, string_A={7:0}, string_B={3:0}] [L48] EXPR string_B[nc_B] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) [L54] EXPR j=0 [L54] i=j=0 VAL [i=0, j=0, nc_A=1, nc_B=1, string_A={7:0}, string_B={3:0}] [L55] COND TRUE (inc_B-1)<