/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/systemc/token_ring.04.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:24:15,232 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:24:15,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:24:15,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:24:15,247 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:24:15,248 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:24:15,250 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:24:15,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:24:15,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:24:15,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:24:15,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:24:15,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:24:15,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:24:15,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:24:15,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:24:15,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:24:15,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:24:15,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:24:15,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:24:15,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:24:15,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:24:15,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:24:15,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:24:15,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:24:15,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:24:15,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:24:15,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:24:15,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:24:15,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:24:15,273 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:24:15,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:24:15,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:24:15,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:24:15,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:24:15,278 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:24:15,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:24:15,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:24:15,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:24:15,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:24:15,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:24:15,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:24:15,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:24:15,305 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:24:15,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:24:15,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:24:15,309 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:24:15,310 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:24:15,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:24:15,310 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:24:15,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:24:15,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:24:15,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:24:15,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:24:15,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:24:15,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:24:15,313 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:24:15,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:24:15,313 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:24:15,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:24:15,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:24:15,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:24:15,314 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:24:15,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:24:15,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:24:15,315 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:24:15,315 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:24:15,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:24:15,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:24:15,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:24:15,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:24:15,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 22:24:15,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:24:15,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:24:15,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:24:15,625 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:24:15,625 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:24:15,626 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/systemc/token_ring.04.cil-2.c [2019-11-06 22:24:15,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd191318d/36a24ba4bd16459e9f0704b20021ea7d/FLAG439d0d35b [2019-11-06 22:24:16,184 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:24:16,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/systemc/token_ring.04.cil-2.c [2019-11-06 22:24:16,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd191318d/36a24ba4bd16459e9f0704b20021ea7d/FLAG439d0d35b [2019-11-06 22:24:16,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd191318d/36a24ba4bd16459e9f0704b20021ea7d [2019-11-06 22:24:16,599 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:24:16,601 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:24:16,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:24:16,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:24:16,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:24:16,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:16" (1/1) ... [2019-11-06 22:24:16,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@341dd2a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:16, skipping insertion in model container [2019-11-06 22:24:16,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:24:16" (1/1) ... [2019-11-06 22:24:16,619 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:24:16,672 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:24:16,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:24:16,952 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:24:17,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:24:17,120 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:24:17,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:17 WrapperNode [2019-11-06 22:24:17,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:24:17,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:24:17,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:24:17,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:24:17,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:17" (1/1) ... [2019-11-06 22:24:17,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:17" (1/1) ... [2019-11-06 22:24:17,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:17" (1/1) ... [2019-11-06 22:24:17,143 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:17" (1/1) ... [2019-11-06 22:24:17,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:17" (1/1) ... [2019-11-06 22:24:17,172 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:17" (1/1) ... [2019-11-06 22:24:17,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:17" (1/1) ... [2019-11-06 22:24:17,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:24:17,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:24:17,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:24:17,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:24:17,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:24:17,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:24:17,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:24:17,247 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2019-11-06 22:24:17,247 INFO L138 BoogieDeclarations]: Found implementation of procedure master [2019-11-06 22:24:17,247 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit1 [2019-11-06 22:24:17,248 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit2 [2019-11-06 22:24:17,248 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit3 [2019-11-06 22:24:17,248 INFO L138 BoogieDeclarations]: Found implementation of procedure transmit4 [2019-11-06 22:24:17,248 INFO L138 BoogieDeclarations]: Found implementation of procedure is_master_triggered [2019-11-06 22:24:17,249 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit1_triggered [2019-11-06 22:24:17,249 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit2_triggered [2019-11-06 22:24:17,249 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit3_triggered [2019-11-06 22:24:17,249 INFO L138 BoogieDeclarations]: Found implementation of procedure is_transmit4_triggered [2019-11-06 22:24:17,250 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2019-11-06 22:24:17,250 INFO L138 BoogieDeclarations]: Found implementation of procedure init_threads [2019-11-06 22:24:17,251 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2019-11-06 22:24:17,252 INFO L138 BoogieDeclarations]: Found implementation of procedure eval [2019-11-06 22:24:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2019-11-06 22:24:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2019-11-06 22:24:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2019-11-06 22:24:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2019-11-06 22:24:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_time_events [2019-11-06 22:24:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_time_events [2019-11-06 22:24:17,254 INFO L138 BoogieDeclarations]: Found implementation of procedure init_model [2019-11-06 22:24:17,254 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_simulation [2019-11-06 22:24:17,254 INFO L138 BoogieDeclarations]: Found implementation of procedure start_simulation [2019-11-06 22:24:17,254 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:24:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:24:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure error [2019-11-06 22:24:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure is_master_triggered [2019-11-06 22:24:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit1_triggered [2019-11-06 22:24:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit2_triggered [2019-11-06 22:24:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit3_triggered [2019-11-06 22:24:17,255 INFO L130 BoogieDeclarations]: Found specification of procedure is_transmit4_triggered [2019-11-06 22:24:17,256 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2019-11-06 22:24:17,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:24:17,256 INFO L130 BoogieDeclarations]: Found specification of procedure master [2019-11-06 22:24:17,256 INFO L130 BoogieDeclarations]: Found specification of procedure transmit1 [2019-11-06 22:24:17,256 INFO L130 BoogieDeclarations]: Found specification of procedure transmit2 [2019-11-06 22:24:17,256 INFO L130 BoogieDeclarations]: Found specification of procedure transmit3 [2019-11-06 22:24:17,256 INFO L130 BoogieDeclarations]: Found specification of procedure transmit4 [2019-11-06 22:24:17,257 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2019-11-06 22:24:17,257 INFO L130 BoogieDeclarations]: Found specification of procedure init_threads [2019-11-06 22:24:17,257 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2019-11-06 22:24:17,257 INFO L130 BoogieDeclarations]: Found specification of procedure eval [2019-11-06 22:24:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2019-11-06 22:24:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2019-11-06 22:24:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2019-11-06 22:24:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure fire_time_events [2019-11-06 22:24:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure reset_time_events [2019-11-06 22:24:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure init_model [2019-11-06 22:24:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure stop_simulation [2019-11-06 22:24:17,259 INFO L130 BoogieDeclarations]: Found specification of procedure start_simulation [2019-11-06 22:24:17,259 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:24:17,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:24:17,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:24:18,071 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:24:18,072 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-06 22:24:18,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:18 BoogieIcfgContainer [2019-11-06 22:24:18,074 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:24:18,075 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:24:18,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:24:18,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:24:18,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:24:16" (1/3) ... [2019-11-06 22:24:18,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512dea40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:18, skipping insertion in model container [2019-11-06 22:24:18,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:24:17" (2/3) ... [2019-11-06 22:24:18,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@512dea40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:24:18, skipping insertion in model container [2019-11-06 22:24:18,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:24:18" (3/3) ... [2019-11-06 22:24:18,083 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-2.c [2019-11-06 22:24:18,094 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:24:18,103 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:24:18,115 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:24:18,145 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:24:18,145 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:24:18,145 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:24:18,145 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:24:18,146 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:24:18,146 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:24:18,146 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:24:18,146 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:24:18,172 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states. [2019-11-06 22:24:18,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:24:18,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:18,188 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:18,190 INFO L410 AbstractCegarLoop]: === Iteration 1 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:18,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1526033595, now seen corresponding path program 1 times [2019-11-06 22:24:18,203 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:18,204 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110713115] [2019-11-06 22:24:18,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,595 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-06 22:24:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:18,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:18,924 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110713115] [2019-11-06 22:24:18,925 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:18,925 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 22:24:18,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729073060] [2019-11-06 22:24:18,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 22:24:18,935 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:18,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 22:24:18,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:24:18,952 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 8 states. [2019-11-06 22:24:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:21,875 INFO L93 Difference]: Finished difference Result 602 states and 952 transitions. [2019-11-06 22:24:21,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:24:21,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 120 [2019-11-06 22:24:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:21,896 INFO L225 Difference]: With dead ends: 602 [2019-11-06 22:24:21,896 INFO L226 Difference]: Without dead ends: 365 [2019-11-06 22:24:21,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:24:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-11-06 22:24:22,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 232. [2019-11-06 22:24:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-06 22:24:22,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 326 transitions. [2019-11-06 22:24:22,021 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 326 transitions. Word has length 120 [2019-11-06 22:24:22,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:22,022 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 326 transitions. [2019-11-06 22:24:22,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 22:24:22,023 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 326 transitions. [2019-11-06 22:24:22,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:24:22,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:22,036 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:22,037 INFO L410 AbstractCegarLoop]: === Iteration 2 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:22,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:22,037 INFO L82 PathProgramCache]: Analyzing trace with hash -735539655, now seen corresponding path program 1 times [2019-11-06 22:24:22,038 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:22,038 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124431015] [2019-11-06 22:24:22,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:22,438 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124431015] [2019-11-06 22:24:22,439 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:22,439 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-06 22:24:22,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049724582] [2019-11-06 22:24:22,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 22:24:22,442 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:22,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 22:24:22,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 22:24:22,443 INFO L87 Difference]: Start difference. First operand 232 states and 326 transitions. Second operand 9 states. [2019-11-06 22:24:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:26,232 INFO L93 Difference]: Finished difference Result 878 states and 1309 transitions. [2019-11-06 22:24:26,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 22:24:26,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-11-06 22:24:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:26,240 INFO L225 Difference]: With dead ends: 878 [2019-11-06 22:24:26,240 INFO L226 Difference]: Without dead ends: 668 [2019-11-06 22:24:26,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-11-06 22:24:26,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-11-06 22:24:26,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 440. [2019-11-06 22:24:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-06 22:24:26,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 627 transitions. [2019-11-06 22:24:26,342 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 627 transitions. Word has length 120 [2019-11-06 22:24:26,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:26,344 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 627 transitions. [2019-11-06 22:24:26,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 22:24:26,345 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 627 transitions. [2019-11-06 22:24:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:24:26,349 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:26,350 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:26,350 INFO L410 AbstractCegarLoop]: === Iteration 3 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:26,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:26,350 INFO L82 PathProgramCache]: Analyzing trace with hash 258713141, now seen corresponding path program 1 times [2019-11-06 22:24:26,351 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:26,351 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083308075] [2019-11-06 22:24:26,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:26,687 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083308075] [2019-11-06 22:24:26,687 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:26,687 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:26,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773009333] [2019-11-06 22:24:26,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:26,688 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:26,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:26,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:26,689 INFO L87 Difference]: Start difference. First operand 440 states and 627 transitions. Second operand 10 states. [2019-11-06 22:24:26,818 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-06 22:24:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:28,759 INFO L93 Difference]: Finished difference Result 1080 states and 1605 transitions. [2019-11-06 22:24:28,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:24:28,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:24:28,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:28,771 INFO L225 Difference]: With dead ends: 1080 [2019-11-06 22:24:28,771 INFO L226 Difference]: Without dead ends: 662 [2019-11-06 22:24:28,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:24:28,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-11-06 22:24:28,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 440. [2019-11-06 22:24:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-06 22:24:28,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 620 transitions. [2019-11-06 22:24:28,864 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 620 transitions. Word has length 120 [2019-11-06 22:24:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:28,865 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 620 transitions. [2019-11-06 22:24:28,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:28,865 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 620 transitions. [2019-11-06 22:24:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:24:28,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:28,867 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:28,867 INFO L410 AbstractCegarLoop]: === Iteration 4 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:28,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:28,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1085502159, now seen corresponding path program 1 times [2019-11-06 22:24:28,868 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:28,868 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935821301] [2019-11-06 22:24:28,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:28,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:29,171 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935821301] [2019-11-06 22:24:29,171 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:29,171 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:29,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130337826] [2019-11-06 22:24:29,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:29,172 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:29,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:29,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:29,173 INFO L87 Difference]: Start difference. First operand 440 states and 620 transitions. Second operand 10 states. [2019-11-06 22:24:31,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:31,672 INFO L93 Difference]: Finished difference Result 1080 states and 1587 transitions. [2019-11-06 22:24:31,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:24:31,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:24:31,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:31,681 INFO L225 Difference]: With dead ends: 1080 [2019-11-06 22:24:31,681 INFO L226 Difference]: Without dead ends: 662 [2019-11-06 22:24:31,688 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:24:31,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-11-06 22:24:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 440. [2019-11-06 22:24:31,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-06 22:24:31,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 613 transitions. [2019-11-06 22:24:31,769 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 613 transitions. Word has length 120 [2019-11-06 22:24:31,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:31,769 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 613 transitions. [2019-11-06 22:24:31,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 613 transitions. [2019-11-06 22:24:31,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:24:31,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:31,772 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:31,773 INFO L410 AbstractCegarLoop]: === Iteration 5 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:31,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1969011149, now seen corresponding path program 1 times [2019-11-06 22:24:31,774 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:31,774 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109349905] [2019-11-06 22:24:31,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:32,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:32,152 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109349905] [2019-11-06 22:24:32,153 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:32,153 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:32,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363270885] [2019-11-06 22:24:32,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:32,156 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:32,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:32,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:32,157 INFO L87 Difference]: Start difference. First operand 440 states and 613 transitions. Second operand 10 states. [2019-11-06 22:24:34,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:34,618 INFO L93 Difference]: Finished difference Result 1080 states and 1569 transitions. [2019-11-06 22:24:34,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 22:24:34,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:24:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:34,624 INFO L225 Difference]: With dead ends: 1080 [2019-11-06 22:24:34,624 INFO L226 Difference]: Without dead ends: 662 [2019-11-06 22:24:34,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-06 22:24:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2019-11-06 22:24:34,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 440. [2019-11-06 22:24:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2019-11-06 22:24:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 606 transitions. [2019-11-06 22:24:34,688 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 606 transitions. Word has length 120 [2019-11-06 22:24:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:34,688 INFO L462 AbstractCegarLoop]: Abstraction has 440 states and 606 transitions. [2019-11-06 22:24:34,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 606 transitions. [2019-11-06 22:24:34,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:24:34,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:34,690 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:34,690 INFO L410 AbstractCegarLoop]: === Iteration 6 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:34,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:34,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1974879185, now seen corresponding path program 1 times [2019-11-06 22:24:34,691 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:34,691 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651819798] [2019-11-06 22:24:34,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:34,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:34,944 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651819798] [2019-11-06 22:24:34,945 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:34,945 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:34,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337333515] [2019-11-06 22:24:34,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:34,946 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:34,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:34,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:34,946 INFO L87 Difference]: Start difference. First operand 440 states and 606 transitions. Second operand 10 states. [2019-11-06 22:24:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:38,163 INFO L93 Difference]: Finished difference Result 1299 states and 1947 transitions. [2019-11-06 22:24:38,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:24:38,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:24:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:38,171 INFO L225 Difference]: With dead ends: 1299 [2019-11-06 22:24:38,171 INFO L226 Difference]: Without dead ends: 881 [2019-11-06 22:24:38,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:24:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2019-11-06 22:24:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 552. [2019-11-06 22:24:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2019-11-06 22:24:38,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 737 transitions. [2019-11-06 22:24:38,245 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 737 transitions. Word has length 120 [2019-11-06 22:24:38,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:38,246 INFO L462 AbstractCegarLoop]: Abstraction has 552 states and 737 transitions. [2019-11-06 22:24:38,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 737 transitions. [2019-11-06 22:24:38,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:24:38,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:38,249 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:38,249 INFO L410 AbstractCegarLoop]: === Iteration 7 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:38,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1512329902, now seen corresponding path program 1 times [2019-11-06 22:24:38,250 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:38,250 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242577274] [2019-11-06 22:24:38,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:38,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:38,502 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242577274] [2019-11-06 22:24:38,502 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:38,502 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:38,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766132583] [2019-11-06 22:24:38,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:38,503 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:38,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:38,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:38,504 INFO L87 Difference]: Start difference. First operand 552 states and 737 transitions. Second operand 10 states. [2019-11-06 22:24:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:41,654 INFO L93 Difference]: Finished difference Result 1555 states and 2257 transitions. [2019-11-06 22:24:41,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 22:24:41,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:24:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:41,662 INFO L225 Difference]: With dead ends: 1555 [2019-11-06 22:24:41,662 INFO L226 Difference]: Without dead ends: 1025 [2019-11-06 22:24:41,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-11-06 22:24:41,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2019-11-06 22:24:41,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 664. [2019-11-06 22:24:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 664 states. [2019-11-06 22:24:41,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 864 transitions. [2019-11-06 22:24:41,746 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 864 transitions. Word has length 120 [2019-11-06 22:24:41,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:41,746 INFO L462 AbstractCegarLoop]: Abstraction has 664 states and 864 transitions. [2019-11-06 22:24:41,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 864 transitions. [2019-11-06 22:24:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:24:41,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:41,748 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:41,749 INFO L410 AbstractCegarLoop]: === Iteration 8 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:41,749 INFO L82 PathProgramCache]: Analyzing trace with hash -144739762, now seen corresponding path program 1 times [2019-11-06 22:24:41,749 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:41,749 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745495696] [2019-11-06 22:24:41,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:41,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:42,003 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745495696] [2019-11-06 22:24:42,003 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:42,003 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:42,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540043359] [2019-11-06 22:24:42,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:42,004 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:42,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:42,005 INFO L87 Difference]: Start difference. First operand 664 states and 864 transitions. Second operand 10 states. [2019-11-06 22:24:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:45,050 INFO L93 Difference]: Finished difference Result 1811 states and 2557 transitions. [2019-11-06 22:24:45,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:24:45,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:24:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:45,059 INFO L225 Difference]: With dead ends: 1811 [2019-11-06 22:24:45,059 INFO L226 Difference]: Without dead ends: 1169 [2019-11-06 22:24:45,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:24:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2019-11-06 22:24:45,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 776. [2019-11-06 22:24:45,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-06 22:24:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 987 transitions. [2019-11-06 22:24:45,169 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 987 transitions. Word has length 120 [2019-11-06 22:24:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:45,169 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 987 transitions. [2019-11-06 22:24:45,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 987 transitions. [2019-11-06 22:24:45,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:24:45,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:45,171 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:45,171 INFO L410 AbstractCegarLoop]: === Iteration 9 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:45,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:45,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1007754706, now seen corresponding path program 1 times [2019-11-06 22:24:45,172 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:45,172 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055026504] [2019-11-06 22:24:45,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:45,415 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055026504] [2019-11-06 22:24:45,415 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:45,415 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:45,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261469477] [2019-11-06 22:24:45,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:45,416 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:45,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:45,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:45,417 INFO L87 Difference]: Start difference. First operand 776 states and 987 transitions. Second operand 10 states. [2019-11-06 22:24:48,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:48,425 INFO L93 Difference]: Finished difference Result 2067 states and 2849 transitions. [2019-11-06 22:24:48,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 22:24:48,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:24:48,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:48,433 INFO L225 Difference]: With dead ends: 2067 [2019-11-06 22:24:48,434 INFO L226 Difference]: Without dead ends: 1313 [2019-11-06 22:24:48,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2019-11-06 22:24:48,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-11-06 22:24:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 888. [2019-11-06 22:24:48,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2019-11-06 22:24:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1106 transitions. [2019-11-06 22:24:48,541 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1106 transitions. Word has length 120 [2019-11-06 22:24:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:48,541 INFO L462 AbstractCegarLoop]: Abstraction has 888 states and 1106 transitions. [2019-11-06 22:24:48,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1106 transitions. [2019-11-06 22:24:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:24:48,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:48,543 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:48,543 INFO L410 AbstractCegarLoop]: === Iteration 10 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:48,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:48,544 INFO L82 PathProgramCache]: Analyzing trace with hash 75100622, now seen corresponding path program 1 times [2019-11-06 22:24:48,544 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:48,544 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998162501] [2019-11-06 22:24:48,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:48,802 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998162501] [2019-11-06 22:24:48,802 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:48,802 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:48,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359417091] [2019-11-06 22:24:48,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:48,803 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:48,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:48,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:48,808 INFO L87 Difference]: Start difference. First operand 888 states and 1106 transitions. Second operand 10 states. [2019-11-06 22:24:52,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:24:52,018 INFO L93 Difference]: Finished difference Result 2111 states and 2760 transitions. [2019-11-06 22:24:52,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-06 22:24:52,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 120 [2019-11-06 22:24:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:24:52,027 INFO L225 Difference]: With dead ends: 2111 [2019-11-06 22:24:52,027 INFO L226 Difference]: Without dead ends: 1246 [2019-11-06 22:24:52,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-06 22:24:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-11-06 22:24:52,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 898. [2019-11-06 22:24:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2019-11-06 22:24:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1108 transitions. [2019-11-06 22:24:52,134 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1108 transitions. Word has length 120 [2019-11-06 22:24:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:24:52,135 INFO L462 AbstractCegarLoop]: Abstraction has 898 states and 1108 transitions. [2019-11-06 22:24:52,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 22:24:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1108 transitions. [2019-11-06 22:24:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-06 22:24:52,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:24:52,137 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:24:52,138 INFO L410 AbstractCegarLoop]: === Iteration 11 === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:24:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:24:52,138 INFO L82 PathProgramCache]: Analyzing trace with hash 962323468, now seen corresponding path program 1 times [2019-11-06 22:24:52,138 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 22:24:52,138 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955940515] [2019-11-06 22:24:52,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:24:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:24:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:24:52,389 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955940515] [2019-11-06 22:24:52,389 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:24:52,389 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 22:24:52,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683560026] [2019-11-06 22:24:52,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 22:24:52,390 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 22:24:52,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 22:24:52,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:24:52,391 INFO L87 Difference]: Start difference. First operand 898 states and 1108 transitions. Second operand 10 states.