/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-86f66a4 [2020-07-07 11:20:28,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:20:28,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:20:28,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:20:28,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:20:28,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:20:28,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:20:28,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:20:28,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:20:28,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:20:28,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:20:28,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:20:28,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:20:28,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:20:28,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:20:28,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:20:28,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:20:28,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:20:28,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:20:28,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:20:28,568 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:20:28,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:20:28,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:20:28,573 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:20:28,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:20:28,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:20:28,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:20:28,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:20:28,578 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:20:28,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:20:28,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:20:28,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:20:28,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:20:28,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:20:28,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:20:28,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:20:28,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:20:28,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:20:28,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:20:28,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:20:28,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:20:28,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-07 11:20:28,618 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:20:28,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:20:28,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:20:28,622 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:20:28,622 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:20:28,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:20:28,623 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:20:28,623 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:20:28,623 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:20:28,623 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:20:28,624 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:20:28,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:20:28,624 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:20:28,625 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:20:28,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:20:28,626 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:20:28,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:20:28,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:20:28,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:20:28,626 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:20:28,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:20:28,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:20:28,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:20:28,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:20:28,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:20:28,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:20:28,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:20:28,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:20:28,628 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:20:28,628 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:20:28,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:20:28,939 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:20:28,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:20:28,944 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:20:28,944 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:20:28,945 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-07-07 11:20:29,012 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1171d4dfd/7033fc9facb54cce93951135017d62ce/FLAGd87635ab1 [2020-07-07 11:20:29,496 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:20:29,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-07-07 11:20:29,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1171d4dfd/7033fc9facb54cce93951135017d62ce/FLAGd87635ab1 [2020-07-07 11:20:29,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1171d4dfd/7033fc9facb54cce93951135017d62ce [2020-07-07 11:20:29,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:20:29,821 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:20:29,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:20:29,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:20:29,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:20:29,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:20:29" (1/1) ... [2020-07-07 11:20:29,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@739b4f20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:29, skipping insertion in model container [2020-07-07 11:20:29,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:20:29" (1/1) ... [2020-07-07 11:20:29,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:20:29,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:20:30,366 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:20:30,378 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:20:30,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:20:30,508 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:20:30,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:30 WrapperNode [2020-07-07 11:20:30,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:20:30,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:20:30,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:20:30,510 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:20:30,522 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:30" (1/1) ... [2020-07-07 11:20:30,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:30" (1/1) ... [2020-07-07 11:20:30,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:30" (1/1) ... [2020-07-07 11:20:30,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:30" (1/1) ... [2020-07-07 11:20:30,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:30" (1/1) ... [2020-07-07 11:20:30,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:30" (1/1) ... [2020-07-07 11:20:30,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:30" (1/1) ... [2020-07-07 11:20:30,580 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:20:30,580 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:20:30,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:20:30,581 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:20:30,582 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:20:30,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:20:30,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:20:30,638 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:20:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-07 11:20:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-07 11:20:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-07 11:20:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-07 11:20:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-07 11:20:30,638 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-07 11:20:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-07 11:20:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-07 11:20:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-07 11:20:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-07 11:20:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-07 11:20:30,639 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-07 11:20:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-07 11:20:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-07 11:20:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-07 11:20:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-07 11:20:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-07 11:20:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-07 11:20:30,640 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-07 11:20:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-07 11:20:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-07 11:20:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-07 11:20:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-07 11:20:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-07 11:20:30,641 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-07 11:20:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-07 11:20:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-07 11:20:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-07 11:20:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-07 11:20:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-07 11:20:30,642 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-07 11:20:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-07 11:20:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-07 11:20:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-07 11:20:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-07 11:20:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-07 11:20:30,643 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-07 11:20:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-07 11:20:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-07 11:20:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-07 11:20:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-07 11:20:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-07 11:20:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-07 11:20:30,644 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-07 11:20:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-07 11:20:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-07 11:20:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-07 11:20:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-07 11:20:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-07 11:20:30,645 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-07 11:20:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-07 11:20:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-07 11:20:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-07 11:20:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-07 11:20:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-07 11:20:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-07 11:20:30,646 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-07 11:20:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-07 11:20:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-07 11:20:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-07 11:20:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-07 11:20:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-07 11:20:30,647 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-07 11:20:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-07 11:20:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-07 11:20:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-07 11:20:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-07 11:20:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-07 11:20:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-07 11:20:30,648 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-07 11:20:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-07 11:20:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-07 11:20:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-07 11:20:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-07 11:20:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-07 11:20:30,649 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-07 11:20:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-07 11:20:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-07 11:20:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-07 11:20:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-07 11:20:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-07 11:20:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-07 11:20:30,650 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-07 11:20:30,651 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-07 11:20:30,651 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-07 11:20:30,651 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-07 11:20:30,651 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-07 11:20:30,651 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-07 11:20:30,651 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-07 11:20:30,651 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-07 11:20:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-07 11:20:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-07 11:20:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-07 11:20:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-07 11:20:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-07 11:20:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-07 11:20:30,652 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-07 11:20:30,653 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-07 11:20:30,653 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-07 11:20:30,653 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-07 11:20:30,653 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-07 11:20:30,653 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-07 11:20:30,653 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-07 11:20:30,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 11:20:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:20:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:20:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-07 11:20:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-07 11:20:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-07 11:20:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-07 11:20:30,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:20:30,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:20:31,280 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:20:31,281 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-07-07 11:20:31,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:20:31 BoogieIcfgContainer [2020-07-07 11:20:31,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:20:31,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:20:31,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:20:31,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:20:31,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:20:29" (1/3) ... [2020-07-07 11:20:31,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5278bc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:20:31, skipping insertion in model container [2020-07-07 11:20:31,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:30" (2/3) ... [2020-07-07 11:20:31,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5278bc61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:20:31, skipping insertion in model container [2020-07-07 11:20:31,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:20:31" (3/3) ... [2020-07-07 11:20:31,299 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2020-07-07 11:20:31,310 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:20:31,319 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-07 11:20:31,333 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-07 11:20:31,365 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:20:31,365 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:20:31,366 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:20:31,366 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:20:31,366 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:20:31,367 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:20:31,367 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:20:31,368 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:20:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2020-07-07 11:20:31,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-07 11:20:31,406 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:31,407 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:31,408 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:31,413 INFO L82 PathProgramCache]: Analyzing trace with hash 11193106, now seen corresponding path program 1 times [2020-07-07 11:20:31,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:31,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737659181] [2020-07-07 11:20:31,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:31,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:31,612 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737659181] [2020-07-07 11:20:31,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:31,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-07 11:20:31,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783768732] [2020-07-07 11:20:31,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-07 11:20:31,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:31,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-07 11:20:31,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:31,637 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 4 states. [2020-07-07 11:20:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:31,875 INFO L93 Difference]: Finished difference Result 188 states and 306 transitions. [2020-07-07 11:20:31,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-07 11:20:31,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-07-07 11:20:31,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:31,887 INFO L225 Difference]: With dead ends: 188 [2020-07-07 11:20:31,888 INFO L226 Difference]: Without dead ends: 100 [2020-07-07 11:20:31,892 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:31,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-07-07 11:20:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2020-07-07 11:20:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-07 11:20:31,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2020-07-07 11:20:31,937 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 8 [2020-07-07 11:20:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:31,938 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2020-07-07 11:20:31,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-07 11:20:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2020-07-07 11:20:31,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-07 11:20:31,939 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:31,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:31,939 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:20:31,940 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:31,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:31,940 INFO L82 PathProgramCache]: Analyzing trace with hash -648207140, now seen corresponding path program 1 times [2020-07-07 11:20:31,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:31,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764274376] [2020-07-07 11:20:31,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:32,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:32,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764274376] [2020-07-07 11:20:32,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:32,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-07 11:20:32,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339080129] [2020-07-07 11:20:32,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-07 11:20:32,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:32,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-07 11:20:32,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:32,015 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand 4 states. [2020-07-07 11:20:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:32,153 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2020-07-07 11:20:32,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-07 11:20:32,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-07 11:20:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:32,155 INFO L225 Difference]: With dead ends: 85 [2020-07-07 11:20:32,155 INFO L226 Difference]: Without dead ends: 83 [2020-07-07 11:20:32,156 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:32,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-07 11:20:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2020-07-07 11:20:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-07 11:20:32,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2020-07-07 11:20:32,167 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 14 [2020-07-07 11:20:32,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:32,168 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2020-07-07 11:20:32,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-07 11:20:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2020-07-07 11:20:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-07 11:20:32,169 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:32,169 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:32,169 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:20:32,169 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:32,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:32,170 INFO L82 PathProgramCache]: Analyzing trace with hash -648205218, now seen corresponding path program 1 times [2020-07-07 11:20:32,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:32,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083525375] [2020-07-07 11:20:32,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:32,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:32,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083525375] [2020-07-07 11:20:32,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:32,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:20:32,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525361356] [2020-07-07 11:20:32,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:20:32,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:32,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:20:32,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:20:32,245 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand 5 states. [2020-07-07 11:20:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:32,452 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2020-07-07 11:20:32,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 11:20:32,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-07 11:20:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:32,455 INFO L225 Difference]: With dead ends: 140 [2020-07-07 11:20:32,455 INFO L226 Difference]: Without dead ends: 138 [2020-07-07 11:20:32,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-07-07 11:20:32,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 85. [2020-07-07 11:20:32,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-07-07 11:20:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2020-07-07 11:20:32,465 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 14 [2020-07-07 11:20:32,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:32,466 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2020-07-07 11:20:32,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:20:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2020-07-07 11:20:32,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-07 11:20:32,467 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:32,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:32,467 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 11:20:32,468 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:32,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:32,468 INFO L82 PathProgramCache]: Analyzing trace with hash -646358176, now seen corresponding path program 1 times [2020-07-07 11:20:32,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:32,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394591237] [2020-07-07 11:20:32,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:32,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:32,569 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394591237] [2020-07-07 11:20:32,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:32,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:20:32,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322259112] [2020-07-07 11:20:32,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:20:32,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:32,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:20:32,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:20:32,574 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 5 states. [2020-07-07 11:20:32,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:32,742 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2020-07-07 11:20:32,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:20:32,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-07 11:20:32,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:32,744 INFO L225 Difference]: With dead ends: 85 [2020-07-07 11:20:32,744 INFO L226 Difference]: Without dead ends: 83 [2020-07-07 11:20:32,745 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:20:32,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-07-07 11:20:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2020-07-07 11:20:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-07-07 11:20:32,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2020-07-07 11:20:32,753 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 14 [2020-07-07 11:20:32,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:32,754 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2020-07-07 11:20:32,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:20:32,754 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2020-07-07 11:20:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-07 11:20:32,755 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:32,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:32,756 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 11:20:32,756 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:32,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:32,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1093009051, now seen corresponding path program 1 times [2020-07-07 11:20:32,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:32,757 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645180679] [2020-07-07 11:20:32,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:32,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:32,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:32,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:32,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645180679] [2020-07-07 11:20:32,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:32,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-07 11:20:32,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934006943] [2020-07-07 11:20:32,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-07 11:20:32,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:32,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-07 11:20:32,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:32,825 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 4 states. [2020-07-07 11:20:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:32,958 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2020-07-07 11:20:32,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-07 11:20:32,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-07-07 11:20:32,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:32,960 INFO L225 Difference]: With dead ends: 83 [2020-07-07 11:20:32,960 INFO L226 Difference]: Without dead ends: 79 [2020-07-07 11:20:32,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-07 11:20:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2020-07-07 11:20:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-07 11:20:32,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2020-07-07 11:20:32,967 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 19 [2020-07-07 11:20:32,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:32,968 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2020-07-07 11:20:32,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-07 11:20:32,968 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2020-07-07 11:20:32,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-07 11:20:32,969 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:32,969 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:32,969 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 11:20:32,970 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:32,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:32,970 INFO L82 PathProgramCache]: Analyzing trace with hash -476453587, now seen corresponding path program 1 times [2020-07-07 11:20:32,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:32,971 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412708299] [2020-07-07 11:20:32,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:33,043 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412708299] [2020-07-07 11:20:33,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:33,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:20:33,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076600828] [2020-07-07 11:20:33,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:20:33,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:33,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:20:33,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:20:33,045 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2020-07-07 11:20:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:33,204 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2020-07-07 11:20:33,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:20:33,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-07 11:20:33,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:33,206 INFO L225 Difference]: With dead ends: 136 [2020-07-07 11:20:33,207 INFO L226 Difference]: Without dead ends: 116 [2020-07-07 11:20:33,208 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:33,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-07 11:20:33,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 75. [2020-07-07 11:20:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-07-07 11:20:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2020-07-07 11:20:33,221 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 20 [2020-07-07 11:20:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:33,222 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2020-07-07 11:20:33,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:20:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2020-07-07 11:20:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-07 11:20:33,223 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:33,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:33,224 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 11:20:33,224 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:33,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:33,224 INFO L82 PathProgramCache]: Analyzing trace with hash 337242584, now seen corresponding path program 1 times [2020-07-07 11:20:33,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:33,225 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166199679] [2020-07-07 11:20:33,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:33,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:33,305 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166199679] [2020-07-07 11:20:33,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:33,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-07 11:20:33,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758086547] [2020-07-07 11:20:33,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-07 11:20:33,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:33,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-07 11:20:33,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:33,307 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 4 states. [2020-07-07 11:20:33,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:33,424 INFO L93 Difference]: Finished difference Result 141 states and 161 transitions. [2020-07-07 11:20:33,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-07 11:20:33,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-07 11:20:33,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:33,428 INFO L225 Difference]: With dead ends: 141 [2020-07-07 11:20:33,428 INFO L226 Difference]: Without dead ends: 99 [2020-07-07 11:20:33,429 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:33,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-07-07 11:20:33,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 78. [2020-07-07 11:20:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-07 11:20:33,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2020-07-07 11:20:33,435 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 24 [2020-07-07 11:20:33,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:33,435 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2020-07-07 11:20:33,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-07 11:20:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2020-07-07 11:20:33,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-07 11:20:33,436 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:33,437 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:33,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-07 11:20:33,437 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:33,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:33,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1864575058, now seen corresponding path program 1 times [2020-07-07 11:20:33,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:33,438 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763111395] [2020-07-07 11:20:33,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:33,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:33,491 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763111395] [2020-07-07 11:20:33,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:33,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-07 11:20:33,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404893762] [2020-07-07 11:20:33,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-07 11:20:33,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:33,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-07 11:20:33,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:33,493 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 4 states. [2020-07-07 11:20:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:33,608 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2020-07-07 11:20:33,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-07 11:20:33,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-07 11:20:33,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:33,610 INFO L225 Difference]: With dead ends: 78 [2020-07-07 11:20:33,610 INFO L226 Difference]: Without dead ends: 76 [2020-07-07 11:20:33,610 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-07 11:20:33,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-07-07 11:20:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-07 11:20:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2020-07-07 11:20:33,616 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 25 [2020-07-07 11:20:33,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:33,616 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2020-07-07 11:20:33,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-07 11:20:33,616 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2020-07-07 11:20:33,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-07 11:20:33,617 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:33,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:33,618 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-07 11:20:33,618 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:33,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:33,618 INFO L82 PathProgramCache]: Analyzing trace with hash -660297045, now seen corresponding path program 1 times [2020-07-07 11:20:33,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:33,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721741557] [2020-07-07 11:20:33,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:33,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:33,664 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721741557] [2020-07-07 11:20:33,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:33,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:20:33,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289857031] [2020-07-07 11:20:33,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:20:33,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:33,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:20:33,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:20:33,666 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 5 states. [2020-07-07 11:20:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:33,849 INFO L93 Difference]: Finished difference Result 194 states and 222 transitions. [2020-07-07 11:20:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:20:33,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-07 11:20:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:33,851 INFO L225 Difference]: With dead ends: 194 [2020-07-07 11:20:33,851 INFO L226 Difference]: Without dead ends: 130 [2020-07-07 11:20:33,852 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-07-07 11:20:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 78. [2020-07-07 11:20:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-07-07 11:20:33,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2020-07-07 11:20:33,866 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 27 [2020-07-07 11:20:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:33,866 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2020-07-07 11:20:33,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:20:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2020-07-07 11:20:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-07 11:20:33,868 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:33,868 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:33,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-07 11:20:33,868 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:33,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:33,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1681365399, now seen corresponding path program 1 times [2020-07-07 11:20:33,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:33,869 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497252923] [2020-07-07 11:20:33,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:33,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:33,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:33,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497252923] [2020-07-07 11:20:33,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:33,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:20:33,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126600148] [2020-07-07 11:20:33,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:20:33,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:33,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:20:33,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:20:33,945 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand 5 states. [2020-07-07 11:20:34,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:34,069 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2020-07-07 11:20:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-07 11:20:34,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2020-07-07 11:20:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:34,071 INFO L225 Difference]: With dead ends: 79 [2020-07-07 11:20:34,071 INFO L226 Difference]: Without dead ends: 77 [2020-07-07 11:20:34,071 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:20:34,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-07-07 11:20:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-07-07 11:20:34,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-07-07 11:20:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2020-07-07 11:20:34,082 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 27 [2020-07-07 11:20:34,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:34,082 INFO L479 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2020-07-07 11:20:34,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:20:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2020-07-07 11:20:34,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-07 11:20:34,083 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:34,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:34,084 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-07 11:20:34,085 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:34,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:34,085 INFO L82 PathProgramCache]: Analyzing trace with hash -840739825, now seen corresponding path program 1 times [2020-07-07 11:20:34,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:34,085 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900514623] [2020-07-07 11:20:34,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:34,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:34,192 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900514623] [2020-07-07 11:20:34,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:34,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 11:20:34,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73853752] [2020-07-07 11:20:34,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:20:34,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:34,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:20:34,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:34,195 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 6 states. [2020-07-07 11:20:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:34,453 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2020-07-07 11:20:34,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-07 11:20:34,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-07 11:20:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:34,455 INFO L225 Difference]: With dead ends: 182 [2020-07-07 11:20:34,455 INFO L226 Difference]: Without dead ends: 139 [2020-07-07 11:20:34,456 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:20:34,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2020-07-07 11:20:34,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2020-07-07 11:20:34,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-07-07 11:20:34,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2020-07-07 11:20:34,461 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 28 [2020-07-07 11:20:34,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:34,462 INFO L479 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2020-07-07 11:20:34,462 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:20:34,462 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2020-07-07 11:20:34,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-07 11:20:34,463 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:34,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:34,463 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-07 11:20:34,463 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:34,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:34,464 INFO L82 PathProgramCache]: Analyzing trace with hash -941335665, now seen corresponding path program 1 times [2020-07-07 11:20:34,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:34,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238585377] [2020-07-07 11:20:34,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:34,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:34,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238585377] [2020-07-07 11:20:34,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:34,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-07 11:20:34,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036272052] [2020-07-07 11:20:34,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 11:20:34,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:34,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 11:20:34,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-07 11:20:34,670 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 8 states. [2020-07-07 11:20:35,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:35,288 INFO L93 Difference]: Finished difference Result 231 states and 258 transitions. [2020-07-07 11:20:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:20:35,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-07 11:20:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:35,292 INFO L225 Difference]: With dead ends: 231 [2020-07-07 11:20:35,293 INFO L226 Difference]: Without dead ends: 229 [2020-07-07 11:20:35,293 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2020-07-07 11:20:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-07-07 11:20:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 98. [2020-07-07 11:20:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-07 11:20:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2020-07-07 11:20:35,301 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 28 [2020-07-07 11:20:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:35,301 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2020-07-07 11:20:35,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 11:20:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2020-07-07 11:20:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-07 11:20:35,302 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:35,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:35,303 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-07 11:20:35,303 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:35,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1932526751, now seen corresponding path program 1 times [2020-07-07 11:20:35,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:35,304 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040602887] [2020-07-07 11:20:35,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-07 11:20:35,353 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040602887] [2020-07-07 11:20:35,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:35,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-07 11:20:35,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100105745] [2020-07-07 11:20:35,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-07 11:20:35,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:35,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-07 11:20:35,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-07 11:20:35,355 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand 5 states. [2020-07-07 11:20:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:35,562 INFO L93 Difference]: Finished difference Result 145 states and 166 transitions. [2020-07-07 11:20:35,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 11:20:35,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-07 11:20:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:35,564 INFO L225 Difference]: With dead ends: 145 [2020-07-07 11:20:35,565 INFO L226 Difference]: Without dead ends: 127 [2020-07-07 11:20:35,565 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:35,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2020-07-07 11:20:35,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2020-07-07 11:20:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-07 11:20:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2020-07-07 11:20:35,575 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 30 [2020-07-07 11:20:35,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:35,576 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2020-07-07 11:20:35,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-07 11:20:35,576 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2020-07-07 11:20:35,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-07 11:20:35,581 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:35,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:35,581 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-07 11:20:35,581 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:35,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:35,582 INFO L82 PathProgramCache]: Analyzing trace with hash -250794977, now seen corresponding path program 1 times [2020-07-07 11:20:35,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:35,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018964393] [2020-07-07 11:20:35,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:35,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-07 11:20:35,639 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018964393] [2020-07-07 11:20:35,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:35,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-07 11:20:35,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307639053] [2020-07-07 11:20:35,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-07 11:20:35,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:35,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-07 11:20:35,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:35,642 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 4 states. [2020-07-07 11:20:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:35,784 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2020-07-07 11:20:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-07 11:20:35,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2020-07-07 11:20:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:35,785 INFO L225 Difference]: With dead ends: 119 [2020-07-07 11:20:35,785 INFO L226 Difference]: Without dead ends: 117 [2020-07-07 11:20:35,786 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-07-07 11:20:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2020-07-07 11:20:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2020-07-07 11:20:35,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2020-07-07 11:20:35,794 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 30 [2020-07-07 11:20:35,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:35,795 INFO L479 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2020-07-07 11:20:35,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-07 11:20:35,795 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2020-07-07 11:20:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-07 11:20:35,796 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:35,796 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:35,796 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-07 11:20:35,797 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:35,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:35,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1485208190, now seen corresponding path program 1 times [2020-07-07 11:20:35,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:35,797 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721765309] [2020-07-07 11:20:35,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:36,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:36,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721765309] [2020-07-07 11:20:36,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:36,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-07 11:20:36,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957627041] [2020-07-07 11:20:36,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:20:36,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:36,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:20:36,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:20:36,008 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand 9 states. [2020-07-07 11:20:36,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:36,593 INFO L93 Difference]: Finished difference Result 240 states and 275 transitions. [2020-07-07 11:20:36,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:20:36,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-07 11:20:36,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:36,595 INFO L225 Difference]: With dead ends: 240 [2020-07-07 11:20:36,595 INFO L226 Difference]: Without dead ends: 238 [2020-07-07 11:20:36,596 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-07-07 11:20:36,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2020-07-07 11:20:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 120. [2020-07-07 11:20:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-07-07 11:20:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2020-07-07 11:20:36,609 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 31 [2020-07-07 11:20:36,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:36,610 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2020-07-07 11:20:36,611 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:20:36,611 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2020-07-07 11:20:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-07 11:20:36,614 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:36,614 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:36,614 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-07 11:20:36,615 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:36,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:36,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1679328926, now seen corresponding path program 1 times [2020-07-07 11:20:36,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:36,616 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737713948] [2020-07-07 11:20:36,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:36,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737713948] [2020-07-07 11:20:36,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431655915] [2020-07-07 11:20:36,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:20:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:36,822 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 17 conjunts are in the unsatisfiable core [2020-07-07 11:20:36,829 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:20:36,939 INFO L384 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 11 treesize of output 7 [2020-07-07 11:20:36,940 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:36,949 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:36,954 INFO L384 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 11 treesize of output 7 [2020-07-07 11:20:36,955 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:36,961 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:36,961 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:36,961 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2020-07-07 11:20:36,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:36,993 INFO L384 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 21 treesize of output 20 [2020-07-07 11:20:36,993 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,004 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:37,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:37,009 INFO L384 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 21 treesize of output 20 [2020-07-07 11:20:37,010 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,019 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:37,019 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,019 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2020-07-07 11:20:37,076 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-07 11:20:37,077 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,084 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:37,088 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:37,089 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2020-07-07 11:20:37,089 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,093 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:37,094 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:37,094 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2020-07-07 11:20:37,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:37,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:20:37,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-07 11:20:37,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245287913] [2020-07-07 11:20:37,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-07 11:20:37,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:37,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-07 11:20:37,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-07 11:20:37,104 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand 9 states. [2020-07-07 11:20:37,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:37,470 INFO L93 Difference]: Finished difference Result 208 states and 242 transitions. [2020-07-07 11:20:37,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:20:37,470 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2020-07-07 11:20:37,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:37,471 INFO L225 Difference]: With dead ends: 208 [2020-07-07 11:20:37,471 INFO L226 Difference]: Without dead ends: 146 [2020-07-07 11:20:37,472 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:20:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-07-07 11:20:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2020-07-07 11:20:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-07-07 11:20:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2020-07-07 11:20:37,480 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 33 [2020-07-07 11:20:37,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:37,481 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2020-07-07 11:20:37,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-07 11:20:37,481 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2020-07-07 11:20:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-07 11:20:37,482 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:37,482 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:37,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2020-07-07 11:20:37,698 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:37,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1814124928, now seen corresponding path program 1 times [2020-07-07 11:20:37,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:37,699 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462349390] [2020-07-07 11:20:37,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:37,858 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462349390] [2020-07-07 11:20:37,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:37,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-07 11:20:37,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631629718] [2020-07-07 11:20:37,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-07 11:20:37,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:37,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-07 11:20:37,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-07-07 11:20:37,860 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 7 states. [2020-07-07 11:20:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:38,130 INFO L93 Difference]: Finished difference Result 200 states and 227 transitions. [2020-07-07 11:20:38,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 11:20:38,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2020-07-07 11:20:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:38,132 INFO L225 Difference]: With dead ends: 200 [2020-07-07 11:20:38,132 INFO L226 Difference]: Without dead ends: 180 [2020-07-07 11:20:38,133 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-07 11:20:38,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2020-07-07 11:20:38,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 132. [2020-07-07 11:20:38,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2020-07-07 11:20:38,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 153 transitions. [2020-07-07 11:20:38,142 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 153 transitions. Word has length 33 [2020-07-07 11:20:38,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:38,143 INFO L479 AbstractCegarLoop]: Abstraction has 132 states and 153 transitions. [2020-07-07 11:20:38,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-07 11:20:38,143 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 153 transitions. [2020-07-07 11:20:38,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-07 11:20:38,143 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:38,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:38,144 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-07 11:20:38,144 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:38,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:38,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2032979646, now seen corresponding path program 1 times [2020-07-07 11:20:38,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:38,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451278913] [2020-07-07 11:20:38,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-07 11:20:38,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451278913] [2020-07-07 11:20:38,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:38,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 11:20:38,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972789609] [2020-07-07 11:20:38,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:20:38,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:38,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:20:38,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:38,203 INFO L87 Difference]: Start difference. First operand 132 states and 153 transitions. Second operand 6 states. [2020-07-07 11:20:38,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:38,405 INFO L93 Difference]: Finished difference Result 182 states and 208 transitions. [2020-07-07 11:20:38,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-07 11:20:38,406 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-07 11:20:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:38,407 INFO L225 Difference]: With dead ends: 182 [2020-07-07 11:20:38,407 INFO L226 Difference]: Without dead ends: 166 [2020-07-07 11:20:38,408 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-07 11:20:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-07-07 11:20:38,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2020-07-07 11:20:38,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-07-07 11:20:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 179 transitions. [2020-07-07 11:20:38,422 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 179 transitions. Word has length 33 [2020-07-07 11:20:38,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:38,422 INFO L479 AbstractCegarLoop]: Abstraction has 152 states and 179 transitions. [2020-07-07 11:20:38,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:20:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 179 transitions. [2020-07-07 11:20:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-07 11:20:38,423 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:38,423 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:38,423 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-07 11:20:38,424 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:38,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:38,424 INFO L82 PathProgramCache]: Analyzing trace with hash 270360779, now seen corresponding path program 1 times [2020-07-07 11:20:38,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:38,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729627916] [2020-07-07 11:20:38,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:38,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729627916] [2020-07-07 11:20:38,553 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420015984] [2020-07-07 11:20:38,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:20:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:38,660 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-07 11:20:38,668 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:20:38,681 INFO L384 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 11 treesize of output 7 [2020-07-07 11:20:38,681 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:38,688 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:38,692 INFO L384 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 11 treesize of output 7 [2020-07-07 11:20:38,693 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:38,697 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:38,697 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:38,698 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2020-07-07 11:20:38,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:38,707 INFO L384 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 21 treesize of output 20 [2020-07-07 11:20:38,708 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:38,717 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:38,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:38,725 INFO L384 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 21 treesize of output 20 [2020-07-07 11:20:38,726 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:38,733 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:38,734 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:38,734 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2020-07-07 11:20:38,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:38,781 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2020-07-07 11:20:38,782 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:38,790 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:38,794 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-07 11:20:38,794 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 24 treesize of output 10 [2020-07-07 11:20:38,795 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:38,799 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:38,799 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:38,799 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-07-07 11:20:38,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-07 11:20:38,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:20:38,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-07-07 11:20:38,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695690250] [2020-07-07 11:20:38,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-07 11:20:38,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:38,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-07 11:20:38,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-07 11:20:38,812 INFO L87 Difference]: Start difference. First operand 152 states and 179 transitions. Second operand 8 states. [2020-07-07 11:20:39,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:39,181 INFO L93 Difference]: Finished difference Result 248 states and 283 transitions. [2020-07-07 11:20:39,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-07 11:20:39,181 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2020-07-07 11:20:39,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:39,183 INFO L225 Difference]: With dead ends: 248 [2020-07-07 11:20:39,183 INFO L226 Difference]: Without dead ends: 210 [2020-07-07 11:20:39,183 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:20:39,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-07-07 11:20:39,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 169. [2020-07-07 11:20:39,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-07-07 11:20:39,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2020-07-07 11:20:39,193 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 36 [2020-07-07 11:20:39,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:39,193 INFO L479 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2020-07-07 11:20:39,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-07 11:20:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2020-07-07 11:20:39,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-07 11:20:39,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:39,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:39,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:20:39,409 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:39,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:39,410 INFO L82 PathProgramCache]: Analyzing trace with hash -620993698, now seen corresponding path program 1 times [2020-07-07 11:20:39,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:39,411 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173363083] [2020-07-07 11:20:39,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:39,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:39,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173363083] [2020-07-07 11:20:39,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:39,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-07 11:20:39,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518284968] [2020-07-07 11:20:39,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-07 11:20:39,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:39,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-07 11:20:39,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:39,444 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand 4 states. [2020-07-07 11:20:39,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:39,574 INFO L93 Difference]: Finished difference Result 354 states and 437 transitions. [2020-07-07 11:20:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-07 11:20:39,574 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2020-07-07 11:20:39,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:39,576 INFO L225 Difference]: With dead ends: 354 [2020-07-07 11:20:39,576 INFO L226 Difference]: Without dead ends: 258 [2020-07-07 11:20:39,577 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2020-07-07 11:20:39,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 218. [2020-07-07 11:20:39,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2020-07-07 11:20:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 262 transitions. [2020-07-07 11:20:39,587 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 262 transitions. Word has length 36 [2020-07-07 11:20:39,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:39,587 INFO L479 AbstractCegarLoop]: Abstraction has 218 states and 262 transitions. [2020-07-07 11:20:39,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-07 11:20:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 262 transitions. [2020-07-07 11:20:39,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-07 11:20:39,588 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:39,588 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:20:39,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-07-07 11:20:39,589 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:39,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:39,589 INFO L82 PathProgramCache]: Analyzing trace with hash -366933706, now seen corresponding path program 1 times [2020-07-07 11:20:39,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:39,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360125573] [2020-07-07 11:20:39,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:39,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:39,789 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360125573] [2020-07-07 11:20:39,790 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174780381] [2020-07-07 11:20:39,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:20:39,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:39,902 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-07 11:20:39,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:20:39,914 INFO L384 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 [2020-07-07 11:20:39,914 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:39,917 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:39,918 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:39,918 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-07 11:20:39,924 INFO L384 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 13 treesize of output 9 [2020-07-07 11:20:39,924 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:39,931 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:39,934 INFO L384 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 13 treesize of output 9 [2020-07-07 11:20:39,934 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:39,941 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:39,941 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:39,941 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2020-07-07 11:20:39,990 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:39,991 INFO L384 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 15 [2020-07-07 11:20:39,991 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:40,012 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:40,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:40,020 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2020-07-07 11:20:40,021 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:40,040 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:40,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:40,045 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 27 [2020-07-07 11:20:40,046 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:40,061 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:40,063 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:40,063 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:89, output treesize:50 [2020-07-07 11:20:40,116 INFO L440 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_40|], 12=[|v_#memory_$Pointer$.base_40|]} [2020-07-07 11:20:40,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:40,122 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2020-07-07 11:20:40,123 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:40,142 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:40,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:40,238 INFO L350 Elim1Store]: treesize reduction 46, result has 65.2 percent of original size [2020-07-07 11:20:40,239 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 74 treesize of output 124 [2020-07-07 11:20:40,243 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-07-07 11:20:40,243 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-07 11:20:40,244 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:40,295 INFO L624 ElimStorePlain]: treesize reduction 64, result has 55.9 percent of original size [2020-07-07 11:20:40,298 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-07 11:20:40,298 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:97, output treesize:81 [2020-07-07 11:20:42,636 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-07-07 11:20:42,661 INFO L440 ElimStorePlain]: Different costs {6=[|#memory_$Pointer$.offset|], 12=[|#memory_$Pointer$.base|]} [2020-07-07 11:20:42,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:42,666 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 13 [2020-07-07 11:20:42,667 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:42,677 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:42,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:20:42,729 INFO L350 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2020-07-07 11:20:42,730 INFO L384 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 72 [2020-07-07 11:20:42,732 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-07-07 11:20:42,733 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-07 11:20:42,735 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:42,747 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:42,747 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:42,748 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:88, output treesize:7 [2020-07-07 11:20:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:20:42,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:20:42,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2020-07-07 11:20:42,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225088101] [2020-07-07 11:20:42,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-07 11:20:42,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:42,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-07 11:20:42,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=140, Unknown=1, NotChecked=0, Total=182 [2020-07-07 11:20:42,766 INFO L87 Difference]: Start difference. First operand 218 states and 262 transitions. Second operand 14 states. [2020-07-07 11:21:17,733 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2020-07-07 11:21:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:21:20,462 INFO L93 Difference]: Finished difference Result 521 states and 619 transitions. [2020-07-07 11:21:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-07 11:21:20,463 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2020-07-07 11:21:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:21:20,465 INFO L225 Difference]: With dead ends: 521 [2020-07-07 11:21:20,465 INFO L226 Difference]: Without dead ends: 429 [2020-07-07 11:21:20,466 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=221, Invalid=706, Unknown=3, NotChecked=0, Total=930 [2020-07-07 11:21:20,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2020-07-07 11:21:20,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 247. [2020-07-07 11:21:20,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2020-07-07 11:21:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 297 transitions. [2020-07-07 11:21:20,485 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 297 transitions. Word has length 40 [2020-07-07 11:21:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:21:20,485 INFO L479 AbstractCegarLoop]: Abstraction has 247 states and 297 transitions. [2020-07-07 11:21:20,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-07 11:21:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 297 transitions. [2020-07-07 11:21:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-07 11:21:20,486 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:21:20,486 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-07 11:21:20,699 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:21:20,700 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:21:20,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:21:20,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1717014481, now seen corresponding path program 1 times [2020-07-07 11:21:20,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:21:20,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916158777] [2020-07-07 11:21:20,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:21:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:21:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:21:20,762 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-07 11:21:20,762 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 11:21:20,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-07-07 11:21:20,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:21:20 BoogieIcfgContainer [2020-07-07 11:21:20,803 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:21:20,805 INFO L168 Benchmark]: Toolchain (without parser) took 50983.60 ms. Allocated memory was 137.9 MB in the beginning and 347.1 MB in the end (delta: 209.2 MB). Free memory was 101.8 MB in the beginning and 243.1 MB in the end (delta: -141.3 MB). Peak memory consumption was 67.9 MB. Max. memory is 7.1 GB. [2020-07-07 11:21:20,805 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-07 11:21:20,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.69 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 169.2 MB in the end (delta: -67.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. [2020-07-07 11:21:20,806 INFO L168 Benchmark]: Boogie Preprocessor took 70.84 ms. Allocated memory is still 201.9 MB. Free memory was 169.2 MB in the beginning and 165.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2020-07-07 11:21:20,806 INFO L168 Benchmark]: RCFGBuilder took 708.59 ms. Allocated memory is still 201.9 MB. Free memory was 165.8 MB in the beginning and 110.1 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. [2020-07-07 11:21:20,806 INFO L168 Benchmark]: TraceAbstraction took 49511.65 ms. Allocated memory was 201.9 MB in the beginning and 347.1 MB in the end (delta: 145.2 MB). Free memory was 109.4 MB in the beginning and 243.1 MB in the end (delta: -133.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2020-07-07 11:21:20,808 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 137.9 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 686.69 ms. Allocated memory was 137.9 MB in the beginning and 201.9 MB in the end (delta: 64.0 MB). Free memory was 101.3 MB in the beginning and 169.2 MB in the end (delta: -67.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 70.84 ms. Allocated memory is still 201.9 MB. Free memory was 169.2 MB in the beginning and 165.8 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 708.59 ms. Allocated memory is still 201.9 MB. Free memory was 165.8 MB in the beginning and 110.1 MB in the end (delta: 55.6 MB). Peak memory consumption was 55.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 49511.65 ms. Allocated memory was 201.9 MB in the beginning and 347.1 MB in the end (delta: 145.2 MB). Free memory was 109.4 MB in the beginning and 243.1 MB in the end (delta: -133.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1025]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L991] SLL* list = malloc(sizeof(SLL)); [L992] list->next = ((void*)0) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={-1:0}, malloc(sizeof(SLL))={-1:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] list->inner = malloc(sizeof(SLL)) [L993] EXPR list->inner [L993] list->inner->next = ((void*)0) [L993] EXPR list->inner [L993] list->inner->inner = ((void*)0) [L993] EXPR list->inner [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={-1:0}, list->inner={-2:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L995] SLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; [L1017] EXPR end->inner [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={-2:0}, len=0, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={-2:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1025] EXPR inner->inner VAL [end={-1:0}, inner={-2:0}, inner->inner={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1026] EXPR inner->next VAL [end={-1:0}, inner={-2:0}, inner->next={0:0}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1027] EXPR inner->inner [L1027] inner = inner->inner [L1028] COND TRUE len == 1 [L1029] EXPR inner->inner [L1029] inner = inner->inner [L1018] COND TRUE ((void*)0) != inner VAL [end={-1:0}, inner={12:3}, len=1, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1020] COND FALSE !(len == 0) [L1023] len = 2 VAL [end={-1:0}, inner={12:3}, len=2, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={-1:0}, inner={12:3}, len=2, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1025] EXPR inner->inner VAL [end={-1:0}, inner={12:3}, inner->inner={9:11}, len=2, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] [L1025] COND TRUE !(((void*)0) == inner->inner) [L1025] __VERIFIER_error() VAL [end={-1:0}, inner={12:3}, len=2, list={-1:0}, malloc(sizeof(SLL))={-2:0}, malloc(sizeof(SLL))={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 89 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 49.4s, OverallIterations: 22, TraceHistogramMax: 2, AutomataDifference: 42.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1629 SDtfs, 2200 SDslu, 3083 SDs, 0 SdLazy, 3672 SolverSat, 231 SolverUnsat, 16 SolverUnknown, 0 SolverNotchecked, 34.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 167 SyntacticMatches, 2 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 851 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 699 NumberOfCodeBlocks, 699 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 635 ConstructedInterpolants, 16 QuantifiedInterpolants, 237023 SizeOfPredicates, 31 NumberOfNonLiveVariables, 383 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 10/19 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...