/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.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.smt.solver Internal_SMTInterpol --traceabstraction.compute.trace.for.counterexample.result false --traceabstraction.use.minimal.unsat.core.enumeration true --traceabstraction.additional.smt.options enumeration-timeout=5 --traceabstraction.additional.smt.options interpolation-heuristic=WIDESTAMONGSMALL --traceabstraction.additional.smt.options tolerance=0.4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-5644d1e-m [2020-08-19 00:29:39,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-19 00:29:39,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-19 00:29:39,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-19 00:29:39,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-19 00:29:39,335 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-19 00:29:39,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-19 00:29:39,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-19 00:29:39,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-19 00:29:39,342 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-19 00:29:39,343 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-19 00:29:39,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-19 00:29:39,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-19 00:29:39,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-19 00:29:39,352 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-19 00:29:39,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-19 00:29:39,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-19 00:29:39,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-19 00:29:39,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-19 00:29:39,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-19 00:29:39,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-19 00:29:39,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-19 00:29:39,370 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-19 00:29:39,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-19 00:29:39,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-19 00:29:39,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-19 00:29:39,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-19 00:29:39,378 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-19 00:29:39,378 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-19 00:29:39,379 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-19 00:29:39,379 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-19 00:29:39,380 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-19 00:29:39,381 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-19 00:29:39,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-19 00:29:39,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-19 00:29:39,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-19 00:29:39,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-19 00:29:39,384 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-19 00:29:39,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-19 00:29:39,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-19 00:29:39,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-19 00:29:39,387 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-08-19 00:29:39,408 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-19 00:29:39,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-19 00:29:39,409 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-08-19 00:29:39,410 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-08-19 00:29:39,410 INFO L138 SettingsManager]: * Use SBE=true [2020-08-19 00:29:39,410 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-19 00:29:39,410 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-19 00:29:39,410 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-19 00:29:39,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-19 00:29:39,411 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-19 00:29:39,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-19 00:29:39,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-19 00:29:39,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-19 00:29:39,412 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-19 00:29:39,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-19 00:29:39,412 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-19 00:29:39,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-19 00:29:39,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-19 00:29:39,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-08-19 00:29:39,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-19 00:29:39,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-19 00:29:39,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-19 00:29:39,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-19 00:29:39,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-08-19 00:29:39,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-08-19 00:29:39,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-08-19 00:29:39,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-08-19 00:29:39,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-19 00:29:39,415 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-08-19 00:29:39,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> Internal_SMTInterpol Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute trace for counterexample result -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use minimal unsat core enumeration -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4; Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional SMT options -> enumeration-timeout=5;interpolation-heuristic=WIDESTAMONGSMALL;tolerance=0.4; [2020-08-19 00:29:39,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-19 00:29:39,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-19 00:29:39,715 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-19 00:29:39,716 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-19 00:29:39,717 INFO L275 PluginConnector]: CDTParser initialized [2020-08-19 00:29:39,717 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-08-19 00:29:39,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6bbc81d80/a8945588e43b4ffc97c441dc03b1077f/FLAG697556957 [2020-08-19 00:29:40,254 INFO L306 CDTParser]: Found 1 translation units. [2020-08-19 00:29:40,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/systemc/transmitter.02.cil.c [2020-08-19 00:29:40,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6bbc81d80/a8945588e43b4ffc97c441dc03b1077f/FLAG697556957 [2020-08-19 00:29:40,625 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/6bbc81d80/a8945588e43b4ffc97c441dc03b1077f [2020-08-19 00:29:40,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-19 00:29:40,634 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-19 00:29:40,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-19 00:29:40,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-19 00:29:40,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-19 00:29:40,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 12:29:40" (1/1) ... [2020-08-19 00:29:40,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d198e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:29:40, skipping insertion in model container [2020-08-19 00:29:40,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.08 12:29:40" (1/1) ... [2020-08-19 00:29:40,648 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-19 00:29:40,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-19 00:29:40,912 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 00:29:40,918 INFO L203 MainTranslator]: Completed pre-run [2020-08-19 00:29:40,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-19 00:29:41,086 INFO L208 MainTranslator]: Completed translation [2020-08-19 00:29:41,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:29:41 WrapperNode [2020-08-19 00:29:41,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-19 00:29:41,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-19 00:29:41,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-19 00:29:41,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-19 00:29:41,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:29:41" (1/1) ... [2020-08-19 00:29:41,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:29:41" (1/1) ... [2020-08-19 00:29:41,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:29:41" (1/1) ... [2020-08-19 00:29:41,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:29:41" (1/1) ... [2020-08-19 00:29:41,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:29:41" (1/1) ... [2020-08-19 00:29:41,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:29:41" (1/1) ... [2020-08-19 00:29:41,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:29:41" (1/1) ... [2020-08-19 00:29:41,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-19 00:29:41,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-19 00:29:41,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-19 00:29:41,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-19 00:29:41,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:29:41" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-08-19 00:29:41,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-19 00:29:41,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-19 00:29:41,209 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2020-08-19 00:29:41,209 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2020-08-19 00:29:41,209 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2020-08-19 00:29:41,209 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2020-08-19 00:29:41,210 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2020-08-19 00:29:41,210 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2020-08-19 00:29:41,210 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2020-08-19 00:29:41,210 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2020-08-19 00:29:41,210 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2020-08-19 00:29:41,210 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2020-08-19 00:29:41,211 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2020-08-19 00:29:41,211 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2020-08-19 00:29:41,211 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2020-08-19 00:29:41,211 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2020-08-19 00:29:41,211 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2020-08-19 00:29:41,211 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2020-08-19 00:29:41,212 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2020-08-19 00:29:41,212 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2020-08-19 00:29:41,212 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2020-08-19 00:29:41,212 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2020-08-19 00:29:41,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-19 00:29:41,212 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-19 00:29:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-19 00:29:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure error [2020-08-19 00:29:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2020-08-19 00:29:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2020-08-19 00:29:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2020-08-19 00:29:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2020-08-19 00:29:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure master [2020-08-19 00:29:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2020-08-19 00:29:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2020-08-19 00:29:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2020-08-19 00:29:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2020-08-19 00:29:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2020-08-19 00:29:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2020-08-19 00:29:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2020-08-19 00:29:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2020-08-19 00:29:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2020-08-19 00:29:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2020-08-19 00:29:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2020-08-19 00:29:41,215 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2020-08-19 00:29:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2020-08-19 00:29:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2020-08-19 00:29:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-19 00:29:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-19 00:29:41,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-19 00:29:41,720 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-19 00:29:41,720 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-08-19 00:29:41,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 12:29:41 BoogieIcfgContainer [2020-08-19 00:29:41,727 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-19 00:29:41,728 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-19 00:29:41,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-19 00:29:41,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-19 00:29:41,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.08 12:29:40" (1/3) ... [2020-08-19 00:29:41,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9c7c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 12:29:41, skipping insertion in model container [2020-08-19 00:29:41,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.08 12:29:41" (2/3) ... [2020-08-19 00:29:41,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e9c7c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.08 12:29:41, skipping insertion in model container [2020-08-19 00:29:41,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.08 12:29:41" (3/3) ... [2020-08-19 00:29:41,736 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2020-08-19 00:29:41,748 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-19 00:29:41,761 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-19 00:29:41,775 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-19 00:29:41,816 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-19 00:29:41,816 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-19 00:29:41,817 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-19 00:29:41,817 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-19 00:29:41,817 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-19 00:29:41,818 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-19 00:29:41,818 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-19 00:29:41,819 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-19 00:29:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2020-08-19 00:29:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-19 00:29:41,868 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:29:41,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:29:41,870 INFO L427 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:29:41,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:29:41,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1996614335, now seen corresponding path program 1 times [2020-08-19 00:29:41,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:29:41,882 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [286681520] [2020-08-19 00:29:41,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:29:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:42,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:29:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:42,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:29:42,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:42,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:29:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:42,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:29:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:42,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:29:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:42,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:29:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:42,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:29:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:42,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:29:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:42,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:29:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:42,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:29:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:42,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:29:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 00:29:42,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [286681520] [2020-08-19 00:29:42,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:29:42,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-19 00:29:42,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653981004] [2020-08-19 00:29:42,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 00:29:42,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:29:42,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 00:29:42,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-08-19 00:29:42,425 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 8 states. [2020-08-19 00:29:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:29:44,016 INFO L93 Difference]: Finished difference Result 412 states and 626 transitions. [2020-08-19 00:29:44,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 00:29:44,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 90 [2020-08-19 00:29:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:29:44,036 INFO L225 Difference]: With dead ends: 412 [2020-08-19 00:29:44,036 INFO L226 Difference]: Without dead ends: 247 [2020-08-19 00:29:44,042 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2020-08-19 00:29:44,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-08-19 00:29:44,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 160. [2020-08-19 00:29:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-08-19 00:29:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 212 transitions. [2020-08-19 00:29:44,123 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 212 transitions. Word has length 90 [2020-08-19 00:29:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:29:44,124 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 212 transitions. [2020-08-19 00:29:44,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 00:29:44,124 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 212 transitions. [2020-08-19 00:29:44,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-19 00:29:44,128 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:29:44,129 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:29:44,129 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-19 00:29:44,129 INFO L427 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:29:44,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:29:44,130 INFO L82 PathProgramCache]: Analyzing trace with hash -387310403, now seen corresponding path program 1 times [2020-08-19 00:29:44,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:29:44,130 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [182181003] [2020-08-19 00:29:44,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:29:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:44,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:29:44,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:44,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:29:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:44,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:29:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:44,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:29:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:44,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:29:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:44,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:29:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:44,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:29:44,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:44,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:29:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:44,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:29:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:44,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:29:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:44,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:29:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:44,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 00:29:44,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [182181003] [2020-08-19 00:29:44,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:29:44,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-19 00:29:44,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386753079] [2020-08-19 00:29:44,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 00:29:44,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:29:44,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 00:29:44,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-19 00:29:44,457 INFO L87 Difference]: Start difference. First operand 160 states and 212 transitions. Second operand 9 states. [2020-08-19 00:29:46,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:29:46,541 INFO L93 Difference]: Finished difference Result 579 states and 839 transitions. [2020-08-19 00:29:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-19 00:29:46,542 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 90 [2020-08-19 00:29:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:29:46,560 INFO L225 Difference]: With dead ends: 579 [2020-08-19 00:29:46,561 INFO L226 Difference]: Without dead ends: 439 [2020-08-19 00:29:46,569 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2020-08-19 00:29:46,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-08-19 00:29:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 294. [2020-08-19 00:29:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-08-19 00:29:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 393 transitions. [2020-08-19 00:29:46,689 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 393 transitions. Word has length 90 [2020-08-19 00:29:46,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:29:46,690 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 393 transitions. [2020-08-19 00:29:46,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 00:29:46,690 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 393 transitions. [2020-08-19 00:29:46,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-19 00:29:46,700 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:29:46,701 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:29:46,701 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-19 00:29:46,701 INFO L427 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:29:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:29:46,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1952833149, now seen corresponding path program 1 times [2020-08-19 00:29:46,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:29:46,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [155613570] [2020-08-19 00:29:46,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:29:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:46,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:29:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:46,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:29:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:46,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:29:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:46,836 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:29:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:46,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:29:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:46,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:29:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:46,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:29:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:46,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:29:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:46,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:29:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:46,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:29:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:46,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:29:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:46,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 00:29:46,914 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [155613570] [2020-08-19 00:29:46,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:29:46,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-19 00:29:46,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974163477] [2020-08-19 00:29:46,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:29:46,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:29:46,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:29:46,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:29:46,916 INFO L87 Difference]: Start difference. First operand 294 states and 393 transitions. Second operand 10 states. [2020-08-19 00:29:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:29:48,043 INFO L93 Difference]: Finished difference Result 704 states and 993 transitions. [2020-08-19 00:29:48,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 00:29:48,044 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-08-19 00:29:48,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:29:48,048 INFO L225 Difference]: With dead ends: 704 [2020-08-19 00:29:48,049 INFO L226 Difference]: Without dead ends: 430 [2020-08-19 00:29:48,050 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-08-19 00:29:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2020-08-19 00:29:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 294. [2020-08-19 00:29:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-08-19 00:29:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 386 transitions. [2020-08-19 00:29:48,087 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 386 transitions. Word has length 90 [2020-08-19 00:29:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:29:48,088 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 386 transitions. [2020-08-19 00:29:48,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:29:48,088 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 386 transitions. [2020-08-19 00:29:48,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-19 00:29:48,089 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:29:48,090 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:29:48,090 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-19 00:29:48,090 INFO L427 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:29:48,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:29:48,091 INFO L82 PathProgramCache]: Analyzing trace with hash 227206333, now seen corresponding path program 1 times [2020-08-19 00:29:48,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:29:48,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [689596148] [2020-08-19 00:29:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:29:48,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:48,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:29:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:48,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:29:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:48,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:29:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:48,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:29:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:48,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:29:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:48,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:29:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:48,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:29:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:48,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:29:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:48,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:29:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:48,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:29:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:48,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:29:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 00:29:48,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [689596148] [2020-08-19 00:29:48,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:29:48,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-19 00:29:48,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940238790] [2020-08-19 00:29:48,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:29:48,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:29:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:29:48,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:29:48,313 INFO L87 Difference]: Start difference. First operand 294 states and 386 transitions. Second operand 10 states. [2020-08-19 00:29:49,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:29:49,453 INFO L93 Difference]: Finished difference Result 700 states and 971 transitions. [2020-08-19 00:29:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-08-19 00:29:49,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-08-19 00:29:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:29:49,462 INFO L225 Difference]: With dead ends: 700 [2020-08-19 00:29:49,462 INFO L226 Difference]: Without dead ends: 426 [2020-08-19 00:29:49,463 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2020-08-19 00:29:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2020-08-19 00:29:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 294. [2020-08-19 00:29:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-08-19 00:29:49,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 379 transitions. [2020-08-19 00:29:49,515 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 379 transitions. Word has length 90 [2020-08-19 00:29:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:29:49,515 INFO L479 AbstractCegarLoop]: Abstraction has 294 states and 379 transitions. [2020-08-19 00:29:49,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:29:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 379 transitions. [2020-08-19 00:29:49,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-19 00:29:49,518 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:29:49,518 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:29:49,518 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-19 00:29:49,519 INFO L427 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:29:49,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:29:49,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1418466941, now seen corresponding path program 1 times [2020-08-19 00:29:49,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:29:49,520 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [645756060] [2020-08-19 00:29:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:29:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:49,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:29:49,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:49,601 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:29:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:49,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:29:49,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:49,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:29:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:49,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:29:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:49,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:29:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:49,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:29:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:49,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:29:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:49,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:29:49,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:49,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:29:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:49,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:29:49,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 00:29:49,684 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [645756060] [2020-08-19 00:29:49,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:29:49,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-19 00:29:49,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900901542] [2020-08-19 00:29:49,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:29:49,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:29:49,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:29:49,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:29:49,686 INFO L87 Difference]: Start difference. First operand 294 states and 379 transitions. Second operand 10 states. [2020-08-19 00:29:51,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:29:51,353 INFO L93 Difference]: Finished difference Result 855 states and 1230 transitions. [2020-08-19 00:29:51,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-19 00:29:51,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-08-19 00:29:51,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:29:51,360 INFO L225 Difference]: With dead ends: 855 [2020-08-19 00:29:51,360 INFO L226 Difference]: Without dead ends: 581 [2020-08-19 00:29:51,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-08-19 00:29:51,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2020-08-19 00:29:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 366. [2020-08-19 00:29:51,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2020-08-19 00:29:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 457 transitions. [2020-08-19 00:29:51,425 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 457 transitions. Word has length 90 [2020-08-19 00:29:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:29:51,426 INFO L479 AbstractCegarLoop]: Abstraction has 366 states and 457 transitions. [2020-08-19 00:29:51,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:29:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 457 transitions. [2020-08-19 00:29:51,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-19 00:29:51,427 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:29:51,427 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:29:51,427 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-19 00:29:51,428 INFO L427 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:29:51,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:29:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1504622653, now seen corresponding path program 1 times [2020-08-19 00:29:51,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:29:51,429 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2108036537] [2020-08-19 00:29:51,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:29:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:51,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:29:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:51,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:29:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:51,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:29:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:51,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:29:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:51,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:29:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:51,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:29:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:51,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:29:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:51,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:29:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:51,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:29:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:51,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:29:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:51,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:29:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 00:29:51,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2108036537] [2020-08-19 00:29:51,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:29:51,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-19 00:29:51,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971512424] [2020-08-19 00:29:51,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:29:51,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:29:51,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:29:51,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:29:51,653 INFO L87 Difference]: Start difference. First operand 366 states and 457 transitions. Second operand 10 states. [2020-08-19 00:29:53,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:29:53,299 INFO L93 Difference]: Finished difference Result 877 states and 1164 transitions. [2020-08-19 00:29:53,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 00:29:53,299 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-08-19 00:29:53,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:29:53,304 INFO L225 Difference]: With dead ends: 877 [2020-08-19 00:29:53,304 INFO L226 Difference]: Without dead ends: 532 [2020-08-19 00:29:53,306 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-08-19 00:29:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2020-08-19 00:29:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 376. [2020-08-19 00:29:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2020-08-19 00:29:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 465 transitions. [2020-08-19 00:29:53,348 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 465 transitions. Word has length 90 [2020-08-19 00:29:53,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:29:53,349 INFO L479 AbstractCegarLoop]: Abstraction has 376 states and 465 transitions. [2020-08-19 00:29:53,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:29:53,349 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 465 transitions. [2020-08-19 00:29:53,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-19 00:29:53,350 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:29:53,350 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:29:53,351 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-19 00:29:53,351 INFO L427 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:29:53,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:29:53,351 INFO L82 PathProgramCache]: Analyzing trace with hash -523963457, now seen corresponding path program 1 times [2020-08-19 00:29:53,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:29:53,352 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [507041988] [2020-08-19 00:29:53,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:29:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:53,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:29:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:53,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:29:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:53,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:29:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:53,427 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:29:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:53,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:29:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:53,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:29:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:53,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:29:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:53,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:29:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:53,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:29:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:53,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:29:53,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:53,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:29:53,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 00:29:53,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [507041988] [2020-08-19 00:29:53,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:29:53,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-19 00:29:53,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144195130] [2020-08-19 00:29:53,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:29:53,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:29:53,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:29:53,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:29:53,541 INFO L87 Difference]: Start difference. First operand 376 states and 465 transitions. Second operand 10 states. [2020-08-19 00:29:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:29:55,166 INFO L93 Difference]: Finished difference Result 915 states and 1208 transitions. [2020-08-19 00:29:55,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-19 00:29:55,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-08-19 00:29:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:29:55,171 INFO L225 Difference]: With dead ends: 915 [2020-08-19 00:29:55,171 INFO L226 Difference]: Without dead ends: 560 [2020-08-19 00:29:55,174 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-08-19 00:29:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2020-08-19 00:29:55,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 396. [2020-08-19 00:29:55,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2020-08-19 00:29:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 485 transitions. [2020-08-19 00:29:55,216 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 485 transitions. Word has length 90 [2020-08-19 00:29:55,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:29:55,217 INFO L479 AbstractCegarLoop]: Abstraction has 396 states and 485 transitions. [2020-08-19 00:29:55,217 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:29:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 485 transitions. [2020-08-19 00:29:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-19 00:29:55,218 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:29:55,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:29:55,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-19 00:29:55,219 INFO L427 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:29:55,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:29:55,219 INFO L82 PathProgramCache]: Analyzing trace with hash -275816963, now seen corresponding path program 1 times [2020-08-19 00:29:55,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:29:55,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [559309569] [2020-08-19 00:29:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:29:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:55,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:29:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:55,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:29:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:55,297 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:29:55,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:55,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:29:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:55,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:29:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:55,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:29:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:55,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:29:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:55,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:29:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:55,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:29:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:55,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:29:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:55,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:29:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 00:29:55,441 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [559309569] [2020-08-19 00:29:55,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:29:55,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-19 00:29:55,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426628911] [2020-08-19 00:29:55,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:29:55,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:29:55,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:29:55,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:29:55,443 INFO L87 Difference]: Start difference. First operand 396 states and 485 transitions. Second operand 10 states. [2020-08-19 00:29:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:29:57,259 INFO L93 Difference]: Finished difference Result 939 states and 1222 transitions. [2020-08-19 00:29:57,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-19 00:29:57,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-08-19 00:29:57,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:29:57,265 INFO L225 Difference]: With dead ends: 939 [2020-08-19 00:29:57,265 INFO L226 Difference]: Without dead ends: 564 [2020-08-19 00:29:57,267 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2020-08-19 00:29:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2020-08-19 00:29:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 406. [2020-08-19 00:29:57,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2020-08-19 00:29:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 493 transitions. [2020-08-19 00:29:57,302 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 493 transitions. Word has length 90 [2020-08-19 00:29:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:29:57,303 INFO L479 AbstractCegarLoop]: Abstraction has 406 states and 493 transitions. [2020-08-19 00:29:57,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:29:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 493 transitions. [2020-08-19 00:29:57,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-19 00:29:57,304 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:29:57,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:29:57,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-19 00:29:57,305 INFO L427 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:29:57,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:29:57,305 INFO L82 PathProgramCache]: Analyzing trace with hash -348203521, now seen corresponding path program 1 times [2020-08-19 00:29:57,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:29:57,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1259617476] [2020-08-19 00:29:57,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:29:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:57,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:29:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:57,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:29:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:57,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:29:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:57,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:29:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:57,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:29:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:57,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:29:57,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:57,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:29:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:57,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:29:57,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:57,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:29:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:57,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:29:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:57,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:29:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:57,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 00:29:57,468 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1259617476] [2020-08-19 00:29:57,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:29:57,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-19 00:29:57,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132566804] [2020-08-19 00:29:57,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:29:57,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:29:57,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:29:57,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:29:57,476 INFO L87 Difference]: Start difference. First operand 406 states and 493 transitions. Second operand 10 states. [2020-08-19 00:29:59,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:29:59,307 INFO L93 Difference]: Finished difference Result 1144 states and 1493 transitions. [2020-08-19 00:29:59,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-08-19 00:29:59,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 90 [2020-08-19 00:29:59,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:29:59,313 INFO L225 Difference]: With dead ends: 1144 [2020-08-19 00:29:59,313 INFO L226 Difference]: Without dead ends: 758 [2020-08-19 00:29:59,316 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2020-08-19 00:29:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2020-08-19 00:29:59,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 467. [2020-08-19 00:29:59,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2020-08-19 00:29:59,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 547 transitions. [2020-08-19 00:29:59,369 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 547 transitions. Word has length 90 [2020-08-19 00:29:59,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:29:59,370 INFO L479 AbstractCegarLoop]: Abstraction has 467 states and 547 transitions. [2020-08-19 00:29:59,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:29:59,370 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 547 transitions. [2020-08-19 00:29:59,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-08-19 00:29:59,373 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:29:59,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:29:59,374 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-19 00:29:59,374 INFO L427 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:29:59,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:29:59,374 INFO L82 PathProgramCache]: Analyzing trace with hash -286163907, now seen corresponding path program 1 times [2020-08-19 00:29:59,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:29:59,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1269704987] [2020-08-19 00:29:59,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:29:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:59,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:29:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:59,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:29:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:59,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:29:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:59,463 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:29:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:59,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:29:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:59,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:29:59,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:59,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:29:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:59,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:29:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:59,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:29:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:59,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:29:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:59,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:29:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:29:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 00:29:59,506 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1269704987] [2020-08-19 00:29:59,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:29:59,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-19 00:29:59,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001715666] [2020-08-19 00:29:59,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 00:29:59,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:29:59,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 00:29:59,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 00:29:59,507 INFO L87 Difference]: Start difference. First operand 467 states and 547 transitions. Second operand 7 states. [2020-08-19 00:30:01,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:30:01,196 INFO L93 Difference]: Finished difference Result 1503 states and 1877 transitions. [2020-08-19 00:30:01,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 00:30:01,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2020-08-19 00:30:01,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:30:01,206 INFO L225 Difference]: With dead ends: 1503 [2020-08-19 00:30:01,206 INFO L226 Difference]: Without dead ends: 1058 [2020-08-19 00:30:01,209 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-08-19 00:30:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2020-08-19 00:30:01,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 847. [2020-08-19 00:30:01,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2020-08-19 00:30:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1018 transitions. [2020-08-19 00:30:01,310 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1018 transitions. Word has length 90 [2020-08-19 00:30:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:30:01,311 INFO L479 AbstractCegarLoop]: Abstraction has 847 states and 1018 transitions. [2020-08-19 00:30:01,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 00:30:01,311 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1018 transitions. [2020-08-19 00:30:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-08-19 00:30:01,313 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:30:01,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:30:01,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-19 00:30:01,313 INFO L427 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:30:01,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:30:01,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1417763379, now seen corresponding path program 1 times [2020-08-19 00:30:01,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:30:01,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [630943227] [2020-08-19 00:30:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:30:01,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:01,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:30:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:01,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:30:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:01,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:30:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:01,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:30:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:01,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:30:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:01,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:30:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:01,430 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:30:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:01,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:30:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:01,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:30:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:01,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:30:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:01,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:30:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:01,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-19 00:30:01,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [630943227] [2020-08-19 00:30:01,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:30:01,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-19 00:30:01,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461811058] [2020-08-19 00:30:01,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-19 00:30:01,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:30:01,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-19 00:30:01,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-08-19 00:30:01,454 INFO L87 Difference]: Start difference. First operand 847 states and 1018 transitions. Second operand 7 states. [2020-08-19 00:30:03,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:30:03,194 INFO L93 Difference]: Finished difference Result 2813 states and 3701 transitions. [2020-08-19 00:30:03,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 00:30:03,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2020-08-19 00:30:03,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:30:03,207 INFO L225 Difference]: With dead ends: 2813 [2020-08-19 00:30:03,207 INFO L226 Difference]: Without dead ends: 1993 [2020-08-19 00:30:03,212 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-08-19 00:30:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2020-08-19 00:30:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1710. [2020-08-19 00:30:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2020-08-19 00:30:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2141 transitions. [2020-08-19 00:30:03,383 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2141 transitions. Word has length 91 [2020-08-19 00:30:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:30:03,383 INFO L479 AbstractCegarLoop]: Abstraction has 1710 states and 2141 transitions. [2020-08-19 00:30:03,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-19 00:30:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2141 transitions. [2020-08-19 00:30:03,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-08-19 00:30:03,386 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:30:03,387 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:30:03,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-19 00:30:03,387 INFO L427 AbstractCegarLoop]: === Iteration 12 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:30:03,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:30:03,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1387972843, now seen corresponding path program 1 times [2020-08-19 00:30:03,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:30:03,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [864525458] [2020-08-19 00:30:03,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:30:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:30:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:30:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:30:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:30:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:30:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:30:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:30:03,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:30:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:30:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:30:03,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:30:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-08-19 00:30:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-08-19 00:30:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-08-19 00:30:03,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [864525458] [2020-08-19 00:30:03,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:30:03,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-19 00:30:03,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522460195] [2020-08-19 00:30:03,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 00:30:03,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:30:03,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 00:30:03,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-19 00:30:03,555 INFO L87 Difference]: Start difference. First operand 1710 states and 2141 transitions. Second operand 9 states. [2020-08-19 00:30:05,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:30:05,072 INFO L93 Difference]: Finished difference Result 3845 states and 5084 transitions. [2020-08-19 00:30:05,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-19 00:30:05,073 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2020-08-19 00:30:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:30:05,087 INFO L225 Difference]: With dead ends: 3845 [2020-08-19 00:30:05,087 INFO L226 Difference]: Without dead ends: 2157 [2020-08-19 00:30:05,093 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2020-08-19 00:30:05,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2157 states. [2020-08-19 00:30:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2157 to 1767. [2020-08-19 00:30:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2020-08-19 00:30:05,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 2232 transitions. [2020-08-19 00:30:05,330 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 2232 transitions. Word has length 111 [2020-08-19 00:30:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:30:05,330 INFO L479 AbstractCegarLoop]: Abstraction has 1767 states and 2232 transitions. [2020-08-19 00:30:05,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 00:30:05,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 2232 transitions. [2020-08-19 00:30:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-08-19 00:30:05,333 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:30:05,334 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:30:05,334 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-08-19 00:30:05,335 INFO L427 AbstractCegarLoop]: === Iteration 13 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:30:05,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:30:05,335 INFO L82 PathProgramCache]: Analyzing trace with hash 36587625, now seen corresponding path program 1 times [2020-08-19 00:30:05,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:30:05,336 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1639427615] [2020-08-19 00:30:05,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:30:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:30:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:30:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:30:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:30:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:30:05,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:30:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:30:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:30:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:30:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:30:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:30:05,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-08-19 00:30:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-08-19 00:30:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-19 00:30:05,555 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1639427615] [2020-08-19 00:30:05,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:30:05,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-19 00:30:05,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670415353] [2020-08-19 00:30:05,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-19 00:30:05,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:30:05,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-19 00:30:05,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-08-19 00:30:05,557 INFO L87 Difference]: Start difference. First operand 1767 states and 2232 transitions. Second operand 8 states. [2020-08-19 00:30:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:30:07,766 INFO L93 Difference]: Finished difference Result 5835 states and 7942 transitions. [2020-08-19 00:30:07,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-08-19 00:30:07,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 111 [2020-08-19 00:30:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:30:07,786 INFO L225 Difference]: With dead ends: 5835 [2020-08-19 00:30:07,787 INFO L226 Difference]: Without dead ends: 3120 [2020-08-19 00:30:07,799 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2020-08-19 00:30:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2020-08-19 00:30:08,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 2788. [2020-08-19 00:30:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2788 states. [2020-08-19 00:30:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2788 states to 2788 states and 3646 transitions. [2020-08-19 00:30:08,192 INFO L78 Accepts]: Start accepts. Automaton has 2788 states and 3646 transitions. Word has length 111 [2020-08-19 00:30:08,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:30:08,193 INFO L479 AbstractCegarLoop]: Abstraction has 2788 states and 3646 transitions. [2020-08-19 00:30:08,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-19 00:30:08,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2788 states and 3646 transitions. [2020-08-19 00:30:08,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2020-08-19 00:30:08,198 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:30:08,198 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:30:08,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-08-19 00:30:08,199 INFO L427 AbstractCegarLoop]: === Iteration 14 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:30:08,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:30:08,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1178118941, now seen corresponding path program 1 times [2020-08-19 00:30:08,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:30:08,204 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2123163512] [2020-08-19 00:30:08,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:30:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:30:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,286 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:30:08,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:30:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:30:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:30:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:30:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:30:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:30:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:30:08,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:30:08,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:30:08,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2020-08-19 00:30:08,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-08-19 00:30:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-08-19 00:30:08,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:30:08,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:30:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:30:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:30:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:30:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2020-08-19 00:30:08,415 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2123163512] [2020-08-19 00:30:08,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:30:08,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-08-19 00:30:08,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279621686] [2020-08-19 00:30:08,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-19 00:30:08,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:30:08,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-19 00:30:08,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-08-19 00:30:08,417 INFO L87 Difference]: Start difference. First operand 2788 states and 3646 transitions. Second operand 9 states. [2020-08-19 00:30:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:30:11,171 INFO L93 Difference]: Finished difference Result 8089 states and 11637 transitions. [2020-08-19 00:30:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-19 00:30:11,172 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 155 [2020-08-19 00:30:11,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:30:11,216 INFO L225 Difference]: With dead ends: 8089 [2020-08-19 00:30:11,216 INFO L226 Difference]: Without dead ends: 5323 [2020-08-19 00:30:11,243 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2020-08-19 00:30:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2020-08-19 00:30:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 4852. [2020-08-19 00:30:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4852 states. [2020-08-19 00:30:12,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4852 states to 4852 states and 6633 transitions. [2020-08-19 00:30:12,119 INFO L78 Accepts]: Start accepts. Automaton has 4852 states and 6633 transitions. Word has length 155 [2020-08-19 00:30:12,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:30:12,120 INFO L479 AbstractCegarLoop]: Abstraction has 4852 states and 6633 transitions. [2020-08-19 00:30:12,121 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-19 00:30:12,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4852 states and 6633 transitions. [2020-08-19 00:30:12,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-08-19 00:30:12,129 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:30:12,130 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:30:12,130 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-08-19 00:30:12,131 INFO L427 AbstractCegarLoop]: === Iteration 15 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:30:12,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:30:12,131 INFO L82 PathProgramCache]: Analyzing trace with hash -390866386, now seen corresponding path program 1 times [2020-08-19 00:30:12,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:30:12,132 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [415731052] [2020-08-19 00:30:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:30:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:30:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:30:12,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:30:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:30:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:30:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:30:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:30:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:30:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:30:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:30:12,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:30:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2020-08-19 00:30:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2020-08-19 00:30:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2020-08-19 00:30:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:30:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:30:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:30:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:30:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:30:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:12,532 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2020-08-19 00:30:12,534 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [415731052] [2020-08-19 00:30:12,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:30:12,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-19 00:30:12,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093203988] [2020-08-19 00:30:12,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-19 00:30:12,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:30:12,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-19 00:30:12,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-08-19 00:30:12,537 INFO L87 Difference]: Start difference. First operand 4852 states and 6633 transitions. Second operand 10 states. [2020-08-19 00:30:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:30:16,301 INFO L93 Difference]: Finished difference Result 12975 states and 19533 transitions. [2020-08-19 00:30:16,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-19 00:30:16,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2020-08-19 00:30:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:30:16,348 INFO L225 Difference]: With dead ends: 12975 [2020-08-19 00:30:16,348 INFO L226 Difference]: Without dead ends: 6726 [2020-08-19 00:30:16,391 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2020-08-19 00:30:16,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6726 states. [2020-08-19 00:30:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6726 to 6174. [2020-08-19 00:30:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6174 states. [2020-08-19 00:30:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 8297 transitions. [2020-08-19 00:30:17,271 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 8297 transitions. Word has length 156 [2020-08-19 00:30:17,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:30:17,272 INFO L479 AbstractCegarLoop]: Abstraction has 6174 states and 8297 transitions. [2020-08-19 00:30:17,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-19 00:30:17,272 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 8297 transitions. [2020-08-19 00:30:17,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-08-19 00:30:17,282 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:30:17,283 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:30:17,283 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-08-19 00:30:17,283 INFO L427 AbstractCegarLoop]: === Iteration 16 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:30:17,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:30:17,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1382123670, now seen corresponding path program 1 times [2020-08-19 00:30:17,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:30:17,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [18846596] [2020-08-19 00:30:17,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:30:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:30:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-08-19 00:30:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-19 00:30:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2020-08-19 00:30:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2020-08-19 00:30:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-19 00:30:17,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:30:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:30:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:30:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-19 00:30:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2020-08-19 00:30:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2020-08-19 00:30:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2020-08-19 00:30:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-08-19 00:30:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2020-08-19 00:30:17,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:30:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:30:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,498 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:30:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:30:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2020-08-19 00:30:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2020-08-19 00:30:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-08-19 00:30:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-19 00:30:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-08-19 00:30:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-19 00:30:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2020-08-19 00:30:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-19 00:30:17,596 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2020-08-19 00:30:17,597 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [18846596] [2020-08-19 00:30:17,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-19 00:30:17,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-19 00:30:17,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948605241] [2020-08-19 00:30:17,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-19 00:30:17,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-19 00:30:17,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-19 00:30:17,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-08-19 00:30:17,601 INFO L87 Difference]: Start difference. First operand 6174 states and 8297 transitions. Second operand 11 states. [2020-08-19 00:30:18,810 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-08-19 00:30:20,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-19 00:30:20,178 INFO L93 Difference]: Finished difference Result 12270 states and 16979 transitions. [2020-08-19 00:30:20,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-19 00:30:20,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 207 [2020-08-19 00:30:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-19 00:30:20,196 INFO L225 Difference]: With dead ends: 12270 [2020-08-19 00:30:20,196 INFO L226 Difference]: Without dead ends: 3143 [2020-08-19 00:30:20,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=158, Invalid=492, Unknown=0, NotChecked=0, Total=650 [2020-08-19 00:30:20,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2020-08-19 00:30:20,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 2950. [2020-08-19 00:30:20,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2950 states. [2020-08-19 00:30:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 3443 transitions. [2020-08-19 00:30:20,638 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 3443 transitions. Word has length 207 [2020-08-19 00:30:20,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-19 00:30:20,639 INFO L479 AbstractCegarLoop]: Abstraction has 2950 states and 3443 transitions. [2020-08-19 00:30:20,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-19 00:30:20,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 3443 transitions. [2020-08-19 00:30:20,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2020-08-19 00:30:20,644 INFO L414 BasicCegarLoop]: Found error trace [2020-08-19 00:30:20,644 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-19 00:30:20,645 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-08-19 00:30:20,645 INFO L427 AbstractCegarLoop]: === Iteration 17 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-19 00:30:20,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-19 00:30:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash 89354437, now seen corresponding path program 1 times [2020-08-19 00:30:20,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-19 00:30:20,646 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1464245930] [2020-08-19 00:30:20,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-19 00:30:20,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-08-19 00:30:20,676 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-08-19 00:30:20,677 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-08-19 00:30:20,681 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-08-19 00:30:20,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.08 12:30:20 BoogieIcfgContainer [2020-08-19 00:30:20,719 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-19 00:30:20,721 INFO L168 Benchmark]: Toolchain (without parser) took 40086.19 ms. Allocated memory was 138.9 MB in the beginning and 747.6 MB in the end (delta: 608.7 MB). Free memory was 101.6 MB in the beginning and 534.6 MB in the end (delta: -433.0 MB). Peak memory consumption was 175.7 MB. Max. memory is 7.1 GB. [2020-08-19 00:30:20,722 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-19 00:30:20,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.90 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 180.9 MB in the end (delta: -79.5 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2020-08-19 00:30:20,723 INFO L168 Benchmark]: Boogie Preprocessor took 54.72 ms. Allocated memory is still 202.4 MB. Free memory was 180.9 MB in the beginning and 178.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2020-08-19 00:30:20,724 INFO L168 Benchmark]: RCFGBuilder took 583.92 ms. Allocated memory is still 202.4 MB. Free memory was 178.3 MB in the beginning and 142.2 MB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2020-08-19 00:30:20,724 INFO L168 Benchmark]: TraceAbstraction took 38990.44 ms. Allocated memory was 202.4 MB in the beginning and 747.6 MB in the end (delta: 545.3 MB). Free memory was 141.6 MB in the beginning and 534.6 MB in the end (delta: -393.0 MB). Peak memory consumption was 152.2 MB. Max. memory is 7.1 GB. [2020-08-19 00:30:20,727 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 451.90 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 101.4 MB in the beginning and 180.9 MB in the end (delta: -79.5 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 54.72 ms. Allocated memory is still 202.4 MB. Free memory was 180.9 MB in the beginning and 178.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 583.92 ms. Allocated memory is still 202.4 MB. Free memory was 178.3 MB in the beginning and 142.2 MB in the end (delta: 36.1 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 38990.44 ms. Allocated memory was 202.4 MB in the beginning and 747.6 MB in the end (delta: 545.3 MB). Free memory was 141.6 MB in the beginning and 534.6 MB in the end (delta: -393.0 MB). Peak memory consumption was 152.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int t2_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int t2_i ; [L24] int M_E = 2; [L25] int T1_E = 2; [L26] int T2_E = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L563] int __retres1 ; [L567] CALL init_model() [L477] m_i = 1 [L478] t1_i = 1 [L479] t2_i = 1 [L567] RET init_model() [L568] CALL start_simulation() [L504] int kernel_st ; [L505] int tmp ; [L506] int tmp___0 ; [L510] kernel_st = 0 [L511] FCALL update_channels() [L512] CALL init_threads() [L211] COND TRUE m_i == 1 [L212] m_st = 0 [L216] COND TRUE t1_i == 1 [L217] t1_st = 0 [L221] COND TRUE t2_i == 1 [L222] t2_st = 0 [L512] RET init_threads() [L513] CALL fire_delta_events() [L324] COND FALSE !(M_E == 0) [L329] COND FALSE !(T1_E == 0) [L334] COND FALSE !(T2_E == 0) [L339] COND FALSE !(E_1 == 0) [L344] COND FALSE !(E_2 == 0) [L513] RET fire_delta_events() [L514] CALL activate_threads() [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L393] CALL, EXPR is_master_triggered() [L143] int __retres1 ; [L146] COND FALSE !(m_pc == 1) [L156] __retres1 = 0 [L158] return (__retres1); [L393] RET, EXPR is_master_triggered() [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) [L401] CALL, EXPR is_transmit1_triggered() [L162] int __retres1 ; [L165] COND FALSE !(t1_pc == 1) [L175] __retres1 = 0 [L177] return (__retres1); [L401] RET, EXPR is_transmit1_triggered() [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) [L409] CALL, EXPR is_transmit2_triggered() [L181] int __retres1 ; [L184] COND FALSE !(t2_pc == 1) [L194] __retres1 = 0 [L196] return (__retres1); [L409] RET, EXPR is_transmit2_triggered() [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) [L514] RET activate_threads() [L515] CALL reset_delta_events() [L357] COND FALSE !(M_E == 1) [L362] COND FALSE !(T1_E == 1) [L367] COND FALSE !(T2_E == 1) [L372] COND FALSE !(E_1 == 1) [L377] COND FALSE !(E_2 == 1) [L515] RET reset_delta_events() [L518] COND TRUE 1 [L521] kernel_st = 1 [L522] CALL eval() [L257] int tmp ; [L261] COND TRUE 1 [L264] CALL, EXPR exists_runnable_thread() [L231] int __retres1 ; [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 [L252] return (__retres1); [L264] RET, EXPR exists_runnable_thread() [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND FALSE !(\read(tmp_ndt_1)) [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 [L291] CALL transmit1() [L78] COND TRUE t1_pc == 0 [L89] COND TRUE 1 [L91] t1_pc = 1 [L92] t1_st = 2 [L291] RET transmit1() [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 [L305] CALL transmit2() [L113] COND TRUE t2_pc == 0 [L124] COND TRUE 1 [L126] t2_pc = 1 [L127] t2_st = 2 [L305] RET transmit2() [L261] COND TRUE 1 [L264] CALL, EXPR exists_runnable_thread() [L231] int __retres1 ; [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 [L252] return (__retres1); [L264] RET, EXPR exists_runnable_thread() [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND TRUE \read(tmp_ndt_1) [L276] m_st = 1 [L277] CALL master() [L37] COND TRUE m_pc == 0 [L48] COND TRUE 1 [L51] E_1 = 1 [L52] CALL immediate_notify() [L425] CALL activate_threads() [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L393] CALL, EXPR is_master_triggered() [L143] int __retres1 ; [L146] COND FALSE !(m_pc == 1) [L156] __retres1 = 0 [L158] return (__retres1); [L393] RET, EXPR is_master_triggered() [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) [L401] CALL, EXPR is_transmit1_triggered() [L162] int __retres1 ; [L165] COND TRUE t1_pc == 1 [L166] COND TRUE E_1 == 1 [L167] __retres1 = 1 [L177] return (__retres1); [L401] RET, EXPR is_transmit1_triggered() [L401] tmp___0 = is_transmit1_triggered() [L403] COND TRUE \read(tmp___0) [L404] t1_st = 0 [L409] CALL, EXPR is_transmit2_triggered() [L181] int __retres1 ; [L184] COND TRUE t2_pc == 1 [L185] COND FALSE !(E_2 == 1) [L194] __retres1 = 0 [L196] return (__retres1); [L409] RET, EXPR is_transmit2_triggered() [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) [L425] RET activate_threads() [L52] RET immediate_notify() [L53] E_1 = 2 [L56] COND TRUE 1 [L58] m_pc = 1 [L59] m_st = 2 [L277] RET master() [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 [L291] CALL transmit1() [L78] COND FALSE !(t1_pc == 0) [L81] COND TRUE t1_pc == 1 [L97] E_2 = 1 [L98] CALL immediate_notify() [L425] CALL activate_threads() [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L393] CALL, EXPR is_master_triggered() [L143] int __retres1 ; [L146] COND TRUE m_pc == 1 [L147] COND FALSE !(M_E == 1) [L156] __retres1 = 0 [L158] return (__retres1); [L393] RET, EXPR is_master_triggered() [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) [L401] CALL, EXPR is_transmit1_triggered() [L162] int __retres1 ; [L165] COND TRUE t1_pc == 1 [L166] COND FALSE !(E_1 == 1) [L175] __retres1 = 0 [L177] return (__retres1); [L401] RET, EXPR is_transmit1_triggered() [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) [L409] CALL, EXPR is_transmit2_triggered() [L181] int __retres1 ; [L184] COND TRUE t2_pc == 1 [L185] COND TRUE E_2 == 1 [L186] __retres1 = 1 [L196] return (__retres1); [L409] RET, EXPR is_transmit2_triggered() [L409] tmp___1 = is_transmit2_triggered() [L411] COND TRUE \read(tmp___1) [L412] t2_st = 0 [L425] RET activate_threads() [L98] RET immediate_notify() [L99] E_2 = 2 [L89] COND TRUE 1 [L91] t1_pc = 1 [L92] t1_st = 2 [L291] RET transmit1() [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 [L305] CALL transmit2() [L113] COND FALSE !(t2_pc == 0) [L116] COND TRUE t2_pc == 1 [L132] CALL error() [L11] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 169 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 38.8s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2605 SDtfs, 11531 SDslu, 735 SDs, 0 SdLazy, 15806 SolverSat, 5838 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 756 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 797 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6174occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 3916 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1939 NumberOfCodeBlocks, 1939 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1715 ConstructedInterpolants, 0 QuantifiedInterpolants, 487945 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 237/237 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...