/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/list-simple/sll2n_remove_all.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:09:47,315 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:09:47,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:09:47,392 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:09:47,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:09:47,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:09:47,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:09:47,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:09:47,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:09:47,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:09:47,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:09:47,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:09:47,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:09:47,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:09:47,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:09:47,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:09:47,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:09:47,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:09:47,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:09:47,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:09:47,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:09:47,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:09:47,431 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:09:47,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:09:47,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:09:47,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:09:47,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:09:47,441 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:09:47,441 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:09:47,442 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:09:47,442 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:09:47,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:09:47,444 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:09:47,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:09:47,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:09:47,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:09:47,446 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:09:47,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:09:47,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:09:47,447 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:09:47,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:09:47,449 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 06:09:47,484 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:09:47,485 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:09:47,485 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:09:47,485 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:09:47,486 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:09:47,486 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:09:47,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:09:47,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:09:47,487 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:09:47,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:09:47,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:09:47,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:09:47,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:09:47,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:09:47,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:09:47,489 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:09:47,489 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:09:47,489 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:09:47,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:09:47,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:09:47,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:09:47,489 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:09:47,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:09:47,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:09:47,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:09:47,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:09:47,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:09:47,491 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:09:47,492 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:47,492 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:09:47,492 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:09:47,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:09:47,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:09:47,492 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 06:09:47,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:09:47,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:09:47,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:09:47,733 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:09:47,733 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:09:47,735 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_remove_all.i [2022-01-10 06:09:47,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec9e1f30/9473ab5cceac44ccb7b2db2f9689b379/FLAGc649cd3c6 [2022-01-10 06:09:48,270 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:09:48,270 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all.i [2022-01-10 06:09:48,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec9e1f30/9473ab5cceac44ccb7b2db2f9689b379/FLAGc649cd3c6 [2022-01-10 06:09:48,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec9e1f30/9473ab5cceac44ccb7b2db2f9689b379 [2022-01-10 06:09:48,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:09:48,592 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:09:48,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:09:48,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:09:48,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:09:48,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:09:48" (1/1) ... [2022-01-10 06:09:48,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a9df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48, skipping insertion in model container [2022-01-10 06:09:48,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:09:48" (1/1) ... [2022-01-10 06:09:48,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:09:48,630 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:09:48,896 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all.i[23806,23819] [2022-01-10 06:09:48,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:09:48,908 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:09:48,972 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_remove_all.i[23806,23819] [2022-01-10 06:09:48,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:09:48,995 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:09:48,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48 WrapperNode [2022-01-10 06:09:48,996 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:09:48,997 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:09:48,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:09:48,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:09:49,004 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48" (1/1) ... [2022-01-10 06:09:49,028 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48" (1/1) ... [2022-01-10 06:09:49,048 INFO L137 Inliner]: procedures = 129, calls = 25, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 84 [2022-01-10 06:09:49,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:09:49,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:09:49,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:09:49,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:09:49,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48" (1/1) ... [2022-01-10 06:09:49,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48" (1/1) ... [2022-01-10 06:09:49,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48" (1/1) ... [2022-01-10 06:09:49,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48" (1/1) ... [2022-01-10 06:09:49,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48" (1/1) ... [2022-01-10 06:09:49,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48" (1/1) ... [2022-01-10 06:09:49,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48" (1/1) ... [2022-01-10 06:09:49,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:09:49,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:09:49,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:09:49,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:09:49,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48" (1/1) ... [2022-01-10 06:09:49,103 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:09:49,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:09:49,126 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 06:09:49,133 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 06:09:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:09:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:09:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 06:09:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:09:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:09:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:09:49,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:09:49,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 06:09:49,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:09:49,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:09:49,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:09:49,319 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:09:49,320 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:09:49,595 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:09:49,600 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:09:49,600 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-10 06:09:49,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:09:49 BoogieIcfgContainer [2022-01-10 06:09:49,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:09:49,604 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:09:49,604 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:09:49,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:09:49,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:09:48" (1/3) ... [2022-01-10 06:09:49,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765b9d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:09:49, skipping insertion in model container [2022-01-10 06:09:49,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:48" (2/3) ... [2022-01-10 06:09:49,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@765b9d2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:09:49, skipping insertion in model container [2022-01-10 06:09:49,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:09:49" (3/3) ... [2022-01-10 06:09:49,609 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all.i [2022-01-10 06:09:49,614 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:09:49,614 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:09:49,672 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:09:49,685 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 06:09:49,686 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:09:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:49,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 06:09:49,709 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:49,710 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:49,711 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:49,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash -409335067, now seen corresponding path program 1 times [2022-01-10 06:09:49,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:49,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623702948] [2022-01-10 06:09:49,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:49,733 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:49,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:49,735 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 06:09:49,740 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 06:09:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:49,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:09:49,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:49,885 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 06:09:49,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:49,886 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:49,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623702948] [2022-01-10 06:09:49,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623702948] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:49,887 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:49,888 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:09:49,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756481275] [2022-01-10 06:09:49,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:49,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:09:49,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:49,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:09:49,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:09:49,924 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 06:09:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:49,937 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-01-10 06:09:49,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:09:49,939 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 06:09:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:49,946 INFO L225 Difference]: With dead ends: 32 [2022-01-10 06:09:49,946 INFO L226 Difference]: Without dead ends: 16 [2022-01-10 06:09:49,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:09:49,954 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:49,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:49,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-01-10 06:09:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-01-10 06:09:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:49,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-01-10 06:09:49,990 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 9 [2022-01-10 06:09:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:49,990 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-01-10 06:09:49,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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 06:09:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-01-10 06:09:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-10 06:09:49,991 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:49,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:50,004 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 06:09:50,192 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 06:09:50,193 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:50,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:50,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1724492075, now seen corresponding path program 1 times [2022-01-10 06:09:50,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:50,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196770472] [2022-01-10 06:09:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:50,195 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:50,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:50,197 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 06:09:50,200 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 06:09:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:50,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:09:50,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:50,338 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 06:09:50,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:50,339 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:50,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196770472] [2022-01-10 06:09:50,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196770472] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:50,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:50,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:09:50,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871473338] [2022-01-10 06:09:50,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:50,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:09:50,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:50,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:09:50,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:09:50,348 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. 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 06:09:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:50,369 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-01-10 06:09:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:09:50,370 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 06:09:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:50,371 INFO L225 Difference]: With dead ends: 30 [2022-01-10 06:09:50,371 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 06:09:50,371 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 06:09:50,373 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:50,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:50,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 06:09:50,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2022-01-10 06:09:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:50,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-01-10 06:09:50,381 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 9 [2022-01-10 06:09:50,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:50,381 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-01-10 06:09:50,382 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 06:09:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-01-10 06:09:50,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 06:09:50,382 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:50,382 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:50,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-01-10 06:09:50,583 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 06:09:50,583 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:50,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1461985389, now seen corresponding path program 1 times [2022-01-10 06:09:50,585 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:50,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603771705] [2022-01-10 06:09:50,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:50,585 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:50,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:50,587 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 06:09:50,588 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 06:09:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:50,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:09:50,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:50,731 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 06:09:50,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:50,793 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 06:09:50,794 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:50,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603771705] [2022-01-10 06:09:50,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603771705] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:50,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:50,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 06:09:50,795 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800864364] [2022-01-10 06:09:50,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:50,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:09:50,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:50,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:09:50,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:09:50,796 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:50,846 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-01-10 06:09:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:09:50,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 06:09:50,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:50,850 INFO L225 Difference]: With dead ends: 35 [2022-01-10 06:09:50,851 INFO L226 Difference]: Without dead ends: 26 [2022-01-10 06:09:50,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:09:50,854 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:50,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 67 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:50,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-10 06:09:50,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-01-10 06:09:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 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 06:09:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-01-10 06:09:50,863 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 14 [2022-01-10 06:09:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:50,863 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-01-10 06:09:50,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-01-10 06:09:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 06:09:50,865 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:50,865 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:50,876 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 06:09:51,075 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 06:09:51,076 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:51,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:51,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1187812821, now seen corresponding path program 2 times [2022-01-10 06:09:51,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:51,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237143078] [2022-01-10 06:09:51,079 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:09:51,079 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:51,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:51,080 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 06:09:51,083 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 06:09:51,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 06:09:51,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:51,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:09:51,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:09:51,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:51,223 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:51,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237143078] [2022-01-10 06:09:51,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237143078] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:51,224 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:51,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:09:51,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261193948] [2022-01-10 06:09:51,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:51,225 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:09:51,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:51,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:09:51,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:09:51,226 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:51,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:51,263 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-01-10 06:09:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:09:51,265 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 06:09:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:51,266 INFO L225 Difference]: With dead ends: 29 [2022-01-10 06:09:51,266 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 06:09:51,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:09:51,267 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:51,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:51,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 06:09:51,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-01-10 06:09:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-01-10 06:09:51,279 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2022-01-10 06:09:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:51,280 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-01-10 06:09:51,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-01-10 06:09:51,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 06:09:51,281 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:51,281 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:51,293 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 06:09:51,491 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 06:09:51,491 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1492503821, now seen corresponding path program 1 times [2022-01-10 06:09:51,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:51,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1173404433] [2022-01-10 06:09:51,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:51,493 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:51,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:51,495 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 06:09:51,497 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 06:09:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:51,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:09:51,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:09:51,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:09:51,886 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:51,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1173404433] [2022-01-10 06:09:51,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1173404433] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:51,886 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:51,886 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-01-10 06:09:51,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528034125] [2022-01-10 06:09:51,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:51,888 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 06:09:51,889 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:51,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 06:09:51,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-10 06:09:51,891 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 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 06:09:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:51,989 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-01-10 06:09:51,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:09:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 06:09:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:51,991 INFO L225 Difference]: With dead ends: 32 [2022-01-10 06:09:51,991 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 06:09:51,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-01-10 06:09:51,992 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:51,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 52 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:09:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 06:09:51,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-01-10 06:09:51,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.08) internal successors, (27), 25 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:09:51,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2022-01-10 06:09:51,997 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 22 [2022-01-10 06:09:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:51,998 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2022-01-10 06:09:51,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 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 06:09:51,998 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2022-01-10 06:09:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 06:09:51,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:51,999 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:52,012 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 06:09:52,199 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 06:09:52,200 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:52,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:52,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1018778923, now seen corresponding path program 2 times [2022-01-10 06:09:52,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:52,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698174075] [2022-01-10 06:09:52,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:09:52,201 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:52,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:52,202 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 06:09:52,203 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 06:09:52,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:09:52,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:52,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-10 06:09:52,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:52,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 06:09:52,475 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:09:52,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 24 [2022-01-10 06:09:52,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:09:52,659 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:09:52,802 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 06:09:52,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 06:09:52,972 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-10 06:09:52,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-10 06:09:53,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-01-10 06:09:53,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-01-10 06:09:53,570 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:09:53,622 INFO L353 Elim1Store]: treesize reduction 104, result has 16.8 percent of original size [2022-01-10 06:09:53,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 90 [2022-01-10 06:09:53,636 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 53 [2022-01-10 06:09:53,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:09:53,960 INFO L353 Elim1Store]: treesize reduction 119, result has 12.5 percent of original size [2022-01-10 06:09:53,961 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 100 treesize of output 76 [2022-01-10 06:09:53,981 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 06:09:53,981 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 68 [2022-01-10 06:09:54,308 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2022-01-10 06:09:54,320 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-01-10 06:09:54,321 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 21 [2022-01-10 06:09:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:09:54,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:10:50,937 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 64)) (v_ArrVal_166 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (_ BitVec 64)) (v_ArrVal_167 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse12 (bvadd (_ bv4 64) |c_ULTIMATE.start_node_create_~temp~0#1.offset|))) (let ((.cse1 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_167))) (store .cse13 v_DerPreprocessor_1 (store (select .cse13 v_DerPreprocessor_1) .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_node_create_~temp~0#1.base| v_ArrVal_166)) (.cse0 (select .cse2 |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (store (select .cse11 .cse0) .cse12 |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse5 (store .cse11 .cse0 .cse9))) (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse10 (select .cse6 |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_node_create_~temp~0#1.base|)) (let ((.cse8 (bvadd .cse10 (_ bv4 64)))) (let ((.cse7 (select .cse9 .cse8))) (let ((.cse3 (select (select .cse1 .cse0) .cse8)) (.cse4 (bvadd .cse7 (_ bv4 64)))) (and (= (_ bv0 64) (select (select (store .cse1 |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse2 |ULTIMATE.start_main_~#s~0#1.offset| .cse3)) .cse3) .cse4)) (= (_ bv0 64) (select (select (store .cse5 |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse6 |ULTIMATE.start_main_~#s~0#1.offset| .cse7)) .cse3) .cse4)))))) (not (= .cse10 |c_ULTIMATE.start_node_create_~temp~0#1.offset|)) (not (= v_DerPreprocessor_1 .cse0)))))))))))) is different from false [2022-01-10 06:10:55,586 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.offset| (_ BitVec 64)) (v_ArrVal_166 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_node_create_~temp~0#1.base_9| (_ BitVec 64)) (v_DerPreprocessor_1 (_ BitVec 64)) (v_ArrVal_167 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse7 (let ((.cse12 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_node_create_~temp~0#1.base_9| v_ArrVal_167))) (store .cse12 v_DerPreprocessor_1 (store (select .cse12 v_DerPreprocessor_1) (_ bv4 64) |c_ULTIMATE.start_sll_create_~head~0#1.base|))))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_node_create_~temp~0#1.base_9| v_ArrVal_166)) (.cse0 (select .cse8 |ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (store (select .cse11 .cse0) (_ bv4 64) |c_ULTIMATE.start_sll_create_~head~0#1.offset|))) (let ((.cse2 (store .cse11 .cse0 .cse10))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse1 (select .cse3 |ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |v_ULTIMATE.start_node_create_~temp~0#1.base_9| .cse0)) (not (= (_ bv0 64) .cse1)) (not (= v_DerPreprocessor_1 .cse0)) (not (= (select |c_#valid| |v_ULTIMATE.start_node_create_~temp~0#1.base_9|) (_ bv0 1))) (let ((.cse9 (bvadd (_ bv4 64) .cse1))) (let ((.cse4 (select .cse10 .cse9))) (let ((.cse5 (select (select .cse7 .cse0) .cse9)) (.cse6 (bvadd (_ bv4 64) .cse4))) (and (= (select (select (store .cse2 |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse3 |ULTIMATE.start_main_~#s~0#1.offset| .cse4)) .cse5) .cse6) (_ bv0 64)) (= (_ bv0 64) (select (select (store .cse7 |c_ULTIMATE.start_main_~#s~0#1.base| (store .cse8 |ULTIMATE.start_main_~#s~0#1.offset| .cse5)) .cse5) .cse6))))))))))))))) is different from false [2022-01-10 06:10:58,468 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:10:58,469 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 1624 treesize of output 1014