/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 --traceabstraction.assert.codeblocks.term.scoring.heuristic DAGSIZE --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 --traceabstraction.trace.refinement.strategy CAMEL_SMT_AM -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-79ed534 [2020-07-20 03:38:58,050 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-20 03:38:58,052 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-20 03:38:58,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-20 03:38:58,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-20 03:38:58,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-20 03:38:58,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-20 03:38:58,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-20 03:38:58,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-20 03:38:58,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-20 03:38:58,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-20 03:38:58,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-20 03:38:58,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-20 03:38:58,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-20 03:38:58,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-20 03:38:58,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-20 03:38:58,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-20 03:38:58,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-20 03:38:58,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-20 03:38:58,110 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-20 03:38:58,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-20 03:38:58,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-20 03:38:58,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-20 03:38:58,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-20 03:38:58,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-20 03:38:58,123 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-20 03:38:58,123 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-20 03:38:58,126 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-20 03:38:58,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-20 03:38:58,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-20 03:38:58,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-20 03:38:58,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-20 03:38:58,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-20 03:38:58,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-20 03:38:58,133 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-20 03:38:58,133 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-20 03:38:58,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-20 03:38:58,134 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-20 03:38:58,134 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-20 03:38:58,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-20 03:38:58,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-20 03:38:58,137 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-20 03:38:58,174 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-20 03:38:58,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-20 03:38:58,178 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-20 03:38:58,178 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-20 03:38:58,178 INFO L138 SettingsManager]: * Use SBE=true [2020-07-20 03:38:58,179 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-20 03:38:58,179 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-20 03:38:58,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-20 03:38:58,179 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-20 03:38:58,179 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-20 03:38:58,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-20 03:38:58,180 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-20 03:38:58,180 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-20 03:38:58,180 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-20 03:38:58,181 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-20 03:38:58,182 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-20 03:38:58,182 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-20 03:38:58,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-20 03:38:58,182 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-20 03:38:58,182 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-20 03:38:58,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-20 03:38:58,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-20 03:38:58,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-20 03:38:58,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-20 03:38:58,184 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-20 03:38:58,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-20 03:38:58,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-20 03:38:58,184 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-20 03:38:58,184 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-20 03:38:58,185 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> DAGSIZE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> CAMEL_SMT_AM [2020-07-20 03:38:58,480 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-20 03:38:58,495 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-20 03:38:58,498 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-20 03:38:58,500 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-20 03:38:58,500 INFO L275 PluginConnector]: CDTParser initialized [2020-07-20 03:38:58,501 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i [2020-07-20 03:38:58,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501d283bf/33672dba4d2c4d7d86fd98e5571ac2a3/FLAGf293fd3f6 [2020-07-20 03:38:59,203 INFO L306 CDTParser]: Found 1 translation units. [2020-07-20 03:38:59,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-rb-sentinel-1.i [2020-07-20 03:38:59,215 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501d283bf/33672dba4d2c4d7d86fd98e5571ac2a3/FLAGf293fd3f6 [2020-07-20 03:38:59,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501d283bf/33672dba4d2c4d7d86fd98e5571ac2a3 [2020-07-20 03:38:59,431 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-20 03:38:59,434 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-20 03:38:59,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-20 03:38:59,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-20 03:38:59,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-20 03:38:59,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:38:59" (1/1) ... [2020-07-20 03:38:59,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798c2c17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:38:59, skipping insertion in model container [2020-07-20 03:38:59,446 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 03:38:59" (1/1) ... [2020-07-20 03:38:59,455 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-20 03:38:59,502 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-20 03:38:59,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 03:38:59,966 INFO L203 MainTranslator]: Completed pre-run [2020-07-20 03:39:00,016 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-20 03:39:00,064 INFO L208 MainTranslator]: Completed translation [2020-07-20 03:39:00,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:39:00 WrapperNode [2020-07-20 03:39:00,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-20 03:39:00,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-20 03:39:00,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-20 03:39:00,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-20 03:39:00,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:39:00" (1/1) ... [2020-07-20 03:39:00,081 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:39:00" (1/1) ... [2020-07-20 03:39:00,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:39:00" (1/1) ... [2020-07-20 03:39:00,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:39:00" (1/1) ... [2020-07-20 03:39:00,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:39:00" (1/1) ... [2020-07-20 03:39:00,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:39:00" (1/1) ... [2020-07-20 03:39:00,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:39:00" (1/1) ... [2020-07-20 03:39:00,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-20 03:39:00,135 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-20 03:39:00,135 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-20 03:39:00,135 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-20 03:39:00,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:39:00" (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-20 03:39:00,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-20 03:39:00,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-20 03:39:00,200 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-20 03:39:00,200 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-20 03:39:00,200 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-20 03:39:00,200 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-20 03:39:00,200 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-20 03:39:00,201 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-20 03:39:00,201 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-20 03:39:00,201 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-20 03:39:00,201 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-20 03:39:00,201 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-20 03:39:00,201 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-20 03:39:00,202 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-20 03:39:00,202 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-20 03:39:00,202 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-20 03:39:00,202 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-20 03:39:00,202 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-20 03:39:00,202 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-20 03:39:00,203 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-20 03:39:00,203 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-20 03:39:00,203 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-20 03:39:00,203 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-20 03:39:00,203 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-20 03:39:00,203 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-20 03:39:00,203 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-20 03:39:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-20 03:39:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-20 03:39:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-20 03:39:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-20 03:39:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-20 03:39:00,204 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-20 03:39:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-20 03:39:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-20 03:39:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-20 03:39:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-20 03:39:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-20 03:39:00,205 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-20 03:39:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-20 03:39:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-20 03:39:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-20 03:39:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-20 03:39:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-20 03:39:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-20 03:39:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-20 03:39:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-20 03:39:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-20 03:39:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-20 03:39:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-20 03:39:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-20 03:39:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-20 03:39:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-20 03:39:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-20 03:39:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-20 03:39:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-20 03:39:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-20 03:39:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-20 03:39:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-20 03:39:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-20 03:39:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-20 03:39:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-20 03:39:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-20 03:39:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-20 03:39:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-20 03:39:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-20 03:39:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-20 03:39:00,208 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-20 03:39:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-20 03:39:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-20 03:39:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-20 03:39:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-20 03:39:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-20 03:39:00,209 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-20 03:39:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-20 03:39:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-20 03:39:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-20 03:39:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-20 03:39:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-20 03:39:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-20 03:39:00,210 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-20 03:39:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-20 03:39:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-20 03:39:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-20 03:39:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-20 03:39:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-20 03:39:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-20 03:39:00,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-20 03:39:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-20 03:39:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-20 03:39:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-20 03:39:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-20 03:39:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-20 03:39:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-20 03:39:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-20 03:39:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-20 03:39:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-20 03:39:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-20 03:39:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-20 03:39:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-20 03:39:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-20 03:39:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-20 03:39:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-20 03:39:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-20 03:39:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-20 03:39:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-20 03:39:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-20 03:39:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-20 03:39:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-20 03:39:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-20 03:39:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-20 03:39:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-20 03:39:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-20 03:39:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-20 03:39:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-20 03:39:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-20 03:39:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-20 03:39:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-20 03:39:00,853 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-20 03:39:00,853 INFO L295 CfgBuilder]: Removed 17 assume(true) statements. [2020-07-20 03:39:00,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:39:00 BoogieIcfgContainer [2020-07-20 03:39:00,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-20 03:39:00,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-20 03:39:00,859 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-20 03:39:00,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-20 03:39:00,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 03:38:59" (1/3) ... [2020-07-20 03:39:00,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd82089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:39:00, skipping insertion in model container [2020-07-20 03:39:00,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 03:39:00" (2/3) ... [2020-07-20 03:39:00,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cd82089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 03:39:00, skipping insertion in model container [2020-07-20 03:39:00,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 03:39:00" (3/3) ... [2020-07-20 03:39:00,867 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2020-07-20 03:39:00,879 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-20 03:39:00,889 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-07-20 03:39:00,905 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-07-20 03:39:00,932 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-20 03:39:00,932 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-20 03:39:00,933 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-20 03:39:00,933 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-20 03:39:00,933 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-20 03:39:00,933 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-20 03:39:00,934 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-20 03:39:00,934 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-20 03:39:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2020-07-20 03:39:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-20 03:39:00,964 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:00,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:39:00,966 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:00,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:00,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1255802584, now seen corresponding path program 1 times [2020-07-20 03:39:00,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:00,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138508532] [2020-07-20 03:39:00,986 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:01,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:01,262 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-20 03:39:01,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138508532] [2020-07-20 03:39:01,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:39:01,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-20 03:39:01,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052836922] [2020-07-20 03:39:01,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-20 03:39:01,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:39:01,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-20 03:39:01,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:39:01,291 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 3 states. [2020-07-20 03:39:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:39:01,561 INFO L93 Difference]: Finished difference Result 98 states and 156 transitions. [2020-07-20 03:39:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-20 03:39:01,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-07-20 03:39:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:39:01,574 INFO L225 Difference]: With dead ends: 98 [2020-07-20 03:39:01,574 INFO L226 Difference]: Without dead ends: 45 [2020-07-20 03:39:01,578 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-20 03:39:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-20 03:39:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-07-20 03:39:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-20 03:39:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-07-20 03:39:01,625 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 10 [2020-07-20 03:39:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:39:01,626 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-07-20 03:39:01,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-20 03:39:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-07-20 03:39:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-20 03:39:01,627 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:01,627 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:39:01,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-20 03:39:01,628 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:01,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:01,629 INFO L82 PathProgramCache]: Analyzing trace with hash -338068956, now seen corresponding path program 1 times [2020-07-20 03:39:01,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:01,629 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187137759] [2020-07-20 03:39:01,629 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:01,750 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-20 03:39:01,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187137759] [2020-07-20 03:39:01,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:39:01,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 03:39:01,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431195385] [2020-07-20 03:39:01,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 03:39:01,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:39:01,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 03:39:01,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 03:39:01,755 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 5 states. [2020-07-20 03:39:01,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:39:01,958 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2020-07-20 03:39:01,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 03:39:01,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-07-20 03:39:01,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:39:01,960 INFO L225 Difference]: With dead ends: 51 [2020-07-20 03:39:01,960 INFO L226 Difference]: Without dead ends: 49 [2020-07-20 03:39:01,961 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-20 03:39:01,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-20 03:39:01,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2020-07-20 03:39:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-20 03:39:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2020-07-20 03:39:01,970 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 11 [2020-07-20 03:39:01,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:39:01,970 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2020-07-20 03:39:01,971 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 03:39:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-07-20 03:39:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-20 03:39:01,972 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:01,972 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:39:01,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-20 03:39:01,972 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:01,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:01,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1890143313, now seen corresponding path program 1 times [2020-07-20 03:39:01,973 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:01,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9942857] [2020-07-20 03:39:01,974 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:02,079 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-20 03:39:02,080 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9942857] [2020-07-20 03:39:02,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:39:02,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 03:39:02,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732604838] [2020-07-20 03:39:02,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 03:39:02,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:39:02,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 03:39:02,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 03:39:02,084 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 5 states. [2020-07-20 03:39:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:39:02,229 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2020-07-20 03:39:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 03:39:02,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-20 03:39:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:39:02,231 INFO L225 Difference]: With dead ends: 43 [2020-07-20 03:39:02,231 INFO L226 Difference]: Without dead ends: 41 [2020-07-20 03:39:02,232 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-20 03:39:02,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-20 03:39:02,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-20 03:39:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 03:39:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2020-07-20 03:39:02,239 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 12 [2020-07-20 03:39:02,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:39:02,239 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2020-07-20 03:39:02,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 03:39:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2020-07-20 03:39:02,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-20 03:39:02,240 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:02,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:39:02,241 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-20 03:39:02,241 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:02,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:02,242 INFO L82 PathProgramCache]: Analyzing trace with hash 290038970, now seen corresponding path program 1 times [2020-07-20 03:39:02,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:02,242 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949481008] [2020-07-20 03:39:02,243 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:02,368 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-20 03:39:02,368 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949481008] [2020-07-20 03:39:02,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:39:02,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 03:39:02,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666108497] [2020-07-20 03:39:02,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 03:39:02,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:39:02,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 03:39:02,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 03:39:02,371 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2020-07-20 03:39:02,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:39:02,605 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2020-07-20 03:39:02,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 03:39:02,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-07-20 03:39:02,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:39:02,607 INFO L225 Difference]: With dead ends: 66 [2020-07-20 03:39:02,607 INFO L226 Difference]: Without dead ends: 64 [2020-07-20 03:39:02,608 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-20 03:39:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-07-20 03:39:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2020-07-20 03:39:02,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-20 03:39:02,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2020-07-20 03:39:02,616 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 14 [2020-07-20 03:39:02,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:39:02,617 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2020-07-20 03:39:02,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 03:39:02,617 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2020-07-20 03:39:02,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-20 03:39:02,618 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:02,618 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:39:02,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-20 03:39:02,619 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:02,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:02,619 INFO L82 PathProgramCache]: Analyzing trace with hash 2060721718, now seen corresponding path program 1 times [2020-07-20 03:39:02,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:02,620 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664423263] [2020-07-20 03:39:02,620 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:02,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:02,729 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-20 03:39:02,732 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664423263] [2020-07-20 03:39:02,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:39:02,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 03:39:02,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064557429] [2020-07-20 03:39:02,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 03:39:02,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:39:02,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 03:39:02,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 03:39:02,735 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand 5 states. [2020-07-20 03:39:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:39:02,906 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-20 03:39:02,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 03:39:02,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-07-20 03:39:02,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:39:02,908 INFO L225 Difference]: With dead ends: 48 [2020-07-20 03:39:02,908 INFO L226 Difference]: Without dead ends: 46 [2020-07-20 03:39:02,909 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-20 03:39:02,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-20 03:39:02,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-20 03:39:02,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 03:39:02,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-07-20 03:39:02,916 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2020-07-20 03:39:02,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:39:02,917 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-07-20 03:39:02,917 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 03:39:02,917 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-20 03:39:02,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-20 03:39:02,918 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:02,918 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:39:02,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-20 03:39:02,919 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:02,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:02,919 INFO L82 PathProgramCache]: Analyzing trace with hash 373775322, now seen corresponding path program 1 times [2020-07-20 03:39:02,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:02,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725699148] [2020-07-20 03:39:02,920 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:03,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:03,030 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-20 03:39:03,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725699148] [2020-07-20 03:39:03,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:39:03,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-20 03:39:03,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908481981] [2020-07-20 03:39:03,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-20 03:39:03,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:39:03,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-20 03:39:03,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-20 03:39:03,033 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 5 states. [2020-07-20 03:39:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:39:03,170 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2020-07-20 03:39:03,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-20 03:39:03,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-07-20 03:39:03,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:39:03,172 INFO L225 Difference]: With dead ends: 46 [2020-07-20 03:39:03,172 INFO L226 Difference]: Without dead ends: 44 [2020-07-20 03:39:03,173 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-20 03:39:03,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-20 03:39:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-07-20 03:39:03,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-07-20 03:39:03,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2020-07-20 03:39:03,179 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 17 [2020-07-20 03:39:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:39:03,180 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2020-07-20 03:39:03,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-20 03:39:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2020-07-20 03:39:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-20 03:39:03,181 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:03,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:39:03,181 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-20 03:39:03,181 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:03,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1568846049, now seen corresponding path program 1 times [2020-07-20 03:39:03,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:03,183 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686651746] [2020-07-20 03:39:03,183 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:03,303 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-20 03:39:03,303 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686651746] [2020-07-20 03:39:03,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-20 03:39:03,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-20 03:39:03,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662344210] [2020-07-20 03:39:03,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-20 03:39:03,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:39:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-20 03:39:03,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-20 03:39:03,310 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2020-07-20 03:39:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:39:03,520 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2020-07-20 03:39:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-20 03:39:03,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-07-20 03:39:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:39:03,528 INFO L225 Difference]: With dead ends: 59 [2020-07-20 03:39:03,528 INFO L226 Difference]: Without dead ends: 47 [2020-07-20 03:39:03,528 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-20 03:39:03,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-20 03:39:03,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2020-07-20 03:39:03,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-20 03:39:03,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2020-07-20 03:39:03,536 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 18 [2020-07-20 03:39:03,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:39:03,536 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2020-07-20 03:39:03,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-20 03:39:03,537 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2020-07-20 03:39:03,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-20 03:39:03,540 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:03,540 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] [2020-07-20 03:39:03,540 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-20 03:39:03,541 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:03,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:03,541 INFO L82 PathProgramCache]: Analyzing trace with hash 777661568, now seen corresponding path program 1 times [2020-07-20 03:39:03,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:03,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889957464] [2020-07-20 03:39:03,542 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:03,639 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-20 03:39:03,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889957464] [2020-07-20 03:39:03,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342533841] [2020-07-20 03:39:03,640 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7bf62a5 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-20 03:39:03,797 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@7bf62a5 issued 2 check-sat command(s) [2020-07-20 03:39:03,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:39:03,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-20 03:39:03,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:39:03,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:03,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:03,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:03,876 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2020-07-20 03:39:03,877 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:03,887 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:03,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:03,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:03,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:03,896 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2020-07-20 03:39:03,896 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:03,905 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:03,906 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 03:39:03,906 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2020-07-20 03:39:03,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:03,967 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-20 03:39:03,968 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:03,976 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:03,981 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-20 03:39:03,982 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-20 03:39:03,983 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:03,987 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:03,988 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-20 03:39:03,988 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2020-07-20 03:39:04,005 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-20 03:39:04,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:39:04,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-07-20 03:39:04,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005615789] [2020-07-20 03:39:04,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-20 03:39:04,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:39:04,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-20 03:39:04,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-20 03:39:04,008 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 9 states. [2020-07-20 03:39:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:39:04,448 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2020-07-20 03:39:04,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-20 03:39:04,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-20 03:39:04,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:39:04,449 INFO L225 Difference]: With dead ends: 63 [2020-07-20 03:39:04,449 INFO L226 Difference]: Without dead ends: 41 [2020-07-20 03:39:04,450 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-20 03:39:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-20 03:39:04,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-20 03:39:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-20 03:39:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2020-07-20 03:39:04,455 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 21 [2020-07-20 03:39:04,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:39:04,455 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2020-07-20 03:39:04,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-20 03:39:04,456 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2020-07-20 03:39:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-20 03:39:04,456 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:04,457 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] [2020-07-20 03:39:04,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-20 03:39:04,668 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:04,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:04,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1056872398, now seen corresponding path program 1 times [2020-07-20 03:39:04,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:04,669 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891157739] [2020-07-20 03:39:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:04,850 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-20 03:39:04,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891157739] [2020-07-20 03:39:04,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100860409] [2020-07-20 03:39:04,851 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@180bfbe4 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-20 03:39:05,397 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@180bfbe4 issued 2 check-sat command(s) [2020-07-20 03:39:05,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:39:05,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 32 conjunts are in the unsatisfiable core [2020-07-20 03:39:05,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:39:05,425 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-20 03:39:05,426 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 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-20 03:39:05,427 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:05,439 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:05,446 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-20 03:39:05,446 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:05,455 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:05,457 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 03:39:05,457 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:26 [2020-07-20 03:39:05,562 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:05,563 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-20 03:39:05,564 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:05,650 INFO L624 ElimStorePlain]: treesize reduction 14, result has 88.6 percent of original size [2020-07-20 03:39:05,662 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 03:39:05,696 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:05,701 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 03:39:05,723 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:05,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:05,730 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:05,756 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:05,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:05,797 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:05,798 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 1 case distinctions, treesize of input 77 treesize of output 55 [2020-07-20 03:39:05,799 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:05,843 INFO L624 ElimStorePlain]: treesize reduction 20, result has 72.2 percent of original size [2020-07-20 03:39:05,846 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 03:39:05,846 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:111, output treesize:24 [2020-07-20 03:39:05,947 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:05,948 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-20 03:39:05,949 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:06,003 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:06,007 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_39|, |v_#memory_int_40|, |v_#memory_$Pointer$.base_30|, |v_#memory_int_41|], 4=[|v_#memory_int_43|]} [2020-07-20 03:39:06,017 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 03:39:06,056 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:06,060 INFO L544 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 03:39:06,092 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:06,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:06,095 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:06,121 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:06,124 INFO L544 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 03:39:06,153 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:06,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:06,216 INFO L350 Elim1Store]: treesize reduction 65, result has 46.7 percent of original size [2020-07-20 03:39:06,217 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 85 [2020-07-20 03:39:06,218 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:06,272 INFO L624 ElimStorePlain]: treesize reduction 18, result has 80.9 percent of original size [2020-07-20 03:39:06,289 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-20 03:39:06,290 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:246, output treesize:40 [2020-07-20 03:39:06,435 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2020-07-20 03:39:06,436 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:06,444 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:06,444 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 03:39:06,445 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-07-20 03:39:06,453 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-20 03:39:06,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:39:06,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-07-20 03:39:06,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760989389] [2020-07-20 03:39:06,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-20 03:39:06,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:39:06,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-20 03:39:06,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2020-07-20 03:39:06,456 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 12 states. [2020-07-20 03:39:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:39:07,194 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2020-07-20 03:39:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-20 03:39:07,195 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-07-20 03:39:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:39:07,196 INFO L225 Difference]: With dead ends: 73 [2020-07-20 03:39:07,196 INFO L226 Difference]: Without dead ends: 71 [2020-07-20 03:39:07,196 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2020-07-20 03:39:07,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-07-20 03:39:07,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2020-07-20 03:39:07,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-20 03:39:07,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-07-20 03:39:07,206 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 25 [2020-07-20 03:39:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:39:07,207 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-07-20 03:39:07,207 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-20 03:39:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-07-20 03:39:07,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-20 03:39:07,208 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:07,208 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:39:07,416 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:39:07,417 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:07,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:07,418 INFO L82 PathProgramCache]: Analyzing trace with hash -377613816, now seen corresponding path program 1 times [2020-07-20 03:39:07,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:07,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027554582] [2020-07-20 03:39:07,419 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:07,675 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:39:07,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027554582] [2020-07-20 03:39:07,675 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892001035] [2020-07-20 03:39:07,676 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4bd9e5a0 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-20 03:39:08,517 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4bd9e5a0 issued 3 check-sat command(s) [2020-07-20 03:39:08,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:39:08,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 51 conjunts are in the unsatisfiable core [2020-07-20 03:39:08,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:39:08,539 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-20 03:39:08,539 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 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-20 03:39:08,540 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:08,550 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:08,551 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 03:39:08,552 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2020-07-20 03:39:08,648 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:08,648 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-20 03:39:08,649 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:08,729 INFO L624 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2020-07-20 03:39:08,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:08,746 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 03:39:08,757 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:08,757 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-20 03:39:08,758 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:08,823 INFO L624 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2020-07-20 03:39:08,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:08,840 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:08,841 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-20 03:39:08,843 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:08,904 INFO L624 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2020-07-20 03:39:08,906 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 03:39:08,907 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2020-07-20 03:39:09,017 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:09,018 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-07-20 03:39:09,019 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:09,163 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-07-20 03:39:09,165 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:09,169 INFO L440 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_32|], 11=[|v_#memory_$Pointer$.offset_30|, |v_#memory_$Pointer$.base_32|]} [2020-07-20 03:39:09,184 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:09,185 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 433 treesize of output 289 [2020-07-20 03:39:09,187 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:09,470 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2020-07-20 03:39:09,471 INFO L624 ElimStorePlain]: treesize reduction 16, result has 96.4 percent of original size [2020-07-20 03:39:09,490 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2020-07-20 03:39:09,491 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:09,610 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-07-20 03:39:09,611 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:09,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:09,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:09,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:09,629 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 03:39:09,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:09,698 INFO L350 Elim1Store]: treesize reduction 5, result has 90.7 percent of original size [2020-07-20 03:39:09,699 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 97 [2020-07-20 03:39:09,700 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:09,823 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2020-07-20 03:39:09,824 INFO L624 ElimStorePlain]: treesize reduction 41, result has 86.4 percent of original size [2020-07-20 03:39:09,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:09,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:09,884 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:09,885 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 174 treesize of output 144 [2020-07-20 03:39:09,887 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:10,015 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 45 [2020-07-20 03:39:10,016 INFO L624 ElimStorePlain]: treesize reduction 134, result has 42.7 percent of original size [2020-07-20 03:39:10,017 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 03:39:10,018 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:457, output treesize:97 [2020-07-20 03:39:10,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:10,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:10,210 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 19 [2020-07-20 03:39:10,211 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:10,238 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:10,239 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 03:39:10,239 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:135, output treesize:72 [2020-07-20 03:39:10,324 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:10,325 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 69 treesize of output 82 [2020-07-20 03:39:10,327 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 03:39:10,328 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-20 03:39:10,329 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 03:39:10,330 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 03:39:10,331 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 03:39:10,332 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 03:39:10,336 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 03:39:10,336 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 03:39:10,337 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-20 03:39:10,338 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 03:39:10,339 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 03:39:10,341 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-20 03:39:10,342 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-20 03:39:10,342 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 03:39:10,343 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 03:39:10,343 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 03:39:10,344 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 03:39:10,345 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 03:39:10,346 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 03:39:10,346 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 03:39:10,347 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 03:39:10,348 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 03:39:10,348 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 03:39:10,349 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 03:39:10,349 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 03:39:10,350 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 03:39:10,351 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-20 03:39:10,352 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:10,359 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:10,360 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 03:39:10,360 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:4 [2020-07-20 03:39:10,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:39:10,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:39:10,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-20 03:39:10,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128802687] [2020-07-20 03:39:10,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-20 03:39:10,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:39:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-20 03:39:10,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-07-20 03:39:10,383 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 16 states. [2020-07-20 03:39:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:39:12,017 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2020-07-20 03:39:12,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 03:39:12,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2020-07-20 03:39:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:39:12,019 INFO L225 Difference]: With dead ends: 109 [2020-07-20 03:39:12,019 INFO L226 Difference]: Without dead ends: 107 [2020-07-20 03:39:12,020 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2020-07-20 03:39:12,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-07-20 03:39:12,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2020-07-20 03:39:12,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-07-20 03:39:12,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2020-07-20 03:39:12,030 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 32 [2020-07-20 03:39:12,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:39:12,030 INFO L479 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2020-07-20 03:39:12,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-20 03:39:12,030 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2020-07-20 03:39:12,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-20 03:39:12,032 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:12,032 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:39:12,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-20 03:39:12,243 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:12,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:12,244 INFO L82 PathProgramCache]: Analyzing trace with hash -243600310, now seen corresponding path program 1 times [2020-07-20 03:39:12,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:12,245 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300349750] [2020-07-20 03:39:12,245 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:39:12,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300349750] [2020-07-20 03:39:12,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823546179] [2020-07-20 03:39:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5be9c038 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:39:12,900 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@5be9c038 issued 3 check-sat command(s) [2020-07-20 03:39:12,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:39:12,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 33 conjunts are in the unsatisfiable core [2020-07-20 03:39:12,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:39:12,924 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-20 03:39:12,924 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 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-20 03:39:12,925 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:12,941 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:12,942 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 03:39:12,942 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:20 [2020-07-20 03:39:12,971 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:12,972 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-20 03:39:12,973 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 03:39:12,973 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:13,003 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:13,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:13,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:13,037 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:13,038 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2020-07-20 03:39:13,038 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:13,085 INFO L624 ElimStorePlain]: treesize reduction 24, result has 83.2 percent of original size [2020-07-20 03:39:13,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:13,100 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:13,101 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-20 03:39:13,102 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:13,141 INFO L624 ElimStorePlain]: treesize reduction 16, result has 76.8 percent of original size [2020-07-20 03:39:13,142 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 03:39:13,142 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:191, output treesize:55 [2020-07-20 03:39:13,197 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 4=[|v_#memory_$Pointer$.base_36|], 6=[|v_#memory_$Pointer$.offset_34|]} [2020-07-20 03:39:13,203 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-07-20 03:39:13,204 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:13,223 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:13,255 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:13,255 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 112 [2020-07-20 03:39:13,259 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-07-20 03:39:13,260 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-20 03:39:13,262 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:13,302 INFO L624 ElimStorePlain]: treesize reduction 56, result has 60.8 percent of original size [2020-07-20 03:39:13,308 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2020-07-20 03:39:13,309 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:13,319 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:13,320 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 03:39:13,320 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:122, output treesize:60 [2020-07-20 03:39:13,424 INFO L440 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 4=[|#memory_$Pointer$.offset|]} [2020-07-20 03:39:13,439 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:13,439 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 47 [2020-07-20 03:39:13,440 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:13,452 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:13,455 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 29 treesize of output 13 [2020-07-20 03:39:13,456 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:13,462 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:13,463 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-20 03:39:13,463 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:74, output treesize:11 [2020-07-20 03:39:13,507 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-20 03:39:13,507 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:13,510 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:13,510 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 03:39:13,510 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-07-20 03:39:13,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:39:13,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:39:13,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2020-07-20 03:39:13,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767733590] [2020-07-20 03:39:13,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-20 03:39:13,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:39:13,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-20 03:39:13,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2020-07-20 03:39:13,540 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 18 states. [2020-07-20 03:39:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:39:14,647 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2020-07-20 03:39:14,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-20 03:39:14,647 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2020-07-20 03:39:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:39:14,650 INFO L225 Difference]: With dead ends: 120 [2020-07-20 03:39:14,650 INFO L226 Difference]: Without dead ends: 108 [2020-07-20 03:39:14,651 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2020-07-20 03:39:14,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-07-20 03:39:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 82. [2020-07-20 03:39:14,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-07-20 03:39:14,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2020-07-20 03:39:14,661 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 32 [2020-07-20 03:39:14,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:39:14,661 INFO L479 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2020-07-20 03:39:14,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-20 03:39:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2020-07-20 03:39:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-20 03:39:14,663 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:14,663 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:39:14,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:39:14,873 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:14,874 INFO L82 PathProgramCache]: Analyzing trace with hash 145286649, now seen corresponding path program 2 times [2020-07-20 03:39:14,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:14,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266756264] [2020-07-20 03:39:14,875 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:15,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-20 03:39:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:39:15,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266756264] [2020-07-20 03:39:15,181 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464081031] [2020-07-20 03:39:15,182 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@50cdcf18 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-20 03:39:16,088 INFO L228 tOrderPrioritization]: Assert order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@50cdcf18 issued 3 check-sat command(s) [2020-07-20 03:39:16,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-20 03:39:16,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 53 conjunts are in the unsatisfiable core [2020-07-20 03:39:16,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-20 03:39:16,106 INFO L350 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2020-07-20 03:39:16,107 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 1 case distinctions, treesize of input 9 treesize of output 11 [2020-07-20 03:39:16,107 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:16,117 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:16,118 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 03:39:16,118 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2020-07-20 03:39:16,185 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:16,185 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-07-20 03:39:16,186 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:16,258 INFO L624 ElimStorePlain]: treesize reduction 14, result has 93.5 percent of original size [2020-07-20 03:39:16,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:16,268 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-20 03:39:16,277 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:16,278 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-20 03:39:16,278 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:16,339 INFO L624 ElimStorePlain]: treesize reduction 16, result has 89.4 percent of original size [2020-07-20 03:39:16,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:16,357 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:16,358 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 41 [2020-07-20 03:39:16,358 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:16,416 INFO L624 ElimStorePlain]: treesize reduction 16, result has 81.2 percent of original size [2020-07-20 03:39:16,416 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 03:39:16,417 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:203, output treesize:82 [2020-07-20 03:39:16,544 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:16,544 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-07-20 03:39:16,545 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:16,695 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-07-20 03:39:16,696 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:16,698 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_45|], 6=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_37|], 11=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_35|]} [2020-07-20 03:39:16,717 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 165 treesize of output 109 [2020-07-20 03:39:16,718 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:16,927 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-07-20 03:39:16,928 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:16,939 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:16,940 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1033 treesize of output 625 [2020-07-20 03:39:16,942 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:17,272 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2020-07-20 03:39:17,273 INFO L624 ElimStorePlain]: treesize reduction 24, result has 97.7 percent of original size [2020-07-20 03:39:17,298 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 39 [2020-07-20 03:39:17,299 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:17,451 WARN L193 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2020-07-20 03:39:17,452 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:17,654 WARN L193 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 67 [2020-07-20 03:39:17,655 INFO L350 Elim1Store]: treesize reduction 151, result has 60.6 percent of original size [2020-07-20 03:39:17,655 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 521 treesize of output 527 [2020-07-20 03:39:17,658 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 1] term [2020-07-20 03:39:17,658 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-20 03:39:17,660 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[16, 3, 2, 1] term [2020-07-20 03:39:17,660 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 15 disjuncts [2020-07-20 03:39:17,662 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:17,841 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 50 [2020-07-20 03:39:17,843 INFO L624 ElimStorePlain]: treesize reduction 891, result has 26.9 percent of original size [2020-07-20 03:39:17,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:17,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:17,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-20 03:39:17,852 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 60 [2020-07-20 03:39:17,853 INFO L544 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:17,883 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:17,884 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 03:39:17,884 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:1110, output treesize:120 [2020-07-20 03:39:18,071 INFO L440 ElimStorePlain]: Different costs {10=[|#memory_$Pointer$.base|], 14=[|#memory_$Pointer$.offset|]} [2020-07-20 03:39:18,137 INFO L350 Elim1Store]: treesize reduction 8, result has 71.4 percent of original size [2020-07-20 03:39:18,138 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 140 treesize of output 85 [2020-07-20 03:39:18,140 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 03:39:18,141 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 03:39:18,142 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 03:39:18,143 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-20 03:39:18,145 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-20 03:39:18,190 INFO L624 ElimStorePlain]: treesize reduction 8, result has 89.2 percent of original size [2020-07-20 03:39:18,203 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:18,204 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2020-07-20 03:39:18,205 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:18,213 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:18,214 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-20 03:39:18,215 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:147, output treesize:11 [2020-07-20 03:39:18,247 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-20 03:39:18,247 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-20 03:39:18,248 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-20 03:39:18,249 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-20 03:39:18,249 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-07-20 03:39:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-20 03:39:18,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-20 03:39:18,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2020-07-20 03:39:18,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276403179] [2020-07-20 03:39:18,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-20 03:39:18,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL_SMT_AM [2020-07-20 03:39:18,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-20 03:39:18,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2020-07-20 03:39:18,293 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 21 states. [2020-07-20 03:39:21,613 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2020-07-20 03:39:21,792 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2020-07-20 03:39:21,970 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 78 [2020-07-20 03:39:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-20 03:39:22,336 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2020-07-20 03:39:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-20 03:39:22,338 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 35 [2020-07-20 03:39:22,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-20 03:39:22,339 INFO L225 Difference]: With dead ends: 141 [2020-07-20 03:39:22,339 INFO L226 Difference]: Without dead ends: 129 [2020-07-20 03:39:22,342 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2020-07-20 03:39:22,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-07-20 03:39:22,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 103. [2020-07-20 03:39:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-20 03:39:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2020-07-20 03:39:22,369 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 35 [2020-07-20 03:39:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-20 03:39:22,370 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2020-07-20 03:39:22,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-20 03:39:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2020-07-20 03:39:22,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-20 03:39:22,377 INFO L414 BasicCegarLoop]: Found error trace [2020-07-20 03:39:22,378 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-20 03:39:22,578 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2020-07-20 03:39:22,579 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-20 03:39:22,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-20 03:39:22,579 INFO L82 PathProgramCache]: Analyzing trace with hash -969799515, now seen corresponding path program 1 times [2020-07-20 03:39:22,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL_SMT_AM [2020-07-20 03:39:22,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743409024] [2020-07-20 03:39:22,580 INFO L95 rtionOrderModulation]: Keeping assertion order de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.tracecheck.ITraceCheckPreferences$AssertCodeBlockOrder@4b600fdd [2020-07-20 03:39:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 03:39:22,636 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 03:39:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-20 03:39:22,678 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-20 03:39:22,736 INFO L174 FreeRefinementEngine]: Strategy CAMEL_SMT_AM found a feasible trace [2020-07-20 03:39:22,736 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-20 03:39:22,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-20 03:39:22,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 03:39:22 BoogieIcfgContainer [2020-07-20 03:39:22,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-20 03:39:22,819 INFO L168 Benchmark]: Toolchain (without parser) took 23386.52 ms. Allocated memory was 138.4 MB in the beginning and 357.6 MB in the end (delta: 219.2 MB). Free memory was 101.9 MB in the beginning and 302.1 MB in the end (delta: -200.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2020-07-20 03:39:22,820 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-20 03:39:22,820 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.00 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.5 MB in the beginning and 170.0 MB in the end (delta: -68.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2020-07-20 03:39:22,821 INFO L168 Benchmark]: Boogie Preprocessor took 68.98 ms. Allocated memory is still 202.9 MB. Free memory was 170.0 MB in the beginning and 166.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-07-20 03:39:22,821 INFO L168 Benchmark]: RCFGBuilder took 723.25 ms. Allocated memory is still 202.9 MB. Free memory was 166.6 MB in the beginning and 114.7 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 7.1 GB. [2020-07-20 03:39:22,822 INFO L168 Benchmark]: TraceAbstraction took 21958.30 ms. Allocated memory was 202.9 MB in the beginning and 357.6 MB in the end (delta: 154.7 MB). Free memory was 114.0 MB in the beginning and 302.1 MB in the end (delta: -188.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-20 03:39:22,823 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.24 ms. Allocated memory is still 138.4 MB. Free memory was 121.5 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 630.00 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.5 MB in the beginning and 170.0 MB in the end (delta: -68.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.98 ms. Allocated memory is still 202.9 MB. Free memory was 170.0 MB in the beginning and 166.6 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 723.25 ms. Allocated memory is still 202.9 MB. Free memory was 166.6 MB in the beginning and 114.7 MB in the end (delta: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21958.30 ms. Allocated memory was 202.9 MB in the beginning and 357.6 MB in the end (delta: 154.7 MB). Free memory was 114.0 MB in the beginning and 302.1 MB in the end (delta: -188.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1038]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L987] struct TSLL* null = malloc(sizeof(struct TSLL)); [L988] null->next = ((void*)0) [L989] null->prev = ((void*)0) [L990] null->colour = BLACK [L992] struct TSLL* list = malloc(sizeof(struct TSLL)); [L993] list->next = null [L994] list->prev = null [L995] list->colour = BLACK [L997] struct TSLL* end = list; VAL [end={-1:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] [L1000] COND TRUE __VERIFIER_nondet_int() [L1003] end->next = malloc(sizeof(struct TSLL)) [L1004] EXPR end->next [L1004] end->next->prev = end [L1005] EXPR end->next [L1005] end = end->next [L1006] end->next = null [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1014] end->colour = RED [L1015] end->next = malloc(sizeof(struct TSLL)) [L1016] EXPR end->next [L1016] end->next->prev = end [L1017] EXPR end->next [L1017] end = end->next [L1018] end->next = null [L1019] end->colour = BLACK VAL [end={-4:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] [L1021] EXPR end->colour VAL [end={-4:0}, end->colour=1, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] [L1021] COND FALSE !(!(BLACK == end->colour)) [L1022] EXPR end->next VAL [end={-4:0}, end->next={-2:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] [L1022] COND FALSE !(!(null == end->next)) [L1023] COND FALSE !(!(null != end)) VAL [end={-4:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1026] end = null [L1027] end = list VAL [end={-1:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] [L1030] COND FALSE !(!(null != end)) VAL [end={-1:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] [L1031] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] [L1031] COND FALSE !(!(BLACK == end->colour)) [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] [L1034] COND FALSE !(RED == end->colour) [L1041] EXPR end->next [L1041] end = end->next [L1032] COND TRUE null != end [L1034] EXPR end->colour VAL [end={-3:0}, end->colour=0, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] [L1034] COND TRUE RED == end->colour [L1036] EXPR end->next [L1036] end = end->next [L1037] COND FALSE !(!(null != end)) VAL [end={-4:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] [L1038] EXPR end->colour VAL [end={-4:0}, end->colour=1, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] [L1038] COND TRUE !(BLACK != end->colour) [L1038] __VERIFIER_error() VAL [end={-4:0}, list={-1:0}, malloc(sizeof(struct TSLL))={-4:0}, malloc(sizeof(struct TSLL))={-3:0}, malloc(sizeof(struct TSLL))={-1:0}, malloc(sizeof(struct TSLL))={-2:0}, null={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 52 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.8s, OverallIterations: 13, TraceHistogramMax: 3, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 404 SDtfs, 696 SDslu, 1624 SDs, 0 SdLazy, 2143 SolverSat, 172 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 283 GetRequests, 147 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 141 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 422 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 370 ConstructedInterpolants, 31 QuantifiedInterpolants, 295460 SizeOfPredicates, 72 NumberOfNonLiveVariables, 633 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 2/42 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! Received shutdown request...