/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/eureka_05.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 02:41:18,324 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 02:41:18,326 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 02:41:18,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 02:41:18,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 02:41:18,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 02:41:18,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 02:41:18,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 02:41:18,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 02:41:18,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 02:41:18,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 02:41:18,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 02:41:18,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 02:41:18,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 02:41:18,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 02:41:18,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 02:41:18,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 02:41:18,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 02:41:18,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 02:41:18,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 02:41:18,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 02:41:18,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 02:41:18,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 02:41:18,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 02:41:18,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 02:41:18,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 02:41:18,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 02:41:18,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 02:41:18,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 02:41:18,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 02:41:18,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 02:41:18,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 02:41:18,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 02:41:18,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 02:41:18,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 02:41:18,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 02:41:18,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 02:41:18,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 02:41:18,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 02:41:18,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 02:41:18,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 02:41:18,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 02:41:18,432 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 02:41:18,432 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 02:41:18,432 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 02:41:18,432 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 02:41:18,433 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 02:41:18,433 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 02:41:18,433 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 02:41:18,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 02:41:18,434 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 02:41:18,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 02:41:18,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 02:41:18,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 02:41:18,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 02:41:18,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 02:41:18,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 02:41:18,435 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 02:41:18,435 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 02:41:18,435 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 02:41:18,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 02:41:18,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 02:41:18,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 02:41:18,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 02:41:18,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 02:41:18,436 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:41:18,436 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 02:41:18,436 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 02:41:18,436 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 02:41:18,436 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 02:41:18,436 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 02:41:18,436 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 02:41:18,436 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 02:41:18,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 02:41:18,437 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 02:41:18,437 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 02:41:18,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 02:41:18,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 02:41:18,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 02:41:18,678 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 02:41:18,678 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 02:41:18,679 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05.i [2022-01-10 02:41:18,732 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc33a06fe/a42d2b60d1104c2f9a5417a8929a8950/FLAG4f0037645 [2022-01-10 02:41:19,153 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 02:41:19,153 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i [2022-01-10 02:41:19,162 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc33a06fe/a42d2b60d1104c2f9a5417a8929a8950/FLAG4f0037645 [2022-01-10 02:41:19,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc33a06fe/a42d2b60d1104c2f9a5417a8929a8950 [2022-01-10 02:41:19,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 02:41:19,183 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 02:41:19,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 02:41:19,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 02:41:19,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 02:41:19,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:41:19" (1/1) ... [2022-01-10 02:41:19,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76327fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19, skipping insertion in model container [2022-01-10 02:41:19,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:41:19" (1/1) ... [2022-01-10 02:41:19,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 02:41:19,207 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 02:41:19,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i[810,823] [2022-01-10 02:41:19,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:41:19,437 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 02:41:19,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05.i[810,823] [2022-01-10 02:41:19,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 02:41:19,488 INFO L208 MainTranslator]: Completed translation [2022-01-10 02:41:19,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19 WrapperNode [2022-01-10 02:41:19,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 02:41:19,490 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 02:41:19,490 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 02:41:19,490 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 02:41:19,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19" (1/1) ... [2022-01-10 02:41:19,509 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19" (1/1) ... [2022-01-10 02:41:19,532 INFO L137 Inliner]: procedures = 19, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 84 [2022-01-10 02:41:19,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 02:41:19,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 02:41:19,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 02:41:19,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 02:41:19,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19" (1/1) ... [2022-01-10 02:41:19,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19" (1/1) ... [2022-01-10 02:41:19,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19" (1/1) ... [2022-01-10 02:41:19,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19" (1/1) ... [2022-01-10 02:41:19,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19" (1/1) ... [2022-01-10 02:41:19,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19" (1/1) ... [2022-01-10 02:41:19,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19" (1/1) ... [2022-01-10 02:41:19,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 02:41:19,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 02:41:19,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 02:41:19,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 02:41:19,577 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19" (1/1) ... [2022-01-10 02:41:19,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 02:41:19,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 02:41:19,604 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 02:41:19,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 02:41:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 02:41:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 02:41:19,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-01-10 02:41:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 02:41:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 02:41:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 02:41:19,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 02:41:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 02:41:19,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 02:41:19,721 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 02:41:19,722 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 02:41:19,912 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 02:41:19,917 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 02:41:19,917 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 02:41:19,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:41:19 BoogieIcfgContainer [2022-01-10 02:41:19,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 02:41:19,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 02:41:19,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 02:41:19,922 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 02:41:19,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:41:19" (1/3) ... [2022-01-10 02:41:19,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d60eee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:41:19, skipping insertion in model container [2022-01-10 02:41:19,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:41:19" (2/3) ... [2022-01-10 02:41:19,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d60eee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:41:19, skipping insertion in model container [2022-01-10 02:41:19,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:41:19" (3/3) ... [2022-01-10 02:41:19,925 INFO L111 eAbstractionObserver]: Analyzing ICFG eureka_05.i [2022-01-10 02:41:19,928 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 02:41:19,928 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 02:41:19,986 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 02:41:19,993 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 02:41:19,993 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 02:41:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 02:41:20,010 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:20,010 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:20,011 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:20,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:20,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2015864939, now seen corresponding path program 1 times [2022-01-10 02:41:20,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:20,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [541165718] [2022-01-10 02:41:20,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:41:20,027 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:20,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:20,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:20,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 02:41:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:41:20,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2022-01-10 02:41:20,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:20,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:41:20,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:41:20,182 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:20,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [541165718] [2022-01-10 02:41:20,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [541165718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:41:20,183 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:41:20,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:41:20,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868118542] [2022-01-10 02:41:20,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:41:20,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 02:41:20,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:20,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 02:41:20,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:41:20,210 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:20,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:20,238 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-01-10 02:41:20,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 02:41:20,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-01-10 02:41:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:20,246 INFO L225 Difference]: With dead ends: 42 [2022-01-10 02:41:20,246 INFO L226 Difference]: Without dead ends: 20 [2022-01-10 02:41:20,248 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 02:41:20,251 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:20,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:41:20,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-10 02:41:20,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-01-10 02:41:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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) [2022-01-10 02:41:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-01-10 02:41:20,276 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 9 [2022-01-10 02:41:20,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:20,276 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-01-10 02:41:20,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-01-10 02:41:20,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 02:41:20,277 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:20,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:20,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:20,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:20,494 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:20,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:20,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1565230291, now seen corresponding path program 1 times [2022-01-10 02:41:20,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:20,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722797908] [2022-01-10 02:41:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:41:20,496 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:20,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:20,497 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:20,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 02:41:20,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:41:20,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:41:20,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:20,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:41:20,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 02:41:20,618 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:20,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722797908] [2022-01-10 02:41:20,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722797908] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:20,619 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:20,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 02:41:20,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042694854] [2022-01-10 02:41:20,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:20,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:41:20,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:20,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:41:20,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:41:20,621 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:20,689 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-01-10 02:41:20,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:41:20,690 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 02:41:20,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:20,691 INFO L225 Difference]: With dead ends: 51 [2022-01-10 02:41:20,691 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 02:41:20,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:41:20,693 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:20,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 75 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:41:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 02:41:20,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2022-01-10 02:41:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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) [2022-01-10 02:41:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-01-10 02:41:20,699 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2022-01-10 02:41:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:20,699 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-01-10 02:41:20,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-01-10 02:41:20,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 02:41:20,700 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:20,700 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:20,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:20,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:20,908 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:20,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash -7962739, now seen corresponding path program 2 times [2022-01-10 02:41:20,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:20,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1388380611] [2022-01-10 02:41:20,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:41:20,910 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:20,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:20,912 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:20,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 02:41:20,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 02:41:20,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:41:20,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 02:41:20,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-01-10 02:41:21,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:41:21,054 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:21,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1388380611] [2022-01-10 02:41:21,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1388380611] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:41:21,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:41:21,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 02:41:21,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290930104] [2022-01-10 02:41:21,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:41:21,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 02:41:21,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:21,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 02:41:21,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:41:21,060 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:21,113 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-01-10 02:41:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 02:41:21,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 02:41:21,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:21,114 INFO L225 Difference]: With dead ends: 38 [2022-01-10 02:41:21,114 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 02:41:21,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-10 02:41:21,116 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:21,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 30 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:41:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 02:41:21,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-01-10 02:41:21,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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) [2022-01-10 02:41:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-01-10 02:41:21,122 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 17 [2022-01-10 02:41:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:21,122 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-01-10 02:41:21,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-01-10 02:41:21,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 02:41:21,123 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:21,123 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:21,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:21,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:21,332 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:21,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:21,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1148715813, now seen corresponding path program 1 times [2022-01-10 02:41:21,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:21,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826761573] [2022-01-10 02:41:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:41:21,334 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:21,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:21,335 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:21,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 02:41:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:41:21,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-10 02:41:21,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:21,450 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 02:41:21,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 02:41:21,560 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:21,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826761573] [2022-01-10 02:41:21,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826761573] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:21,560 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:21,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 02:41:21,560 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726724196] [2022-01-10 02:41:21,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:21,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 02:41:21,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:21,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 02:41:21,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-10 02:41:21,562 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:21,730 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-01-10 02:41:21,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:41:21,731 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 02:41:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:21,732 INFO L225 Difference]: With dead ends: 69 [2022-01-10 02:41:21,732 INFO L226 Difference]: Without dead ends: 54 [2022-01-10 02:41:21,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-01-10 02:41:21,733 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 85 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:21,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 203 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:41:21,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-10 02:41:21,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 28. [2022-01-10 02:41:21,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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) [2022-01-10 02:41:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-10 02:41:21,739 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 21 [2022-01-10 02:41:21,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:21,740 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-10 02:41:21,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:21,740 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-10 02:41:21,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 02:41:21,741 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:21,741 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:21,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:21,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:21,954 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1363886947, now seen corresponding path program 2 times [2022-01-10 02:41:21,955 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:21,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1292586585] [2022-01-10 02:41:21,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:41:21,956 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:21,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:21,957 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:21,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 02:41:22,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 02:41:22,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:41:22,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:41:22,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:22,105 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 02:41:22,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:41:22,106 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:22,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1292586585] [2022-01-10 02:41:22,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1292586585] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:41:22,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:41:22,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 02:41:22,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298268605] [2022-01-10 02:41:22,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:41:22,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 02:41:22,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:22,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 02:41:22,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 02:41:22,108 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:22,166 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-01-10 02:41:22,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 02:41:22,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 02:41:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:22,167 INFO L225 Difference]: With dead ends: 49 [2022-01-10 02:41:22,168 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 02:41:22,168 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:41:22,169 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 30 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:22,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 02:41:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 02:41:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-01-10 02:41:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 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) [2022-01-10 02:41:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-01-10 02:41:22,174 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2022-01-10 02:41:22,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:22,174 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-01-10 02:41:22,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-01-10 02:41:22,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 02:41:22,174 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:22,175 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:22,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:22,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:22,376 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:22,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:22,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1046967233, now seen corresponding path program 1 times [2022-01-10 02:41:22,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:22,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [38032558] [2022-01-10 02:41:22,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:41:22,377 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:22,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:22,378 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:22,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 02:41:22,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:41:22,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 02:41:22,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 02:41:22,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-10 02:41:22,665 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:22,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [38032558] [2022-01-10 02:41:22,666 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [38032558] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:22,666 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:22,666 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2022-01-10 02:41:22,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872913013] [2022-01-10 02:41:22,666 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:22,667 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-10 02:41:22,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:22,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-10 02:41:22,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:41:22,668 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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) [2022-01-10 02:41:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:22,922 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-01-10 02:41:22,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 02:41:22,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 02:41:22,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:22,924 INFO L225 Difference]: With dead ends: 73 [2022-01-10 02:41:22,924 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 02:41:22,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2022-01-10 02:41:22,925 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 122 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:22,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 71 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:41:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 02:41:22,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-01-10 02:41:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-01-10 02:41:22,934 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 26 [2022-01-10 02:41:22,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:22,934 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-01-10 02:41:22,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 9 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) [2022-01-10 02:41:22,935 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-01-10 02:41:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 02:41:22,936 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:22,936 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:22,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:23,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:23,145 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:23,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash -870626845, now seen corresponding path program 2 times [2022-01-10 02:41:23,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:23,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277478116] [2022-01-10 02:41:23,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:41:23,146 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:23,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:23,147 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:23,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 02:41:23,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 02:41:23,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:41:23,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 02:41:23,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-01-10 02:41:23,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-01-10 02:41:23,528 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:23,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277478116] [2022-01-10 02:41:23,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277478116] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:23,529 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:23,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-01-10 02:41:23,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669255390] [2022-01-10 02:41:23,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:23,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 02:41:23,529 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:23,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 02:41:23,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 02:41:23,530 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:23,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:23,627 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-01-10 02:41:23,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 02:41:23,635 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-01-10 02:41:23,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:23,636 INFO L225 Difference]: With dead ends: 67 [2022-01-10 02:41:23,636 INFO L226 Difference]: Without dead ends: 60 [2022-01-10 02:41:23,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-01-10 02:41:23,637 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 106 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:23,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 50 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:41:23,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-10 02:41:23,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-01-10 02:41:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:23,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-01-10 02:41:23,645 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 35 [2022-01-10 02:41:23,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:23,645 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-01-10 02:41:23,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:23,646 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-01-10 02:41:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-10 02:41:23,647 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:23,647 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:23,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:23,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:23,856 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:23,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:23,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1680746731, now seen corresponding path program 3 times [2022-01-10 02:41:23,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:23,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853577909] [2022-01-10 02:41:23,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 02:41:23,857 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:23,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:23,858 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:23,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 02:41:23,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-01-10 02:41:23,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:41:23,965 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 02:41:23,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-01-10 02:41:24,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 02:41:24,127 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:24,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853577909] [2022-01-10 02:41:24,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853577909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 02:41:24,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 02:41:24,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 02:41:24,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149713231] [2022-01-10 02:41:24,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 02:41:24,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 02:41:24,128 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:24,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 02:41:24,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 02:41:24,129 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 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) [2022-01-10 02:41:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:24,211 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2022-01-10 02:41:24,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 02:41:24,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 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 53 [2022-01-10 02:41:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:24,212 INFO L225 Difference]: With dead ends: 85 [2022-01-10 02:41:24,212 INFO L226 Difference]: Without dead ends: 69 [2022-01-10 02:41:24,213 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-10 02:41:24,213 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:24,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 45 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:41:24,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-10 02:41:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2022-01-10 02:41:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.25) internal successors, (80), 64 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:24,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2022-01-10 02:41:24,222 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 53 [2022-01-10 02:41:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:24,223 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2022-01-10 02:41:24,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 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) [2022-01-10 02:41:24,223 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2022-01-10 02:41:24,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-10 02:41:24,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:24,224 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:24,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:24,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:24,434 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:24,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:24,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1926489495, now seen corresponding path program 4 times [2022-01-10 02:41:24,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:24,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172812196] [2022-01-10 02:41:24,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 02:41:24,435 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:24,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:24,436 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:24,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 02:41:24,547 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 02:41:24,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:41:24,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 02:41:24,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:24,769 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-01-10 02:41:24,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 37 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-01-10 02:41:24,999 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:24,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172812196] [2022-01-10 02:41:24,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172812196] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:24,999 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:24,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-01-10 02:41:24,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928705070] [2022-01-10 02:41:25,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:25,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 02:41:25,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:25,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 02:41:25,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:41:25,001 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 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) [2022-01-10 02:41:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:25,297 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-01-10 02:41:25,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 02:41:25,298 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-01-10 02:41:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:25,298 INFO L225 Difference]: With dead ends: 97 [2022-01-10 02:41:25,299 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 02:41:25,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2022-01-10 02:41:25,300 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 166 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:25,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 100 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 02:41:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 02:41:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-01-10 02:41:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 67 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:25,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2022-01-10 02:41:25,308 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 56 [2022-01-10 02:41:25,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:25,308 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2022-01-10 02:41:25,308 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 13 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) [2022-01-10 02:41:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2022-01-10 02:41:25,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-10 02:41:25,309 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:25,309 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:25,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:25,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:25,520 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:25,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:25,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1118322939, now seen corresponding path program 5 times [2022-01-10 02:41:25,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:25,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333542580] [2022-01-10 02:41:25,521 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 02:41:25,521 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:25,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:25,522 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:25,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 02:41:25,749 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-01-10 02:41:25,749 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:41:25,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 02:41:25,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 27 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-10 02:41:26,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 95 proven. 23 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-01-10 02:41:27,847 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:27,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333542580] [2022-01-10 02:41:27,847 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333542580] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:27,847 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:27,847 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2022-01-10 02:41:27,847 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544901617] [2022-01-10 02:41:27,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:27,848 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 02:41:27,848 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:27,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 02:41:27,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2022-01-10 02:41:27,848 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 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) [2022-01-10 02:41:32,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:32,675 INFO L93 Difference]: Finished difference Result 231 states and 304 transitions. [2022-01-10 02:41:32,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-01-10 02:41:32,677 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 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) Word has length 59 [2022-01-10 02:41:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:32,678 INFO L225 Difference]: With dead ends: 231 [2022-01-10 02:41:32,679 INFO L226 Difference]: Without dead ends: 208 [2022-01-10 02:41:32,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 456 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=468, Invalid=1982, Unknown=0, NotChecked=0, Total=2450 [2022-01-10 02:41:32,681 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 314 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:32,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [314 Valid, 335 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-10 02:41:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-01-10 02:41:32,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 125. [2022-01-10 02:41:32,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.314516129032258) internal successors, (163), 124 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 163 transitions. [2022-01-10 02:41:32,711 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 163 transitions. Word has length 59 [2022-01-10 02:41:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:32,712 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 163 transitions. [2022-01-10 02:41:32,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 23 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) [2022-01-10 02:41:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 163 transitions. [2022-01-10 02:41:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-10 02:41:32,717 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:32,717 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 9, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:32,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:32,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:32,928 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:32,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:32,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1868712025, now seen corresponding path program 6 times [2022-01-10 02:41:32,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:32,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313686516] [2022-01-10 02:41:32,929 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-10 02:41:32,930 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:32,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:32,931 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:32,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 02:41:33,206 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-01-10 02:41:33,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:41:33,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 02:41:33,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-01-10 02:41:33,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-01-10 02:41:33,749 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:33,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313686516] [2022-01-10 02:41:33,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313686516] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:33,749 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:33,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2022-01-10 02:41:33,749 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252557980] [2022-01-10 02:41:33,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:33,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 02:41:33,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 02:41:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-01-10 02:41:33,750 INFO L87 Difference]: Start difference. First operand 125 states and 163 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:33,909 INFO L93 Difference]: Finished difference Result 206 states and 275 transitions. [2022-01-10 02:41:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 02:41:33,909 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-01-10 02:41:33,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:33,912 INFO L225 Difference]: With dead ends: 206 [2022-01-10 02:41:33,912 INFO L226 Difference]: Without dead ends: 196 [2022-01-10 02:41:33,912 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-01-10 02:41:33,913 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 165 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:33,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 143 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 02:41:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-01-10 02:41:33,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 161. [2022-01-10 02:41:33,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.31875) internal successors, (211), 160 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 211 transitions. [2022-01-10 02:41:33,929 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 211 transitions. Word has length 62 [2022-01-10 02:41:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:33,930 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 211 transitions. [2022-01-10 02:41:33,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 13 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:33,930 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 211 transitions. [2022-01-10 02:41:33,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 02:41:33,931 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:33,931 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:33,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:34,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:34,146 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:34,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:34,147 INFO L85 PathProgramCache]: Analyzing trace with hash 96032675, now seen corresponding path program 7 times [2022-01-10 02:41:34,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:34,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279453315] [2022-01-10 02:41:34,147 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-10 02:41:34,147 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:34,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:34,149 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:34,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 02:41:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:41:34,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 02:41:34,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:34,487 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 02:41:34,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 02:41:34,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:34,593 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:34,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:34,742 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:34,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:34,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 02:41:34,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 02:41:34,977 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 02:41:34,978 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 02:41:34,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-01-10 02:41:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 28 proven. 25 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2022-01-10 02:41:35,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:35,350 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_203 (Array (_ BitVec 64) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| v_ArrVal_203) |c_~#array~0.base|))) (bvslt (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv1 32)) (_ bv4 64)))) (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))))))) is different from false [2022-01-10 02:41:35,457 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_203 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#array~1#1.base_13| (_ BitVec 64))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#array~1#1.base_13|))) (not (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#array~1#1.base_13| v_ArrVal_203) |c_~#array~0.base|))) (bvslt (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv1 32)) (_ bv4 64)))) (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64))))))))) is different from false [2022-01-10 02:41:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 9 not checked. [2022-01-10 02:41:35,461 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:35,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279453315] [2022-01-10 02:41:35,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279453315] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:35,461 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:35,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 17 [2022-01-10 02:41:35,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536248730] [2022-01-10 02:41:35,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:35,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 02:41:35,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:35,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 02:41:35,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=193, Unknown=2, NotChecked=58, Total=306 [2022-01-10 02:41:35,463 INFO L87 Difference]: Start difference. First operand 161 states and 211 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 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) [2022-01-10 02:41:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:36,730 INFO L93 Difference]: Finished difference Result 355 states and 459 transitions. [2022-01-10 02:41:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 02:41:36,730 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-10 02:41:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:36,731 INFO L225 Difference]: With dead ends: 355 [2022-01-10 02:41:36,731 INFO L226 Difference]: Without dead ends: 211 [2022-01-10 02:41:36,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 120 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=133, Invalid=473, Unknown=2, NotChecked=94, Total=702 [2022-01-10 02:41:36,733 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:36,734 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 153 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 210 Invalid, 0 Unknown, 55 Unchecked, 0.4s Time] [2022-01-10 02:41:36,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-10 02:41:36,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 161. [2022-01-10 02:41:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.3125) internal successors, (210), 160 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 210 transitions. [2022-01-10 02:41:36,749 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 210 transitions. Word has length 69 [2022-01-10 02:41:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:36,750 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 210 transitions. [2022-01-10 02:41:36,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 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) [2022-01-10 02:41:36,750 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2022-01-10 02:41:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 02:41:36,751 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:36,751 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 9, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:36,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:36,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:36,955 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash 539933349, now seen corresponding path program 1 times [2022-01-10 02:41:36,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:36,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304659254] [2022-01-10 02:41:36,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 02:41:36,956 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:36,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:36,957 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:36,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 02:41:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 02:41:37,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-10 02:41:37,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:37,262 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 02:41:37,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 02:41:37,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:37,371 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:37,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:37,502 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:37,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:37,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 02:41:37,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 02:41:37,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 02:41:37,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 02:41:37,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-01-10 02:41:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 56 proven. 27 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-01-10 02:41:37,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:38,330 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array (_ BitVec 64) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| v_ArrVal_236) |c_~#array~0.base|))) (bvslt (select .cse0 (bvadd |c_~#array~0.offset| (bvmul (_ bv4 64) ((_ sign_extend 32) (_ bv2 32))))) (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))))))) is different from false [2022-01-10 02:41:38,414 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#array~1#1.base_14| (_ BitVec 64))) (or (not (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#array~1#1.base_14| v_ArrVal_236) |c_~#array~0.base|))) (bvslt (select .cse0 (bvadd |c_~#array~0.offset| (bvmul (_ bv4 64) ((_ sign_extend 32) (_ bv2 32))))) (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#array~1#1.base_14|))))) is different from false [2022-01-10 02:41:38,416 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 188 trivial. 9 not checked. [2022-01-10 02:41:38,417 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:38,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304659254] [2022-01-10 02:41:38,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1304659254] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:38,417 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:38,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 19 [2022-01-10 02:41:38,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374661491] [2022-01-10 02:41:38,417 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:38,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-10 02:41:38,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:38,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-10 02:41:38,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=252, Unknown=2, NotChecked=66, Total=380 [2022-01-10 02:41:38,418 INFO L87 Difference]: Start difference. First operand 161 states and 210 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 19 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) [2022-01-10 02:41:39,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:39,639 INFO L93 Difference]: Finished difference Result 350 states and 451 transitions. [2022-01-10 02:41:39,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-10 02:41:39,641 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-10 02:41:39,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:39,641 INFO L225 Difference]: With dead ends: 350 [2022-01-10 02:41:39,642 INFO L226 Difference]: Without dead ends: 209 [2022-01-10 02:41:39,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 118 SyntacticMatches, 6 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=156, Invalid=662, Unknown=2, NotChecked=110, Total=930 [2022-01-10 02:41:39,643 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:39,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 134 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 225 Invalid, 0 Unknown, 71 Unchecked, 0.4s Time] [2022-01-10 02:41:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-01-10 02:41:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 161. [2022-01-10 02:41:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.30625) internal successors, (209), 160 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 209 transitions. [2022-01-10 02:41:39,658 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 209 transitions. Word has length 69 [2022-01-10 02:41:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:39,658 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 209 transitions. [2022-01-10 02:41:39,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 19 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) [2022-01-10 02:41:39,658 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 209 transitions. [2022-01-10 02:41:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 02:41:39,659 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:39,659 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:39,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:39,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:39,872 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:39,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:39,873 INFO L85 PathProgramCache]: Analyzing trace with hash 58853091, now seen corresponding path program 2 times [2022-01-10 02:41:39,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:39,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091130768] [2022-01-10 02:41:39,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 02:41:39,873 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:39,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:39,874 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:39,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 02:41:40,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 02:41:40,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:41:40,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-10 02:41:40,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:40,191 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 02:41:40,191 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 02:41:40,230 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:40,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:40,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:40,427 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:40,481 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:41:40,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 02:41:40,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 02:41:40,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 02:41:40,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 02:41:40,761 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-01-10 02:41:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 78 proven. 32 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-01-10 02:41:40,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:41,340 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_269 (Array (_ BitVec 64) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| v_ArrVal_269) |c_~#array~0.base|))) (bvslt (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv3 32)) (_ bv4 64)))) (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))))))) is different from false [2022-01-10 02:41:41,408 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#array~1#1.base_15| (_ BitVec 64)) (v_ArrVal_269 (Array (_ BitVec 64) (_ BitVec 32)))) (or (not (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#array~1#1.base_15| v_ArrVal_269) |c_~#array~0.base|))) (bvslt (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv3 32)) (_ bv4 64)))) (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#array~1#1.base_15|) (_ bv0 1))))) is different from false [2022-01-10 02:41:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 78 proven. 7 refuted. 0 times theorem prover too weak. 161 trivial. 9 not checked. [2022-01-10 02:41:41,410 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:41,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091130768] [2022-01-10 02:41:41,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091130768] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:41,410 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:41,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2022-01-10 02:41:41,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450221620] [2022-01-10 02:41:41,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:41,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-10 02:41:41,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:41,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-10 02:41:41,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=319, Unknown=2, NotChecked=74, Total=462 [2022-01-10 02:41:41,412 INFO L87 Difference]: Start difference. First operand 161 states and 209 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 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) [2022-01-10 02:41:41,768 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#array~0.base|))) (and (= (_ bv0 64) |c_~#array~0.offset|) (= (select .cse0 (bvadd |c_~#array~0.offset| (_ bv12 64))) (_ bv0 32)) (= (_ bv3 64) |c_~#array~0.base|) (forall ((v_ArrVal_269 (Array (_ BitVec 64) (_ BitVec 32)))) (not (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| v_ArrVal_269) |c_~#array~0.base|))) (bvslt (select .cse1 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv3 32)) (_ bv4 64)))) (select .cse1 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))))))) (= (_ bv0 32) (select .cse0 |c_~#array~0.offset|)))) is different from false [2022-01-10 02:41:41,773 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_269 (Array (_ BitVec 64) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| v_ArrVal_269) |c_~#array~0.base|))) (bvslt (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv3 32)) (_ bv4 64)))) (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))))))) (not (let ((.cse1 (select |c_#memory_int| |c_~#array~0.base|))) (bvslt (select .cse1 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv3 32)) (_ bv4 64)))) (select .cse1 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))))))) is different from false [2022-01-10 02:41:42,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:41:42,801 INFO L93 Difference]: Finished difference Result 345 states and 443 transitions. [2022-01-10 02:41:42,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-10 02:41:42,802 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 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) Word has length 69 [2022-01-10 02:41:42,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:41:42,803 INFO L225 Difference]: With dead ends: 345 [2022-01-10 02:41:42,803 INFO L226 Difference]: Without dead ends: 207 [2022-01-10 02:41:42,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 116 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=163, Invalid=779, Unknown=4, NotChecked=244, Total=1190 [2022-01-10 02:41:42,805 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 02:41:42,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 177 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 335 Invalid, 0 Unknown, 75 Unchecked, 0.5s Time] [2022-01-10 02:41:42,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-01-10 02:41:42,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 161. [2022-01-10 02:41:42,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 160 states have (on average 1.3) internal successors, (208), 160 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:41:42,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 208 transitions. [2022-01-10 02:41:42,821 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 208 transitions. Word has length 69 [2022-01-10 02:41:42,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:41:42,821 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 208 transitions. [2022-01-10 02:41:42,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 21 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) [2022-01-10 02:41:42,822 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 208 transitions. [2022-01-10 02:41:42,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 02:41:42,822 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:41:42,822 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:41:42,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-01-10 02:41:43,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:41:43,023 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:41:43,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:41:43,023 INFO L85 PathProgramCache]: Analyzing trace with hash -294235291, now seen corresponding path program 3 times [2022-01-10 02:41:43,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:41:43,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741108904] [2022-01-10 02:41:43,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 02:41:43,024 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:41:43,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:41:43,025 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:41:43,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-01-10 02:41:43,214 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-01-10 02:41:43,214 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:41:43,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 28 conjunts are in the unsatisfiable core [2022-01-10 02:41:43,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:41:43,773 INFO L353 Elim1Store]: treesize reduction 179, result has 13.1 percent of original size [2022-01-10 02:41:43,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 44 [2022-01-10 02:41:44,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 02:41:44,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 02:41:44,113 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 02:41:44,116 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 02:41:44,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 13 [2022-01-10 02:41:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 127 proven. 16 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 02:41:44,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:41:46,034 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 91 [2022-01-10 02:41:46,203 INFO L353 Elim1Store]: treesize reduction 95, result has 51.8 percent of original size [2022-01-10 02:41:46,204 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 1625 treesize of output 1344 [2022-01-10 02:41:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 117 proven. 30 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-01-10 02:41:49,909 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:41:49,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741108904] [2022-01-10 02:41:49,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741108904] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:41:49,909 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:41:49,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17] total 27 [2022-01-10 02:41:49,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188623779] [2022-01-10 02:41:49,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:41:49,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-10 02:41:49,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:41:49,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-10 02:41:49,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2022-01-10 02:41:49,910 INFO L87 Difference]: Start difference. First operand 161 states and 208 transitions. Second operand has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:42:00,168 WARN L228 SmtUtils]: Spent 8.13s on a formula simplification. DAG size of input: 67 DAG size of output: 38 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-10 02:42:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:42:07,378 INFO L93 Difference]: Finished difference Result 364 states and 474 transitions. [2022-01-10 02:42:07,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-10 02:42:07,378 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-10 02:42:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:42:07,380 INFO L225 Difference]: With dead ends: 364 [2022-01-10 02:42:07,380 INFO L226 Difference]: Without dead ends: 301 [2022-01-10 02:42:07,381 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=578, Invalid=2614, Unknown=0, NotChecked=0, Total=3192 [2022-01-10 02:42:07,381 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 122 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 02:42:07,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 158 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 425 Invalid, 0 Unknown, 154 Unchecked, 1.0s Time] [2022-01-10 02:42:07,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-01-10 02:42:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 225. [2022-01-10 02:42:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.3080357142857142) internal successors, (293), 224 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:42:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 293 transitions. [2022-01-10 02:42:07,406 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 293 transitions. Word has length 69 [2022-01-10 02:42:07,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:42:07,406 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 293 transitions. [2022-01-10 02:42:07,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.7037037037037037) internal successors, (73), 27 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:42:07,406 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 293 transitions. [2022-01-10 02:42:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 02:42:07,407 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:42:07,407 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:42:07,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-01-10 02:42:07,618 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:42:07,618 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:42:07,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:42:07,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1305352541, now seen corresponding path program 4 times [2022-01-10 02:42:07,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:42:07,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [755410184] [2022-01-10 02:42:07,619 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 02:42:07,619 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:42:07,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:42:07,621 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:42:07,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-01-10 02:42:07,825 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 02:42:07,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:42:07,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-10 02:42:07,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:42:07,885 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 02:42:07,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-10 02:42:07,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:42:07,971 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:42:08,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:42:08,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:42:08,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 02:42:08,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 02:42:08,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 02:42:08,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 02:42:08,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 13 [2022-01-10 02:42:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 94 proven. 40 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-01-10 02:42:08,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 02:42:09,172 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_331 (Array (_ BitVec 64) (_ BitVec 32)))) (not (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#array~1#1.base| v_ArrVal_331) |c_~#array~0.base|))) (bvslt (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv4 32)) (_ bv4 64)))) (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64)))))))) is different from false [2022-01-10 02:42:09,232 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~#array~1#1.base_16| (_ BitVec 64)) (v_ArrVal_331 (Array (_ BitVec 64) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~#array~1#1.base_16|))) (not (let ((.cse0 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#array~1#1.base_16| v_ArrVal_331) |c_~#array~0.base|))) (bvslt (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv4 32)) (_ bv4 64)))) (select .cse0 (bvadd |c_~#array~0.offset| (bvmul ((_ sign_extend 32) (_ bv0 32)) (_ bv4 64))))))))) is different from false [2022-01-10 02:42:09,234 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 94 proven. 15 refuted. 0 times theorem prover too weak. 137 trivial. 9 not checked. [2022-01-10 02:42:09,244 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 02:42:09,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [755410184] [2022-01-10 02:42:09,245 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [755410184] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 02:42:09,245 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 02:42:09,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2022-01-10 02:42:09,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630223828] [2022-01-10 02:42:09,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 02:42:09,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-10 02:42:09,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 02:42:09,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-10 02:42:09,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=394, Unknown=2, NotChecked=82, Total=552 [2022-01-10 02:42:09,246 INFO L87 Difference]: Start difference. First operand 225 states and 293 transitions. Second operand has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:42:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 02:42:11,082 INFO L93 Difference]: Finished difference Result 466 states and 606 transitions. [2022-01-10 02:42:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-10 02:42:11,083 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2022-01-10 02:42:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 02:42:11,084 INFO L225 Difference]: With dead ends: 466 [2022-01-10 02:42:11,084 INFO L226 Difference]: Without dead ends: 266 [2022-01-10 02:42:11,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 114 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=202, Invalid=1136, Unknown=2, NotChecked=142, Total=1482 [2022-01-10 02:42:11,085 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 68 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 02:42:11,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 256 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 436 Invalid, 0 Unknown, 71 Unchecked, 0.6s Time] [2022-01-10 02:42:11,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-01-10 02:42:11,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 226. [2022-01-10 02:42:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 225 states have (on average 1.3066666666666666) internal successors, (294), 225 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:42:11,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 294 transitions. [2022-01-10 02:42:11,105 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 294 transitions. Word has length 69 [2022-01-10 02:42:11,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 02:42:11,105 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 294 transitions. [2022-01-10 02:42:11,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.4583333333333335) internal successors, (59), 23 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 02:42:11,106 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 294 transitions. [2022-01-10 02:42:11,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-10 02:42:11,106 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 02:42:11,106 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 02:42:11,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-01-10 02:42:11,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 02:42:11,307 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 02:42:11,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 02:42:11,307 INFO L85 PathProgramCache]: Analyzing trace with hash 940226913, now seen corresponding path program 5 times [2022-01-10 02:42:11,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 02:42:11,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69037351] [2022-01-10 02:42:11,308 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 02:42:11,308 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 02:42:11,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 02:42:11,309 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 02:42:11,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-01-10 02:42:11,506 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-01-10 02:42:11,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 02:42:11,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 02:42:11,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 02:42:11,556 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 02:42:12,115 INFO L353 Elim1Store]: treesize reduction 179, result has 13.1 percent of original size [2022-01-10 02:42:12,115 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 44 [2022-01-10 02:42:12,935 INFO L353 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2022-01-10 02:42:12,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 13 [2022-01-10 02:42:13,062 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 160 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-01-10 02:42:13,062 INFO L328 TraceCheckSpWp]: Computing backward predicates...