/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/concurrent/pthreads/mainThreadTerminates.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c1f4b5c [2019-12-17 10:53:01,296 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-17 10:53:01,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-17 10:53:01,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-17 10:53:01,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-17 10:53:01,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-17 10:53:01,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-17 10:53:01,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-17 10:53:01,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-17 10:53:01,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-17 10:53:01,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-17 10:53:01,341 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-17 10:53:01,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-17 10:53:01,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-17 10:53:01,347 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-17 10:53:01,349 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-17 10:53:01,350 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-17 10:53:01,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-17 10:53:01,355 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-17 10:53:01,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-17 10:53:01,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-17 10:53:01,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-17 10:53:01,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-17 10:53:01,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-17 10:53:01,371 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-17 10:53:01,371 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-17 10:53:01,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-17 10:53:01,372 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-17 10:53:01,372 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-17 10:53:01,373 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-17 10:53:01,373 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-17 10:53:01,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-17 10:53:01,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-17 10:53:01,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-17 10:53:01,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-17 10:53:01,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-17 10:53:01,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-17 10:53:01,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-17 10:53:01,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-17 10:53:01,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-17 10:53:01,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-17 10:53:01,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-17 10:53:01,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-17 10:53:01,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-17 10:53:01,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-17 10:53:01,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-17 10:53:01,404 INFO L138 SettingsManager]: * Use SBE=true [2019-12-17 10:53:01,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-17 10:53:01,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-17 10:53:01,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-17 10:53:01,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-17 10:53:01,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-17 10:53:01,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-17 10:53:01,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-17 10:53:01,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-17 10:53:01,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-17 10:53:01,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-17 10:53:01,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-17 10:53:01,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-17 10:53:01,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-17 10:53:01,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-17 10:53:01,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-17 10:53:01,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-17 10:53:01,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-17 10:53:01,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-17 10:53:01,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-17 10:53:01,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-17 10:53:01,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-17 10:53:01,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-17 10:53:01,409 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=FINITE_AUTOMATA [2019-12-17 10:53:01,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-17 10:53:01,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-17 10:53:01,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-17 10:53:01,718 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-17 10:53:01,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-17 10:53:01,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-17 10:53:01,724 INFO L275 PluginConnector]: CDTParser initialized [2019-12-17 10:53:01,725 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/pthreads/mainThreadTerminates.c [2019-12-17 10:53:01,795 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b81a62b3e/f4af3ae4221e478ead25b8d1d8b76f71/FLAG1ec59647a [2019-12-17 10:53:02,240 INFO L306 CDTParser]: Found 1 translation units. [2019-12-17 10:53:02,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/concurrent/pthreads/mainThreadTerminates.c [2019-12-17 10:53:02,241 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2019-12-17 10:53:02,241 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2019-12-17 10:53:02,282 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b81a62b3e/f4af3ae4221e478ead25b8d1d8b76f71/FLAG1ec59647a [2019-12-17 10:53:02,615 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b81a62b3e/f4af3ae4221e478ead25b8d1d8b76f71 [2019-12-17 10:53:02,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-17 10:53:02,628 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-17 10:53:02,631 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-17 10:53:02,631 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-17 10:53:02,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-17 10:53:02,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:53:02" (1/1) ... [2019-12-17 10:53:02,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c02c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02, skipping insertion in model container [2019-12-17 10:53:02,638 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:53:02" (1/1) ... [2019-12-17 10:53:02,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-17 10:53:02,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-17 10:53:02,857 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-17 10:53:02,868 INFO L203 MainTranslator]: Completed pre-run [2019-12-17 10:53:02,878 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-17 10:53:02,983 INFO L208 MainTranslator]: Completed translation [2019-12-17 10:53:02,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02 WrapperNode [2019-12-17 10:53:02,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-17 10:53:02,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-17 10:53:02,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-17 10:53:02,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-17 10:53:02,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02" (1/1) ... [2019-12-17 10:53:03,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02" (1/1) ... [2019-12-17 10:53:03,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-17 10:53:03,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-17 10:53:03,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-17 10:53:03,020 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-17 10:53:03,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02" (1/1) ... [2019-12-17 10:53:03,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02" (1/1) ... [2019-12-17 10:53:03,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02" (1/1) ... [2019-12-17 10:53:03,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02" (1/1) ... [2019-12-17 10:53:03,033 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02" (1/1) ... [2019-12-17 10:53:03,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02" (1/1) ... [2019-12-17 10:53:03,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02" (1/1) ... [2019-12-17 10:53:03,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-17 10:53:03,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-17 10:53:03,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-17 10:53:03,040 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-17 10:53:03,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02" (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-12-17 10:53:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-17 10:53:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure worker_thread [2019-12-17 10:53:03,090 INFO L138 BoogieDeclarations]: Found implementation of procedure worker_thread [2019-12-17 10:53:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-17 10:53:03,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-17 10:53:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-17 10:53:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-17 10:53:03,093 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-17 10:53:03,301 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-17 10:53:03,301 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-17 10:53:03,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:53:03 BoogieIcfgContainer [2019-12-17 10:53:03,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-17 10:53:03,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-17 10:53:03,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-17 10:53:03,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-17 10:53:03,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:53:02" (1/3) ... [2019-12-17 10:53:03,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636e74da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:53:03, skipping insertion in model container [2019-12-17 10:53:03,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:53:02" (2/3) ... [2019-12-17 10:53:03,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@636e74da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:53:03, skipping insertion in model container [2019-12-17 10:53:03,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:53:03" (3/3) ... [2019-12-17 10:53:03,327 INFO L109 eAbstractionObserver]: Analyzing ICFG mainThreadTerminates.c [2019-12-17 10:53:03,353 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-17 10:53:03,354 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-17 10:53:03,371 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-17 10:53:03,372 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-17 10:53:03,405 WARN L315 ript$VariableManager]: TermVariabe |worker_threadThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,405 WARN L315 ript$VariableManager]: TermVariabe |worker_threadThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,405 WARN L315 ript$VariableManager]: TermVariabe worker_threadThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,406 WARN L315 ript$VariableManager]: TermVariabe worker_threadThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,406 WARN L315 ript$VariableManager]: TermVariabe worker_threadThread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,406 WARN L315 ript$VariableManager]: TermVariabe worker_threadThread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,407 WARN L315 ript$VariableManager]: TermVariabe worker_threadThread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,407 WARN L315 ript$VariableManager]: TermVariabe worker_threadThread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,407 WARN L315 ript$VariableManager]: TermVariabe |worker_threadThread1of1ForFork0_#t~post0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,408 WARN L315 ript$VariableManager]: TermVariabe |worker_threadThread1of1ForFork0_#t~post0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,408 WARN L315 ript$VariableManager]: TermVariabe worker_threadThread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,408 WARN L315 ript$VariableManager]: TermVariabe |worker_threadThread1of1ForFork0_#t~post0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,412 WARN L315 ript$VariableManager]: TermVariabe |worker_threadThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,412 WARN L315 ript$VariableManager]: TermVariabe worker_threadThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,412 WARN L315 ript$VariableManager]: TermVariabe |worker_threadThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,413 WARN L315 ript$VariableManager]: TermVariabe worker_threadThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,413 WARN L315 ript$VariableManager]: TermVariabe |worker_threadThread1of1ForFork0_#t~post0| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,413 WARN L315 ript$VariableManager]: TermVariabe worker_threadThread1of1ForFork0_~x~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-17 10:53:03,430 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-17 10:53:03,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-17 10:53:03,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-17 10:53:03,446 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-17 10:53:03,446 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-17 10:53:03,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-17 10:53:03,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-17 10:53:03,447 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-17 10:53:03,447 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-17 10:53:03,459 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 25 transitions [2019-12-17 10:53:03,461 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions [2019-12-17 10:53:03,492 INFO L130 PetriNetUnfolder]: 2/24 cut-off events. [2019-12-17 10:53:03,492 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-17 10:53:03,498 INFO L76 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 24 events. 2/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 33 event pairs. 3/24 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2019-12-17 10:53:03,500 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 27 places, 25 transitions [2019-12-17 10:53:03,510 INFO L130 PetriNetUnfolder]: 2/24 cut-off events. [2019-12-17 10:53:03,510 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-17 10:53:03,511 INFO L76 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 24 events. 2/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 33 event pairs. 3/24 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2019-12-17 10:53:03,513 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 110 [2019-12-17 10:53:03,514 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-17 10:53:03,976 INFO L206 etLargeBlockEncoding]: Checked pairs total: 61 [2019-12-17 10:53:03,977 INFO L214 etLargeBlockEncoding]: Total number of compositions: 17 [2019-12-17 10:53:03,984 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 9 places, 8 transitions [2019-12-17 10:53:03,996 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 10 states. [2019-12-17 10:53:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2019-12-17 10:53:04,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-17 10:53:04,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:04,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-17 10:53:04,011 INFO L410 AbstractCegarLoop]: === Iteration 1 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:04,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:04,021 INFO L82 PathProgramCache]: Analyzing trace with hash 3615801, now seen corresponding path program 1 times [2019-12-17 10:53:04,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:04,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557476018] [2019-12-17 10:53:04,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:04,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557476018] [2019-12-17 10:53:04,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-17 10:53:04,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-17 10:53:04,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395357004] [2019-12-17 10:53:04,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-17 10:53:04,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:04,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-17 10:53:04,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-17 10:53:04,220 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2019-12-17 10:53:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:04,243 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2019-12-17 10:53:04,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-17 10:53:04,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-12-17 10:53:04,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:04,254 INFO L225 Difference]: With dead ends: 10 [2019-12-17 10:53:04,255 INFO L226 Difference]: Without dead ends: 10 [2019-12-17 10:53:04,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-17 10:53:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-12-17 10:53:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-12-17 10:53:04,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-12-17 10:53:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-12-17 10:53:04,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 14 transitions. Word has length 4 [2019-12-17 10:53:04,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:04,304 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-12-17 10:53:04,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-17 10:53:04,304 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2019-12-17 10:53:04,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-17 10:53:04,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:04,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-17 10:53:04,306 INFO L410 AbstractCegarLoop]: === Iteration 2 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:04,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash 112089978, now seen corresponding path program 1 times [2019-12-17 10:53:04,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:04,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158625449] [2019-12-17 10:53:04,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:04,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:04,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158625449] [2019-12-17 10:53:04,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484380589] [2019-12-17 10:53:04,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:04,439 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-17 10:53:04,445 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:04,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:04,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2019-12-17 10:53:04,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678810404] [2019-12-17 10:53:04,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-17 10:53:04,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:04,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-17 10:53:04,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-17 10:53:04,480 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand 5 states. [2019-12-17 10:53:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:04,494 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2019-12-17 10:53:04,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-17 10:53:04,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-12-17 10:53:04,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:04,496 INFO L225 Difference]: With dead ends: 12 [2019-12-17 10:53:04,496 INFO L226 Difference]: Without dead ends: 12 [2019-12-17 10:53:04,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-17 10:53:04,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-12-17 10:53:04,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-12-17 10:53:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-12-17 10:53:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-12-17 10:53:04,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 17 transitions. Word has length 5 [2019-12-17 10:53:04,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:04,511 INFO L462 AbstractCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-12-17 10:53:04,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-17 10:53:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2019-12-17 10:53:04,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-17 10:53:04,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:04,512 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-12-17 10:53:04,717 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:04,718 INFO L410 AbstractCegarLoop]: === Iteration 3 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:04,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:04,719 INFO L82 PathProgramCache]: Analyzing trace with hash -820177831, now seen corresponding path program 2 times [2019-12-17 10:53:04,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:04,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574352519] [2019-12-17 10:53:04,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:04,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:04,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574352519] [2019-12-17 10:53:04,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896192467] [2019-12-17 10:53:04,779 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:04,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:53:04,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:04,812 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-17 10:53:04,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:04,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:04,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-17 10:53:04,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138654045] [2019-12-17 10:53:04,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-17 10:53:04,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:04,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-17 10:53:04,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-17 10:53:04,827 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 6 states. [2019-12-17 10:53:04,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:04,843 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2019-12-17 10:53:04,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-17 10:53:04,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-12-17 10:53:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:04,844 INFO L225 Difference]: With dead ends: 14 [2019-12-17 10:53:04,845 INFO L226 Difference]: Without dead ends: 14 [2019-12-17 10:53:04,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-17 10:53:04,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-12-17 10:53:04,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-12-17 10:53:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-12-17 10:53:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-12-17 10:53:04,849 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 6 [2019-12-17 10:53:04,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:04,849 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-12-17 10:53:04,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-17 10:53:04,850 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2019-12-17 10:53:04,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-17 10:53:04,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:04,850 INFO L411 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1] [2019-12-17 10:53:05,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:05,059 INFO L410 AbstractCegarLoop]: === Iteration 4 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:05,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:05,060 INFO L82 PathProgramCache]: Analyzing trace with hash 344291162, now seen corresponding path program 3 times [2019-12-17 10:53:05,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:05,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398316641] [2019-12-17 10:53:05,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:05,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398316641] [2019-12-17 10:53:05,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782266013] [2019-12-17 10:53:05,120 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:05,156 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-17 10:53:05,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:05,157 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-17 10:53:05,158 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:05,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:05,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-17 10:53:05,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790580687] [2019-12-17 10:53:05,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-17 10:53:05,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:05,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-17 10:53:05,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-17 10:53:05,182 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 7 states. [2019-12-17 10:53:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:05,202 INFO L93 Difference]: Finished difference Result 16 states and 23 transitions. [2019-12-17 10:53:05,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-17 10:53:05,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-12-17 10:53:05,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:05,204 INFO L225 Difference]: With dead ends: 16 [2019-12-17 10:53:05,205 INFO L226 Difference]: Without dead ends: 16 [2019-12-17 10:53:05,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-12-17 10:53:05,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-12-17 10:53:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-12-17 10:53:05,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-12-17 10:53:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-12-17 10:53:05,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 7 [2019-12-17 10:53:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:05,212 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-12-17 10:53:05,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-17 10:53:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2019-12-17 10:53:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-17 10:53:05,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:05,214 INFO L411 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2019-12-17 10:53:05,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:05,419 INFO L410 AbstractCegarLoop]: === Iteration 5 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:05,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:05,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2083091577, now seen corresponding path program 4 times [2019-12-17 10:53:05,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:05,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713366413] [2019-12-17 10:53:05,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:05,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:05,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713366413] [2019-12-17 10:53:05,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717660064] [2019-12-17 10:53:05,522 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:05,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:53:05,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:05,565 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-17 10:53:05,566 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:05,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:05,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-17 10:53:05,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85223634] [2019-12-17 10:53:05,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-17 10:53:05,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:05,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-17 10:53:05,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-17 10:53:05,579 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 8 states. [2019-12-17 10:53:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:05,603 INFO L93 Difference]: Finished difference Result 18 states and 26 transitions. [2019-12-17 10:53:05,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-17 10:53:05,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-12-17 10:53:05,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:05,604 INFO L225 Difference]: With dead ends: 18 [2019-12-17 10:53:05,605 INFO L226 Difference]: Without dead ends: 18 [2019-12-17 10:53:05,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-12-17 10:53:05,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-12-17 10:53:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-12-17 10:53:05,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-12-17 10:53:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 26 transitions. [2019-12-17 10:53:05,609 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 26 transitions. Word has length 8 [2019-12-17 10:53:05,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:05,610 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-12-17 10:53:05,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-17 10:53:05,610 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 26 transitions. [2019-12-17 10:53:05,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-17 10:53:05,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:05,611 INFO L411 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1] [2019-12-17 10:53:05,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:05,814 INFO L410 AbstractCegarLoop]: === Iteration 6 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:05,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:05,815 INFO L82 PathProgramCache]: Analyzing trace with hash 151329594, now seen corresponding path program 5 times [2019-12-17 10:53:05,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:05,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788997403] [2019-12-17 10:53:05,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:05,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788997403] [2019-12-17 10:53:05,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097604740] [2019-12-17 10:53:05,897 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:05,930 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-17 10:53:05,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:05,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-17 10:53:05,934 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:05,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:05,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-17 10:53:05,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919925645] [2019-12-17 10:53:05,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-17 10:53:05,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:05,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-17 10:53:05,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-17 10:53:05,951 INFO L87 Difference]: Start difference. First operand 18 states and 26 transitions. Second operand 9 states. [2019-12-17 10:53:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:05,979 INFO L93 Difference]: Finished difference Result 20 states and 29 transitions. [2019-12-17 10:53:05,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-17 10:53:05,979 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-12-17 10:53:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:05,980 INFO L225 Difference]: With dead ends: 20 [2019-12-17 10:53:05,980 INFO L226 Difference]: Without dead ends: 20 [2019-12-17 10:53:05,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-12-17 10:53:05,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-12-17 10:53:05,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-12-17 10:53:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-12-17 10:53:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2019-12-17 10:53:05,987 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 29 transitions. Word has length 9 [2019-12-17 10:53:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:05,988 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 29 transitions. [2019-12-17 10:53:05,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-17 10:53:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 29 transitions. [2019-12-17 10:53:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-17 10:53:05,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:05,989 INFO L411 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1] [2019-12-17 10:53:06,189 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:06,190 INFO L410 AbstractCegarLoop]: === Iteration 7 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:06,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:06,190 INFO L82 PathProgramCache]: Analyzing trace with hash 396250265, now seen corresponding path program 6 times [2019-12-17 10:53:06,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:06,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479654727] [2019-12-17 10:53:06,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:06,262 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:06,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479654727] [2019-12-17 10:53:06,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033605872] [2019-12-17 10:53:06,263 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:06,299 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-17 10:53:06,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:06,300 INFO L264 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-17 10:53:06,301 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:06,314 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:06,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:06,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-17 10:53:06,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590003510] [2019-12-17 10:53:06,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-17 10:53:06,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:06,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-17 10:53:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-17 10:53:06,317 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 10 states. [2019-12-17 10:53:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:06,349 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2019-12-17 10:53:06,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-17 10:53:06,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-12-17 10:53:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:06,350 INFO L225 Difference]: With dead ends: 22 [2019-12-17 10:53:06,350 INFO L226 Difference]: Without dead ends: 22 [2019-12-17 10:53:06,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-12-17 10:53:06,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-17 10:53:06,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-17 10:53:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-17 10:53:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2019-12-17 10:53:06,354 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 10 [2019-12-17 10:53:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:06,355 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2019-12-17 10:53:06,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-17 10:53:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2019-12-17 10:53:06,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-17 10:53:06,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:06,356 INFO L411 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1] [2019-12-17 10:53:06,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:06,561 INFO L410 AbstractCegarLoop]: === Iteration 8 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:06,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:06,562 INFO L82 PathProgramCache]: Analyzing trace with hash -601143526, now seen corresponding path program 7 times [2019-12-17 10:53:06,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:06,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731879858] [2019-12-17 10:53:06,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:06,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731879858] [2019-12-17 10:53:06,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560952140] [2019-12-17 10:53:06,657 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:06,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:06,693 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-17 10:53:06,694 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:06,710 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:06,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:06,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-17 10:53:06,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035366907] [2019-12-17 10:53:06,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-17 10:53:06,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:06,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-17 10:53:06,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-17 10:53:06,712 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand 11 states. [2019-12-17 10:53:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:06,736 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2019-12-17 10:53:06,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-17 10:53:06,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-12-17 10:53:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:06,737 INFO L225 Difference]: With dead ends: 24 [2019-12-17 10:53:06,737 INFO L226 Difference]: Without dead ends: 24 [2019-12-17 10:53:06,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-12-17 10:53:06,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-17 10:53:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-17 10:53:06,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-17 10:53:06,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2019-12-17 10:53:06,743 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 35 transitions. Word has length 11 [2019-12-17 10:53:06,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:06,743 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 35 transitions. [2019-12-17 10:53:06,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-17 10:53:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2019-12-17 10:53:06,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-17 10:53:06,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:06,744 INFO L411 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2019-12-17 10:53:06,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:06,947 INFO L410 AbstractCegarLoop]: === Iteration 9 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:06,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:06,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1455579975, now seen corresponding path program 8 times [2019-12-17 10:53:06,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:06,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926415670] [2019-12-17 10:53:06,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:07,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926415670] [2019-12-17 10:53:07,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781164343] [2019-12-17 10:53:07,098 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:07,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:53:07,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:07,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-17 10:53:07,138 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:07,158 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:07,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:07,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-17 10:53:07,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376361008] [2019-12-17 10:53:07,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-17 10:53:07,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:07,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-17 10:53:07,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-12-17 10:53:07,160 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 12 states. [2019-12-17 10:53:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:07,181 INFO L93 Difference]: Finished difference Result 26 states and 38 transitions. [2019-12-17 10:53:07,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-17 10:53:07,181 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-12-17 10:53:07,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:07,182 INFO L225 Difference]: With dead ends: 26 [2019-12-17 10:53:07,182 INFO L226 Difference]: Without dead ends: 26 [2019-12-17 10:53:07,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-12-17 10:53:07,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-17 10:53:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-12-17 10:53:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-17 10:53:07,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 38 transitions. [2019-12-17 10:53:07,187 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 38 transitions. Word has length 12 [2019-12-17 10:53:07,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:07,187 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 38 transitions. [2019-12-17 10:53:07,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-17 10:53:07,187 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 38 transitions. [2019-12-17 10:53:07,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-17 10:53:07,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:07,188 INFO L411 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1] [2019-12-17 10:53:07,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:07,389 INFO L410 AbstractCegarLoop]: === Iteration 10 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:07,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:07,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2121661178, now seen corresponding path program 9 times [2019-12-17 10:53:07,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:07,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169043819] [2019-12-17 10:53:07,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:07,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169043819] [2019-12-17 10:53:07,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106950549] [2019-12-17 10:53:07,511 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:07,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-17 10:53:07,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:07,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-17 10:53:07,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:07,569 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:07,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:07,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-17 10:53:07,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224804647] [2019-12-17 10:53:07,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-17 10:53:07,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:07,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-17 10:53:07,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-12-17 10:53:07,571 INFO L87 Difference]: Start difference. First operand 26 states and 38 transitions. Second operand 13 states. [2019-12-17 10:53:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:07,624 INFO L93 Difference]: Finished difference Result 28 states and 41 transitions. [2019-12-17 10:53:07,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-17 10:53:07,625 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-12-17 10:53:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:07,625 INFO L225 Difference]: With dead ends: 28 [2019-12-17 10:53:07,625 INFO L226 Difference]: Without dead ends: 28 [2019-12-17 10:53:07,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-12-17 10:53:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-17 10:53:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-17 10:53:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-17 10:53:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2019-12-17 10:53:07,638 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 13 [2019-12-17 10:53:07,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:07,639 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2019-12-17 10:53:07,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-17 10:53:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2019-12-17 10:53:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-17 10:53:07,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:07,640 INFO L411 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1] [2019-12-17 10:53:07,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:07,848 INFO L410 AbstractCegarLoop]: === Iteration 11 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:07,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1346987225, now seen corresponding path program 10 times [2019-12-17 10:53:07,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:07,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480125364] [2019-12-17 10:53:07,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:07,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480125364] [2019-12-17 10:53:07,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346346401] [2019-12-17 10:53:07,966 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:08,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:53:08,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:08,010 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-17 10:53:08,011 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:08,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:08,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-17 10:53:08,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846643379] [2019-12-17 10:53:08,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-17 10:53:08,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:08,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-17 10:53:08,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-12-17 10:53:08,026 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand 14 states. [2019-12-17 10:53:08,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:08,048 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2019-12-17 10:53:08,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-17 10:53:08,049 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-12-17 10:53:08,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:08,050 INFO L225 Difference]: With dead ends: 30 [2019-12-17 10:53:08,050 INFO L226 Difference]: Without dead ends: 30 [2019-12-17 10:53:08,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-12-17 10:53:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-17 10:53:08,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-17 10:53:08,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-17 10:53:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-12-17 10:53:08,055 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 14 [2019-12-17 10:53:08,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:08,055 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-12-17 10:53:08,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-17 10:53:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2019-12-17 10:53:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-17 10:53:08,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:08,056 INFO L411 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1] [2019-12-17 10:53:08,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:08,257 INFO L410 AbstractCegarLoop]: === Iteration 12 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:08,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1193068838, now seen corresponding path program 11 times [2019-12-17 10:53:08,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:08,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868429713] [2019-12-17 10:53:08,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:08,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868429713] [2019-12-17 10:53:08,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921781723] [2019-12-17 10:53:08,364 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:08,395 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-17 10:53:08,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:08,396 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-17 10:53:08,398 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:08,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:08,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-17 10:53:08,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817731513] [2019-12-17 10:53:08,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-17 10:53:08,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:08,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-17 10:53:08,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-12-17 10:53:08,411 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 15 states. [2019-12-17 10:53:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:08,471 INFO L93 Difference]: Finished difference Result 32 states and 47 transitions. [2019-12-17 10:53:08,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-17 10:53:08,471 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-12-17 10:53:08,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:08,472 INFO L225 Difference]: With dead ends: 32 [2019-12-17 10:53:08,473 INFO L226 Difference]: Without dead ends: 32 [2019-12-17 10:53:08,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-12-17 10:53:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-17 10:53:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-17 10:53:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-17 10:53:08,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2019-12-17 10:53:08,478 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 15 [2019-12-17 10:53:08,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:08,479 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-12-17 10:53:08,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-17 10:53:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2019-12-17 10:53:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-17 10:53:08,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:08,480 INFO L411 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1] [2019-12-17 10:53:08,688 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:08,689 INFO L410 AbstractCegarLoop]: === Iteration 13 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:08,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:08,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1669571833, now seen corresponding path program 12 times [2019-12-17 10:53:08,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:08,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429371232] [2019-12-17 10:53:08,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:08,832 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:08,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429371232] [2019-12-17 10:53:08,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504418055] [2019-12-17 10:53:08,833 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:08,873 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-17 10:53:08,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:08,874 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-17 10:53:08,875 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:08,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:08,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-17 10:53:08,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939321547] [2019-12-17 10:53:08,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-17 10:53:08,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:08,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-17 10:53:08,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-12-17 10:53:08,890 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 16 states. [2019-12-17 10:53:08,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:08,935 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2019-12-17 10:53:08,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-17 10:53:08,936 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-12-17 10:53:08,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:08,936 INFO L225 Difference]: With dead ends: 34 [2019-12-17 10:53:08,936 INFO L226 Difference]: Without dead ends: 34 [2019-12-17 10:53:08,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-12-17 10:53:08,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-17 10:53:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-17 10:53:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-17 10:53:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2019-12-17 10:53:08,941 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 16 [2019-12-17 10:53:08,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:08,941 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-12-17 10:53:08,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-17 10:53:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2019-12-17 10:53:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-17 10:53:08,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:08,943 INFO L411 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1] [2019-12-17 10:53:09,146 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:09,146 INFO L410 AbstractCegarLoop]: === Iteration 14 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:09,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:09,147 INFO L82 PathProgramCache]: Analyzing trace with hash 217119418, now seen corresponding path program 13 times [2019-12-17 10:53:09,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:09,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155842501] [2019-12-17 10:53:09,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:09,280 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:09,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155842501] [2019-12-17 10:53:09,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510454798] [2019-12-17 10:53:09,281 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:09,321 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-17 10:53:09,323 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:09,334 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:09,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:09,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-17 10:53:09,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310652011] [2019-12-17 10:53:09,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-17 10:53:09,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-17 10:53:09,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-12-17 10:53:09,336 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand 17 states. [2019-12-17 10:53:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:09,393 INFO L93 Difference]: Finished difference Result 36 states and 53 transitions. [2019-12-17 10:53:09,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-17 10:53:09,394 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-12-17 10:53:09,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:09,395 INFO L225 Difference]: With dead ends: 36 [2019-12-17 10:53:09,395 INFO L226 Difference]: Without dead ends: 36 [2019-12-17 10:53:09,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-12-17 10:53:09,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-17 10:53:09,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-17 10:53:09,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-17 10:53:09,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2019-12-17 10:53:09,400 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 17 [2019-12-17 10:53:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:09,401 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2019-12-17 10:53:09,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-17 10:53:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2019-12-17 10:53:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-17 10:53:09,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:09,402 INFO L411 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1] [2019-12-17 10:53:09,602 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:09,602 INFO L410 AbstractCegarLoop]: === Iteration 15 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:09,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:09,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1859232487, now seen corresponding path program 14 times [2019-12-17 10:53:09,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:09,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568013078] [2019-12-17 10:53:09,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:09,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568013078] [2019-12-17 10:53:09,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659233215] [2019-12-17 10:53:09,753 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:09,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:53:09,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:09,786 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-17 10:53:09,787 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:09,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:09,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-17 10:53:09,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311131434] [2019-12-17 10:53:09,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-17 10:53:09,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:09,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-17 10:53:09,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-12-17 10:53:09,801 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 18 states. [2019-12-17 10:53:09,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:09,833 INFO L93 Difference]: Finished difference Result 38 states and 56 transitions. [2019-12-17 10:53:09,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-17 10:53:09,833 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-12-17 10:53:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:09,834 INFO L225 Difference]: With dead ends: 38 [2019-12-17 10:53:09,834 INFO L226 Difference]: Without dead ends: 38 [2019-12-17 10:53:09,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-12-17 10:53:09,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-17 10:53:09,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-17 10:53:09,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-17 10:53:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2019-12-17 10:53:09,839 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 18 [2019-12-17 10:53:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:09,840 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2019-12-17 10:53:09,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-17 10:53:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2019-12-17 10:53:09,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-17 10:53:09,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:09,841 INFO L411 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1] [2019-12-17 10:53:10,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:10,045 INFO L410 AbstractCegarLoop]: === Iteration 16 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:10,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:10,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1801632102, now seen corresponding path program 15 times [2019-12-17 10:53:10,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:10,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673904360] [2019-12-17 10:53:10,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:10,231 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:10,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673904360] [2019-12-17 10:53:10,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065853062] [2019-12-17 10:53:10,232 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:10,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-17 10:53:10,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:10,291 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-17 10:53:10,292 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:10,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:10,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-17 10:53:10,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643259716] [2019-12-17 10:53:10,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-17 10:53:10,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:10,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-17 10:53:10,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-12-17 10:53:10,317 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand 19 states. [2019-12-17 10:53:10,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:10,357 INFO L93 Difference]: Finished difference Result 40 states and 59 transitions. [2019-12-17 10:53:10,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-17 10:53:10,357 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-12-17 10:53:10,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:10,358 INFO L225 Difference]: With dead ends: 40 [2019-12-17 10:53:10,358 INFO L226 Difference]: Without dead ends: 40 [2019-12-17 10:53:10,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-12-17 10:53:10,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-17 10:53:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-17 10:53:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-17 10:53:10,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2019-12-17 10:53:10,362 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 59 transitions. Word has length 19 [2019-12-17 10:53:10,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:10,362 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 59 transitions. [2019-12-17 10:53:10,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-17 10:53:10,363 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 59 transitions. [2019-12-17 10:53:10,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-17 10:53:10,363 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:10,363 INFO L411 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2019-12-17 10:53:10,567 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:10,568 INFO L410 AbstractCegarLoop]: === Iteration 17 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:10,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:10,568 INFO L82 PathProgramCache]: Analyzing trace with hash -16020167, now seen corresponding path program 16 times [2019-12-17 10:53:10,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:10,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992569026] [2019-12-17 10:53:10,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:10,761 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:10,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992569026] [2019-12-17 10:53:10,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749430043] [2019-12-17 10:53:10,762 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:10,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:53:10,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:10,795 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-17 10:53:10,797 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:10,812 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:10,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:10,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-17 10:53:10,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179311172] [2019-12-17 10:53:10,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-17 10:53:10,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:10,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-17 10:53:10,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-12-17 10:53:10,814 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. Second operand 20 states. [2019-12-17 10:53:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:10,870 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2019-12-17 10:53:10,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-17 10:53:10,871 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-12-17 10:53:10,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:10,871 INFO L225 Difference]: With dead ends: 42 [2019-12-17 10:53:10,872 INFO L226 Difference]: Without dead ends: 42 [2019-12-17 10:53:10,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-12-17 10:53:10,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-17 10:53:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-17 10:53:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-17 10:53:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 62 transitions. [2019-12-17 10:53:10,876 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 62 transitions. Word has length 20 [2019-12-17 10:53:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:10,877 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 62 transitions. [2019-12-17 10:53:10,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-17 10:53:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 62 transitions. [2019-12-17 10:53:10,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-17 10:53:10,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:10,878 INFO L411 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1] [2019-12-17 10:53:11,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:11,088 INFO L410 AbstractCegarLoop]: === Iteration 18 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:11,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:11,088 INFO L82 PathProgramCache]: Analyzing trace with hash -496625030, now seen corresponding path program 17 times [2019-12-17 10:53:11,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:11,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152976062] [2019-12-17 10:53:11,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:11,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:11,275 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:11,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152976062] [2019-12-17 10:53:11,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842537937] [2019-12-17 10:53:11,276 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:11,329 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-12-17 10:53:11,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:11,330 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-17 10:53:11,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:11,359 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:11,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:11,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-17 10:53:11,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635335994] [2019-12-17 10:53:11,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-17 10:53:11,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:11,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-17 10:53:11,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-12-17 10:53:11,361 INFO L87 Difference]: Start difference. First operand 42 states and 62 transitions. Second operand 21 states. [2019-12-17 10:53:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:11,398 INFO L93 Difference]: Finished difference Result 44 states and 65 transitions. [2019-12-17 10:53:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-17 10:53:11,399 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-12-17 10:53:11,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:11,399 INFO L225 Difference]: With dead ends: 44 [2019-12-17 10:53:11,399 INFO L226 Difference]: Without dead ends: 44 [2019-12-17 10:53:11,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-12-17 10:53:11,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-17 10:53:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-17 10:53:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-17 10:53:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2019-12-17 10:53:11,403 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 21 [2019-12-17 10:53:11,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:11,404 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2019-12-17 10:53:11,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-17 10:53:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2019-12-17 10:53:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-17 10:53:11,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:11,405 INFO L411 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1] [2019-12-17 10:53:11,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:11,609 INFO L410 AbstractCegarLoop]: === Iteration 19 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:11,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:11,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1784493401, now seen corresponding path program 18 times [2019-12-17 10:53:11,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:11,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72620259] [2019-12-17 10:53:11,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:11,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72620259] [2019-12-17 10:53:11,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64093199] [2019-12-17 10:53:11,814 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:11,853 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-12-17 10:53:11,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:11,854 INFO L264 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-17 10:53:11,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:11,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:11,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-17 10:53:11,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129860098] [2019-12-17 10:53:11,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-17 10:53:11,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:11,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-17 10:53:11,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-12-17 10:53:11,889 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand 22 states. [2019-12-17 10:53:11,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:11,944 INFO L93 Difference]: Finished difference Result 46 states and 68 transitions. [2019-12-17 10:53:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-17 10:53:11,944 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-12-17 10:53:11,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:11,945 INFO L225 Difference]: With dead ends: 46 [2019-12-17 10:53:11,945 INFO L226 Difference]: Without dead ends: 46 [2019-12-17 10:53:11,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-12-17 10:53:11,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-17 10:53:11,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-17 10:53:11,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-17 10:53:11,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 68 transitions. [2019-12-17 10:53:11,950 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 68 transitions. Word has length 22 [2019-12-17 10:53:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:11,950 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 68 transitions. [2019-12-17 10:53:11,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-17 10:53:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 68 transitions. [2019-12-17 10:53:11,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-17 10:53:11,951 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:11,951 INFO L411 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1] [2019-12-17 10:53:12,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:12,160 INFO L410 AbstractCegarLoop]: === Iteration 20 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:12,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:12,160 INFO L82 PathProgramCache]: Analyzing trace with hash -515279270, now seen corresponding path program 19 times [2019-12-17 10:53:12,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:12,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649521864] [2019-12-17 10:53:12,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:12,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649521864] [2019-12-17 10:53:12,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394138492] [2019-12-17 10:53:12,412 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:12,460 INFO L264 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-17 10:53:12,462 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:12,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:12,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-17 10:53:12,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894862911] [2019-12-17 10:53:12,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-17 10:53:12,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:12,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-17 10:53:12,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-12-17 10:53:12,498 INFO L87 Difference]: Start difference. First operand 46 states and 68 transitions. Second operand 23 states. [2019-12-17 10:53:12,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:12,579 INFO L93 Difference]: Finished difference Result 48 states and 71 transitions. [2019-12-17 10:53:12,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-17 10:53:12,579 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-12-17 10:53:12,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:12,580 INFO L225 Difference]: With dead ends: 48 [2019-12-17 10:53:12,580 INFO L226 Difference]: Without dead ends: 48 [2019-12-17 10:53:12,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-12-17 10:53:12,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-17 10:53:12,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-17 10:53:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-17 10:53:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2019-12-17 10:53:12,590 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 23 [2019-12-17 10:53:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:12,591 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2019-12-17 10:53:12,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-17 10:53:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2019-12-17 10:53:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-17 10:53:12,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:12,595 INFO L411 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1] [2019-12-17 10:53:12,795 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:12,795 INFO L410 AbstractCegarLoop]: === Iteration 21 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:12,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:12,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1206211961, now seen corresponding path program 20 times [2019-12-17 10:53:12,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:12,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632150499] [2019-12-17 10:53:12,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:13,054 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:13,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632150499] [2019-12-17 10:53:13,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748877516] [2019-12-17 10:53:13,055 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:13,089 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:53:13,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:13,090 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-17 10:53:13,092 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:13,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:13,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-17 10:53:13,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354497240] [2019-12-17 10:53:13,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-17 10:53:13,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:13,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-17 10:53:13,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-12-17 10:53:13,119 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand 24 states. [2019-12-17 10:53:13,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:13,159 INFO L93 Difference]: Finished difference Result 50 states and 74 transitions. [2019-12-17 10:53:13,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-17 10:53:13,160 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-12-17 10:53:13,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:13,160 INFO L225 Difference]: With dead ends: 50 [2019-12-17 10:53:13,160 INFO L226 Difference]: Without dead ends: 50 [2019-12-17 10:53:13,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-12-17 10:53:13,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-17 10:53:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-17 10:53:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-17 10:53:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 74 transitions. [2019-12-17 10:53:13,166 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 74 transitions. Word has length 24 [2019-12-17 10:53:13,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:13,167 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 74 transitions. [2019-12-17 10:53:13,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-17 10:53:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 74 transitions. [2019-12-17 10:53:13,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-17 10:53:13,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:13,167 INFO L411 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1] [2019-12-17 10:53:13,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:13,368 INFO L410 AbstractCegarLoop]: === Iteration 22 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:13,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:13,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1262134726, now seen corresponding path program 21 times [2019-12-17 10:53:13,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:13,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868930941] [2019-12-17 10:53:13,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:13,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868930941] [2019-12-17 10:53:13,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37574629] [2019-12-17 10:53:13,681 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:13,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-17 10:53:13,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:13,729 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-17 10:53:13,730 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:13,744 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:13,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:13,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-17 10:53:13,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797773361] [2019-12-17 10:53:13,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-17 10:53:13,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:13,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-17 10:53:13,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-12-17 10:53:13,746 INFO L87 Difference]: Start difference. First operand 50 states and 74 transitions. Second operand 25 states. [2019-12-17 10:53:13,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:13,795 INFO L93 Difference]: Finished difference Result 52 states and 77 transitions. [2019-12-17 10:53:13,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-17 10:53:13,795 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-12-17 10:53:13,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:13,796 INFO L225 Difference]: With dead ends: 52 [2019-12-17 10:53:13,796 INFO L226 Difference]: Without dead ends: 52 [2019-12-17 10:53:13,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-12-17 10:53:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-17 10:53:13,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-17 10:53:13,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-17 10:53:13,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2019-12-17 10:53:13,807 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 77 transitions. Word has length 25 [2019-12-17 10:53:13,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:13,807 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 77 transitions. [2019-12-17 10:53:13,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-17 10:53:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 77 transitions. [2019-12-17 10:53:13,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-17 10:53:13,808 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:13,808 INFO L411 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1] [2019-12-17 10:53:14,012 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:14,012 INFO L410 AbstractCegarLoop]: === Iteration 23 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash -471470695, now seen corresponding path program 22 times [2019-12-17 10:53:14,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:14,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967229549] [2019-12-17 10:53:14,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:14,330 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:14,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967229549] [2019-12-17 10:53:14,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861397437] [2019-12-17 10:53:14,331 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:14,360 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:53:14,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:14,361 INFO L264 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-17 10:53:14,362 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:14,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:14,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-17 10:53:14,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074637347] [2019-12-17 10:53:14,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-17 10:53:14,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:14,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-17 10:53:14,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-12-17 10:53:14,378 INFO L87 Difference]: Start difference. First operand 52 states and 77 transitions. Second operand 26 states. [2019-12-17 10:53:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:14,437 INFO L93 Difference]: Finished difference Result 54 states and 80 transitions. [2019-12-17 10:53:14,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-17 10:53:14,437 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-12-17 10:53:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:14,438 INFO L225 Difference]: With dead ends: 54 [2019-12-17 10:53:14,438 INFO L226 Difference]: Without dead ends: 54 [2019-12-17 10:53:14,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-12-17 10:53:14,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-17 10:53:14,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-12-17 10:53:14,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-17 10:53:14,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2019-12-17 10:53:14,441 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 26 [2019-12-17 10:53:14,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:14,441 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2019-12-17 10:53:14,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-17 10:53:14,442 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2019-12-17 10:53:14,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-17 10:53:14,443 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:14,443 INFO L411 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1] [2019-12-17 10:53:14,646 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:14,647 INFO L410 AbstractCegarLoop]: === Iteration 24 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:14,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1730689510, now seen corresponding path program 23 times [2019-12-17 10:53:14,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:14,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652028648] [2019-12-17 10:53:14,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:14,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652028648] [2019-12-17 10:53:14,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178532810] [2019-12-17 10:53:14,950 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:14,987 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-12-17 10:53:14,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:14,988 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-17 10:53:14,989 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:15,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:15,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-17 10:53:15,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631611376] [2019-12-17 10:53:15,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-17 10:53:15,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:15,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-17 10:53:15,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-12-17 10:53:15,007 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand 27 states. [2019-12-17 10:53:15,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:15,046 INFO L93 Difference]: Finished difference Result 56 states and 83 transitions. [2019-12-17 10:53:15,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-17 10:53:15,046 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-12-17 10:53:15,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:15,047 INFO L225 Difference]: With dead ends: 56 [2019-12-17 10:53:15,047 INFO L226 Difference]: Without dead ends: 56 [2019-12-17 10:53:15,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-12-17 10:53:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-17 10:53:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-17 10:53:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-17 10:53:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2019-12-17 10:53:15,050 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 83 transitions. Word has length 27 [2019-12-17 10:53:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:15,051 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 83 transitions. [2019-12-17 10:53:15,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-17 10:53:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 83 transitions. [2019-12-17 10:53:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-17 10:53:15,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:15,052 INFO L411 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1] [2019-12-17 10:53:15,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:15,255 INFO L410 AbstractCegarLoop]: === Iteration 25 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:15,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:15,256 INFO L82 PathProgramCache]: Analyzing trace with hash -2111767111, now seen corresponding path program 24 times [2019-12-17 10:53:15,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:15,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411172628] [2019-12-17 10:53:15,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:15,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411172628] [2019-12-17 10:53:15,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239179244] [2019-12-17 10:53:15,568 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:15,606 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-12-17 10:53:15,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:15,608 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-17 10:53:15,612 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:15,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:15,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-12-17 10:53:15,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543037867] [2019-12-17 10:53:15,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-17 10:53:15,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:15,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-17 10:53:15,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-12-17 10:53:15,634 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand 28 states. [2019-12-17 10:53:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:15,684 INFO L93 Difference]: Finished difference Result 58 states and 86 transitions. [2019-12-17 10:53:15,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-17 10:53:15,685 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-12-17 10:53:15,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:15,686 INFO L225 Difference]: With dead ends: 58 [2019-12-17 10:53:15,686 INFO L226 Difference]: Without dead ends: 58 [2019-12-17 10:53:15,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-12-17 10:53:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-17 10:53:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-17 10:53:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-17 10:53:15,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2019-12-17 10:53:15,689 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 28 [2019-12-17 10:53:15,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:15,689 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2019-12-17 10:53:15,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-17 10:53:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2019-12-17 10:53:15,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-17 10:53:15,690 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:15,690 INFO L411 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1] [2019-12-17 10:53:15,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:15,891 INFO L410 AbstractCegarLoop]: === Iteration 26 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:15,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:15,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1040270854, now seen corresponding path program 25 times [2019-12-17 10:53:15,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:15,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317305628] [2019-12-17 10:53:15,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:16,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317305628] [2019-12-17 10:53:16,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105467948] [2019-12-17 10:53:16,283 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:16,326 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-17 10:53:16,327 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:16,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:16,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-17 10:53:16,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274353491] [2019-12-17 10:53:16,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-17 10:53:16,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:16,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-17 10:53:16,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-12-17 10:53:16,342 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand 29 states. [2019-12-17 10:53:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:16,409 INFO L93 Difference]: Finished difference Result 60 states and 89 transitions. [2019-12-17 10:53:16,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-17 10:53:16,410 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-12-17 10:53:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:16,411 INFO L225 Difference]: With dead ends: 60 [2019-12-17 10:53:16,411 INFO L226 Difference]: Without dead ends: 60 [2019-12-17 10:53:16,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-12-17 10:53:16,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-17 10:53:16,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-12-17 10:53:16,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-17 10:53:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 89 transitions. [2019-12-17 10:53:16,421 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 89 transitions. Word has length 29 [2019-12-17 10:53:16,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:16,421 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 89 transitions. [2019-12-17 10:53:16,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-17 10:53:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 89 transitions. [2019-12-17 10:53:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-17 10:53:16,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:16,422 INFO L411 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1] [2019-12-17 10:53:16,623 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:16,623 INFO L410 AbstractCegarLoop]: === Iteration 27 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:16,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:16,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2111342041, now seen corresponding path program 26 times [2019-12-17 10:53:16,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:16,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876567537] [2019-12-17 10:53:16,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:17,041 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:17,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876567537] [2019-12-17 10:53:17,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277218310] [2019-12-17 10:53:17,042 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:17,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:53:17,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:17,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-17 10:53:17,102 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:17,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:17,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-12-17 10:53:17,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249915270] [2019-12-17 10:53:17,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-17 10:53:17,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:17,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-17 10:53:17,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-12-17 10:53:17,132 INFO L87 Difference]: Start difference. First operand 60 states and 89 transitions. Second operand 30 states. [2019-12-17 10:53:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:17,200 INFO L93 Difference]: Finished difference Result 62 states and 92 transitions. [2019-12-17 10:53:17,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-17 10:53:17,200 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-12-17 10:53:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:17,201 INFO L225 Difference]: With dead ends: 62 [2019-12-17 10:53:17,201 INFO L226 Difference]: Without dead ends: 62 [2019-12-17 10:53:17,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-12-17 10:53:17,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-17 10:53:17,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-17 10:53:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-17 10:53:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 92 transitions. [2019-12-17 10:53:17,204 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 92 transitions. Word has length 30 [2019-12-17 10:53:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:17,204 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 92 transitions. [2019-12-17 10:53:17,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-17 10:53:17,204 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 92 transitions. [2019-12-17 10:53:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-17 10:53:17,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:17,205 INFO L411 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1] [2019-12-17 10:53:17,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:17,409 INFO L410 AbstractCegarLoop]: === Iteration 28 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:17,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:17,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1027093978, now seen corresponding path program 27 times [2019-12-17 10:53:17,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:17,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149541823] [2019-12-17 10:53:17,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:17,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149541823] [2019-12-17 10:53:17,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52733902] [2019-12-17 10:53:17,767 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:17,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-12-17 10:53:17,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:17,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-17 10:53:17,816 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:17,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:17,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-12-17 10:53:17,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415694968] [2019-12-17 10:53:17,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-17 10:53:17,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:17,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-17 10:53:17,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-12-17 10:53:17,831 INFO L87 Difference]: Start difference. First operand 62 states and 92 transitions. Second operand 31 states. [2019-12-17 10:53:17,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:17,867 INFO L93 Difference]: Finished difference Result 64 states and 95 transitions. [2019-12-17 10:53:17,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-17 10:53:17,868 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-12-17 10:53:17,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:17,868 INFO L225 Difference]: With dead ends: 64 [2019-12-17 10:53:17,869 INFO L226 Difference]: Without dead ends: 64 [2019-12-17 10:53:17,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-12-17 10:53:17,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-17 10:53:17,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-17 10:53:17,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-17 10:53:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2019-12-17 10:53:17,871 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 31 [2019-12-17 10:53:17,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:17,872 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2019-12-17 10:53:17,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-17 10:53:17,872 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2019-12-17 10:53:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-17 10:53:17,872 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:17,873 INFO L411 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1] [2019-12-17 10:53:18,076 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:18,076 INFO L410 AbstractCegarLoop]: === Iteration 29 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:18,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:18,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1775142393, now seen corresponding path program 28 times [2019-12-17 10:53:18,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:18,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678000036] [2019-12-17 10:53:18,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:18,438 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:18,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678000036] [2019-12-17 10:53:18,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648820712] [2019-12-17 10:53:18,439 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:18,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:53:18,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:18,476 INFO L264 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-17 10:53:18,477 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:18,488 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:18,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:18,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-17 10:53:18,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019877364] [2019-12-17 10:53:18,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-17 10:53:18,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:18,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-17 10:53:18,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-12-17 10:53:18,491 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand 32 states. [2019-12-17 10:53:18,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:18,586 INFO L93 Difference]: Finished difference Result 66 states and 98 transitions. [2019-12-17 10:53:18,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-17 10:53:18,586 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-12-17 10:53:18,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:18,587 INFO L225 Difference]: With dead ends: 66 [2019-12-17 10:53:18,587 INFO L226 Difference]: Without dead ends: 66 [2019-12-17 10:53:18,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-12-17 10:53:18,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-17 10:53:18,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-17 10:53:18,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-17 10:53:18,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-12-17 10:53:18,590 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 32 [2019-12-17 10:53:18,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:18,590 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-12-17 10:53:18,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-17 10:53:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-12-17 10:53:18,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-17 10:53:18,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:18,591 INFO L411 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1] [2019-12-17 10:53:18,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:18,794 INFO L410 AbstractCegarLoop]: === Iteration 30 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:18,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:18,795 INFO L82 PathProgramCache]: Analyzing trace with hash -805160518, now seen corresponding path program 29 times [2019-12-17 10:53:18,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:18,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72106926] [2019-12-17 10:53:18,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:19,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72106926] [2019-12-17 10:53:19,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763721368] [2019-12-17 10:53:19,200 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:19,243 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-12-17 10:53:19,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:19,244 INFO L264 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-17 10:53:19,245 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:19,282 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:19,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:19,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-12-17 10:53:19,283 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33473509] [2019-12-17 10:53:19,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-17 10:53:19,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:19,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-17 10:53:19,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-12-17 10:53:19,285 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 33 states. [2019-12-17 10:53:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:19,323 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2019-12-17 10:53:19,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-17 10:53:19,324 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-12-17 10:53:19,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:19,324 INFO L225 Difference]: With dead ends: 68 [2019-12-17 10:53:19,324 INFO L226 Difference]: Without dead ends: 68 [2019-12-17 10:53:19,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-12-17 10:53:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-17 10:53:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-17 10:53:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-17 10:53:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2019-12-17 10:53:19,328 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 33 [2019-12-17 10:53:19,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:19,328 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2019-12-17 10:53:19,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-17 10:53:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2019-12-17 10:53:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-17 10:53:19,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:19,329 INFO L411 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1] [2019-12-17 10:53:19,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:19,532 INFO L410 AbstractCegarLoop]: === Iteration 31 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:19,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:19,533 INFO L82 PathProgramCache]: Analyzing trace with hash 809827865, now seen corresponding path program 30 times [2019-12-17 10:53:19,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:19,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27686935] [2019-12-17 10:53:19,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:19,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27686935] [2019-12-17 10:53:19,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430681797] [2019-12-17 10:53:19,938 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:19,983 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-12-17 10:53:19,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:19,985 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-17 10:53:19,986 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:19,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:19,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-17 10:53:19,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304906234] [2019-12-17 10:53:19,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-17 10:53:19,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:20,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-17 10:53:20,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-12-17 10:53:20,001 INFO L87 Difference]: Start difference. First operand 68 states and 101 transitions. Second operand 34 states. [2019-12-17 10:53:20,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:20,082 INFO L93 Difference]: Finished difference Result 70 states and 104 transitions. [2019-12-17 10:53:20,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-17 10:53:20,082 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-12-17 10:53:20,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:20,083 INFO L225 Difference]: With dead ends: 70 [2019-12-17 10:53:20,083 INFO L226 Difference]: Without dead ends: 70 [2019-12-17 10:53:20,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-12-17 10:53:20,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-17 10:53:20,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-17 10:53:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-17 10:53:20,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 104 transitions. [2019-12-17 10:53:20,087 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 104 transitions. Word has length 34 [2019-12-17 10:53:20,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:20,087 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 104 transitions. [2019-12-17 10:53:20,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-17 10:53:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2019-12-17 10:53:20,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-17 10:53:20,088 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:20,088 INFO L411 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1] [2019-12-17 10:53:20,291 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:20,291 INFO L410 AbstractCegarLoop]: === Iteration 32 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:20,292 INFO L82 PathProgramCache]: Analyzing trace with hash -665139814, now seen corresponding path program 31 times [2019-12-17 10:53:20,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:20,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829433128] [2019-12-17 10:53:20,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:20,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829433128] [2019-12-17 10:53:20,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893660337] [2019-12-17 10:53:20,734 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:20,767 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-17 10:53:20,767 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:20,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:20,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-12-17 10:53:20,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994595551] [2019-12-17 10:53:20,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-17 10:53:20,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:20,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-17 10:53:20,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-12-17 10:53:20,781 INFO L87 Difference]: Start difference. First operand 70 states and 104 transitions. Second operand 35 states. [2019-12-17 10:53:20,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:20,858 INFO L93 Difference]: Finished difference Result 72 states and 107 transitions. [2019-12-17 10:53:20,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-17 10:53:20,859 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-12-17 10:53:20,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:20,860 INFO L225 Difference]: With dead ends: 72 [2019-12-17 10:53:20,860 INFO L226 Difference]: Without dead ends: 72 [2019-12-17 10:53:20,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-12-17 10:53:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-17 10:53:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-12-17 10:53:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-17 10:53:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 107 transitions. [2019-12-17 10:53:20,863 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 107 transitions. Word has length 35 [2019-12-17 10:53:20,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:20,864 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 107 transitions. [2019-12-17 10:53:20,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-17 10:53:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 107 transitions. [2019-12-17 10:53:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-17 10:53:20,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:20,865 INFO L411 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1] [2019-12-17 10:53:21,065 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:21,065 INFO L410 AbstractCegarLoop]: === Iteration 33 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:21,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:21,066 INFO L82 PathProgramCache]: Analyzing trace with hash 855502393, now seen corresponding path program 32 times [2019-12-17 10:53:21,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:21,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587091266] [2019-12-17 10:53:21,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:21,541 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:21,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587091266] [2019-12-17 10:53:21,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014262733] [2019-12-17 10:53:21,542 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:21,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:53:21,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:21,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-17 10:53:21,585 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:21,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:21,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-17 10:53:21,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432705860] [2019-12-17 10:53:21,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-17 10:53:21,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:21,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-17 10:53:21,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-12-17 10:53:21,599 INFO L87 Difference]: Start difference. First operand 72 states and 107 transitions. Second operand 36 states. [2019-12-17 10:53:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:21,681 INFO L93 Difference]: Finished difference Result 74 states and 110 transitions. [2019-12-17 10:53:21,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-17 10:53:21,681 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-12-17 10:53:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:21,682 INFO L225 Difference]: With dead ends: 74 [2019-12-17 10:53:21,682 INFO L226 Difference]: Without dead ends: 74 [2019-12-17 10:53:21,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-12-17 10:53:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-17 10:53:21,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-17 10:53:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-17 10:53:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 110 transitions. [2019-12-17 10:53:21,685 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 110 transitions. Word has length 36 [2019-12-17 10:53:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:21,685 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 110 transitions. [2019-12-17 10:53:21,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-17 10:53:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 110 transitions. [2019-12-17 10:53:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-17 10:53:21,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:21,686 INFO L411 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1] [2019-12-17 10:53:21,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:21,889 INFO L410 AbstractCegarLoop]: === Iteration 34 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:21,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:21,890 INFO L82 PathProgramCache]: Analyzing trace with hash 750770554, now seen corresponding path program 33 times [2019-12-17 10:53:21,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:21,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630484552] [2019-12-17 10:53:21,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:22,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630484552] [2019-12-17 10:53:22,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513710038] [2019-12-17 10:53:22,625 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:22,681 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-12-17 10:53:22,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:22,682 INFO L264 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-17 10:53:22,683 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:22,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:22,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-17 10:53:22,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759459560] [2019-12-17 10:53:22,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-17 10:53:22,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:22,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-17 10:53:22,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-12-17 10:53:22,711 INFO L87 Difference]: Start difference. First operand 74 states and 110 transitions. Second operand 37 states. [2019-12-17 10:53:22,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:22,790 INFO L93 Difference]: Finished difference Result 76 states and 113 transitions. [2019-12-17 10:53:22,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-17 10:53:22,790 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-12-17 10:53:22,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:22,791 INFO L225 Difference]: With dead ends: 76 [2019-12-17 10:53:22,791 INFO L226 Difference]: Without dead ends: 76 [2019-12-17 10:53:22,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-12-17 10:53:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-17 10:53:22,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-12-17 10:53:22,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-17 10:53:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 113 transitions. [2019-12-17 10:53:22,794 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 113 transitions. Word has length 37 [2019-12-17 10:53:22,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:22,794 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 113 transitions. [2019-12-17 10:53:22,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-17 10:53:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 113 transitions. [2019-12-17 10:53:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-17 10:53:22,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:22,795 INFO L411 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1] [2019-12-17 10:53:22,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:22,998 INFO L410 AbstractCegarLoop]: === Iteration 35 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:22,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1799050841, now seen corresponding path program 34 times [2019-12-17 10:53:22,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:22,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042099655] [2019-12-17 10:53:22,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:23,495 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:23,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042099655] [2019-12-17 10:53:23,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379915970] [2019-12-17 10:53:23,496 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:23,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:53:23,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:23,533 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-17 10:53:23,533 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:23,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:23,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-12-17 10:53:23,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217134738] [2019-12-17 10:53:23,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-17 10:53:23,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:23,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-17 10:53:23,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-12-17 10:53:23,549 INFO L87 Difference]: Start difference. First operand 76 states and 113 transitions. Second operand 38 states. [2019-12-17 10:53:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:23,646 INFO L93 Difference]: Finished difference Result 78 states and 116 transitions. [2019-12-17 10:53:23,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-17 10:53:23,646 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-12-17 10:53:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:23,647 INFO L225 Difference]: With dead ends: 78 [2019-12-17 10:53:23,647 INFO L226 Difference]: Without dead ends: 78 [2019-12-17 10:53:23,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-12-17 10:53:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-17 10:53:23,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-17 10:53:23,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-17 10:53:23,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 116 transitions. [2019-12-17 10:53:23,650 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 116 transitions. Word has length 38 [2019-12-17 10:53:23,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:23,651 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 116 transitions. [2019-12-17 10:53:23,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-17 10:53:23,651 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 116 transitions. [2019-12-17 10:53:23,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-17 10:53:23,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:23,652 INFO L411 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1] [2019-12-17 10:53:23,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:23,853 INFO L410 AbstractCegarLoop]: === Iteration 36 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:23,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:23,854 INFO L82 PathProgramCache]: Analyzing trace with hash -63998630, now seen corresponding path program 35 times [2019-12-17 10:53:23,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:23,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364466195] [2019-12-17 10:53:23,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:24,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364466195] [2019-12-17 10:53:24,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467188424] [2019-12-17 10:53:24,390 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:24,432 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-12-17 10:53:24,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:24,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-17 10:53:24,435 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:24,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:24,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-17 10:53:24,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594482646] [2019-12-17 10:53:24,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-17 10:53:24,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:24,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-17 10:53:24,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-12-17 10:53:24,456 INFO L87 Difference]: Start difference. First operand 78 states and 116 transitions. Second operand 39 states. [2019-12-17 10:53:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:24,538 INFO L93 Difference]: Finished difference Result 80 states and 119 transitions. [2019-12-17 10:53:24,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-17 10:53:24,538 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-12-17 10:53:24,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:24,539 INFO L225 Difference]: With dead ends: 80 [2019-12-17 10:53:24,539 INFO L226 Difference]: Without dead ends: 80 [2019-12-17 10:53:24,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-12-17 10:53:24,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-17 10:53:24,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-12-17 10:53:24,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-17 10:53:24,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 119 transitions. [2019-12-17 10:53:24,543 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 119 transitions. Word has length 39 [2019-12-17 10:53:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:24,543 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 119 transitions. [2019-12-17 10:53:24,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-17 10:53:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 119 transitions. [2019-12-17 10:53:24,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-17 10:53:24,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:24,544 INFO L411 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1] [2019-12-17 10:53:24,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:24,745 INFO L410 AbstractCegarLoop]: === Iteration 37 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:24,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1983957383, now seen corresponding path program 36 times [2019-12-17 10:53:24,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:24,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822922751] [2019-12-17 10:53:24,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:25,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822922751] [2019-12-17 10:53:25,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675857712] [2019-12-17 10:53:25,290 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:25,339 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-12-17 10:53:25,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:25,341 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-17 10:53:25,342 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:25,359 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:25,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:25,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-12-17 10:53:25,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771381446] [2019-12-17 10:53:25,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-17 10:53:25,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:25,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-17 10:53:25,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-12-17 10:53:25,362 INFO L87 Difference]: Start difference. First operand 80 states and 119 transitions. Second operand 40 states. [2019-12-17 10:53:25,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:25,441 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-12-17 10:53:25,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-17 10:53:25,442 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-12-17 10:53:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:25,443 INFO L225 Difference]: With dead ends: 82 [2019-12-17 10:53:25,443 INFO L226 Difference]: Without dead ends: 82 [2019-12-17 10:53:25,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-12-17 10:53:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-17 10:53:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-12-17 10:53:25,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-17 10:53:25,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2019-12-17 10:53:25,447 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 122 transitions. Word has length 40 [2019-12-17 10:53:25,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:25,448 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 122 transitions. [2019-12-17 10:53:25,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-17 10:53:25,448 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 122 transitions. [2019-12-17 10:53:25,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-17 10:53:25,448 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:25,448 INFO L411 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1] [2019-12-17 10:53:25,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:25,652 INFO L410 AbstractCegarLoop]: === Iteration 38 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:25,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:25,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1373136582, now seen corresponding path program 37 times [2019-12-17 10:53:25,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:25,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316731843] [2019-12-17 10:53:25,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:26,224 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:26,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316731843] [2019-12-17 10:53:26,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484046962] [2019-12-17 10:53:26,225 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:26,264 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-17 10:53:26,265 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:26,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:26,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-12-17 10:53:26,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600331921] [2019-12-17 10:53:26,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-17 10:53:26,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:26,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-17 10:53:26,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-12-17 10:53:26,293 INFO L87 Difference]: Start difference. First operand 82 states and 122 transitions. Second operand 41 states. [2019-12-17 10:53:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:26,355 INFO L93 Difference]: Finished difference Result 84 states and 125 transitions. [2019-12-17 10:53:26,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-17 10:53:26,356 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-12-17 10:53:26,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:26,357 INFO L225 Difference]: With dead ends: 84 [2019-12-17 10:53:26,357 INFO L226 Difference]: Without dead ends: 84 [2019-12-17 10:53:26,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-12-17 10:53:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-17 10:53:26,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-12-17 10:53:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-17 10:53:26,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 125 transitions. [2019-12-17 10:53:26,361 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 125 transitions. Word has length 41 [2019-12-17 10:53:26,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:26,361 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 125 transitions. [2019-12-17 10:53:26,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-17 10:53:26,362 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 125 transitions. [2019-12-17 10:53:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-17 10:53:26,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:26,362 INFO L411 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1] [2019-12-17 10:53:26,565 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:26,565 INFO L410 AbstractCegarLoop]: === Iteration 39 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:26,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:26,566 INFO L82 PathProgramCache]: Analyzing trace with hash 382439065, now seen corresponding path program 38 times [2019-12-17 10:53:26,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:26,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192496181] [2019-12-17 10:53:26,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:27,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192496181] [2019-12-17 10:53:27,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678077329] [2019-12-17 10:53:27,193 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:27,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:53:27,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:27,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-17 10:53:27,232 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:27,244 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:27,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:27,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-17 10:53:27,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242674519] [2019-12-17 10:53:27,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-17 10:53:27,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:27,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-17 10:53:27,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-12-17 10:53:27,246 INFO L87 Difference]: Start difference. First operand 84 states and 125 transitions. Second operand 42 states. [2019-12-17 10:53:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:27,333 INFO L93 Difference]: Finished difference Result 86 states and 128 transitions. [2019-12-17 10:53:27,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-17 10:53:27,333 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-12-17 10:53:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:27,334 INFO L225 Difference]: With dead ends: 86 [2019-12-17 10:53:27,334 INFO L226 Difference]: Without dead ends: 86 [2019-12-17 10:53:27,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-12-17 10:53:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-17 10:53:27,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-17 10:53:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-17 10:53:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 128 transitions. [2019-12-17 10:53:27,337 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 128 transitions. Word has length 42 [2019-12-17 10:53:27,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:27,337 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 128 transitions. [2019-12-17 10:53:27,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-17 10:53:27,338 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 128 transitions. [2019-12-17 10:53:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-17 10:53:27,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:27,338 INFO L411 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1] [2019-12-17 10:53:27,541 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:27,542 INFO L410 AbstractCegarLoop]: === Iteration 40 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:27,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:27,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1029290726, now seen corresponding path program 39 times [2019-12-17 10:53:27,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:27,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040555811] [2019-12-17 10:53:27,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:28,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040555811] [2019-12-17 10:53:28,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639690633] [2019-12-17 10:53:28,480 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:28,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-12-17 10:53:28,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:28,537 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-17 10:53:28,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:28,552 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:28,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:28,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-12-17 10:53:28,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590515148] [2019-12-17 10:53:28,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-17 10:53:28,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:28,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-17 10:53:28,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-12-17 10:53:28,554 INFO L87 Difference]: Start difference. First operand 86 states and 128 transitions. Second operand 43 states. [2019-12-17 10:53:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:28,631 INFO L93 Difference]: Finished difference Result 88 states and 131 transitions. [2019-12-17 10:53:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-17 10:53:28,632 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-12-17 10:53:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:28,633 INFO L225 Difference]: With dead ends: 88 [2019-12-17 10:53:28,633 INFO L226 Difference]: Without dead ends: 88 [2019-12-17 10:53:28,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-12-17 10:53:28,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-17 10:53:28,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-12-17 10:53:28,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-17 10:53:28,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 131 transitions. [2019-12-17 10:53:28,637 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 131 transitions. Word has length 43 [2019-12-17 10:53:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:28,637 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 131 transitions. [2019-12-17 10:53:28,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-17 10:53:28,637 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 131 transitions. [2019-12-17 10:53:28,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-17 10:53:28,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:28,638 INFO L411 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1] [2019-12-17 10:53:28,840 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:28,841 INFO L410 AbstractCegarLoop]: === Iteration 41 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:28,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:28,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1843241287, now seen corresponding path program 40 times [2019-12-17 10:53:28,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:28,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959693355] [2019-12-17 10:53:28,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:29,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959693355] [2019-12-17 10:53:29,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361728306] [2019-12-17 10:53:29,558 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:29,600 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:53:29,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:29,601 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-17 10:53:29,602 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:29,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:29,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-12-17 10:53:29,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331784789] [2019-12-17 10:53:29,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-12-17 10:53:29,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:29,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-12-17 10:53:29,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-12-17 10:53:29,622 INFO L87 Difference]: Start difference. First operand 88 states and 131 transitions. Second operand 44 states. [2019-12-17 10:53:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:29,688 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-12-17 10:53:29,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-17 10:53:29,688 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-12-17 10:53:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:29,689 INFO L225 Difference]: With dead ends: 90 [2019-12-17 10:53:29,689 INFO L226 Difference]: Without dead ends: 90 [2019-12-17 10:53:29,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-12-17 10:53:29,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-17 10:53:29,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-17 10:53:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-17 10:53:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 134 transitions. [2019-12-17 10:53:29,693 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 134 transitions. Word has length 44 [2019-12-17 10:53:29,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:29,693 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 134 transitions. [2019-12-17 10:53:29,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-12-17 10:53:29,693 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 134 transitions. [2019-12-17 10:53:29,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-17 10:53:29,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:29,694 INFO L411 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1] [2019-12-17 10:53:29,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:29,897 INFO L410 AbstractCegarLoop]: === Iteration 42 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:29,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:29,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1305904902, now seen corresponding path program 41 times [2019-12-17 10:53:29,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:29,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731929702] [2019-12-17 10:53:29,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:31,024 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:31,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731929702] [2019-12-17 10:53:31,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694052818] [2019-12-17 10:53:31,025 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:31,072 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2019-12-17 10:53:31,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:31,074 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-17 10:53:31,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:31,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:31,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-12-17 10:53:31,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249482570] [2019-12-17 10:53:31,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-12-17 10:53:31,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:31,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-12-17 10:53:31,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-12-17 10:53:31,090 INFO L87 Difference]: Start difference. First operand 90 states and 134 transitions. Second operand 45 states. [2019-12-17 10:53:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:31,185 INFO L93 Difference]: Finished difference Result 92 states and 137 transitions. [2019-12-17 10:53:31,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-17 10:53:31,185 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-12-17 10:53:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:31,186 INFO L225 Difference]: With dead ends: 92 [2019-12-17 10:53:31,186 INFO L226 Difference]: Without dead ends: 92 [2019-12-17 10:53:31,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-12-17 10:53:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-17 10:53:31,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-12-17 10:53:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-17 10:53:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2019-12-17 10:53:31,189 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 45 [2019-12-17 10:53:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:31,190 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2019-12-17 10:53:31,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-12-17 10:53:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2019-12-17 10:53:31,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-17 10:53:31,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:31,191 INFO L411 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1] [2019-12-17 10:53:31,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:31,394 INFO L410 AbstractCegarLoop]: === Iteration 43 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1828346151, now seen corresponding path program 42 times [2019-12-17 10:53:31,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:31,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786374910] [2019-12-17 10:53:31,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:32,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786374910] [2019-12-17 10:53:32,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470954557] [2019-12-17 10:53:32,247 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:32,313 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2019-12-17 10:53:32,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:32,314 INFO L264 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-17 10:53:32,315 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:32,327 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:32,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:32,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2019-12-17 10:53:32,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975926622] [2019-12-17 10:53:32,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-12-17 10:53:32,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:32,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-12-17 10:53:32,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-12-17 10:53:32,329 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand 46 states. [2019-12-17 10:53:32,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:32,403 INFO L93 Difference]: Finished difference Result 94 states and 140 transitions. [2019-12-17 10:53:32,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-17 10:53:32,403 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-12-17 10:53:32,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:32,404 INFO L225 Difference]: With dead ends: 94 [2019-12-17 10:53:32,404 INFO L226 Difference]: Without dead ends: 94 [2019-12-17 10:53:32,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-12-17 10:53:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-17 10:53:32,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-12-17 10:53:32,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-17 10:53:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2019-12-17 10:53:32,407 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 46 [2019-12-17 10:53:32,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:32,408 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2019-12-17 10:53:32,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-12-17 10:53:32,408 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2019-12-17 10:53:32,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-17 10:53:32,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:32,409 INFO L411 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1] [2019-12-17 10:53:32,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:32,612 INFO L410 AbstractCegarLoop]: === Iteration 44 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:32,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:32,612 INFO L82 PathProgramCache]: Analyzing trace with hash -844155686, now seen corresponding path program 43 times [2019-12-17 10:53:32,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:32,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290499293] [2019-12-17 10:53:32,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:33,327 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:33,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290499293] [2019-12-17 10:53:33,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033203234] [2019-12-17 10:53:33,328 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:33,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-17 10:53:33,371 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:33,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:33,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-12-17 10:53:33,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903465377] [2019-12-17 10:53:33,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-12-17 10:53:33,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:33,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-12-17 10:53:33,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-12-17 10:53:33,395 INFO L87 Difference]: Start difference. First operand 94 states and 140 transitions. Second operand 47 states. [2019-12-17 10:53:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:33,492 INFO L93 Difference]: Finished difference Result 96 states and 143 transitions. [2019-12-17 10:53:33,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-17 10:53:33,493 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-12-17 10:53:33,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:33,494 INFO L225 Difference]: With dead ends: 96 [2019-12-17 10:53:33,494 INFO L226 Difference]: Without dead ends: 96 [2019-12-17 10:53:33,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-12-17 10:53:33,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-17 10:53:33,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-12-17 10:53:33,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-17 10:53:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 143 transitions. [2019-12-17 10:53:33,497 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 143 transitions. Word has length 47 [2019-12-17 10:53:33,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:33,498 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 143 transitions. [2019-12-17 10:53:33,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-12-17 10:53:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 143 transitions. [2019-12-17 10:53:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-17 10:53:33,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:33,499 INFO L411 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1] [2019-12-17 10:53:33,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:33,702 INFO L410 AbstractCegarLoop]: === Iteration 45 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:33,702 INFO L82 PathProgramCache]: Analyzing trace with hash -399022343, now seen corresponding path program 44 times [2019-12-17 10:53:33,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:33,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580157554] [2019-12-17 10:53:33,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:33,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:34,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580157554] [2019-12-17 10:53:34,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930564278] [2019-12-17 10:53:34,599 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:34,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:53:34,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:34,639 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 46 conjunts are in the unsatisfiable core [2019-12-17 10:53:34,640 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:34,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:34,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-12-17 10:53:34,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396805815] [2019-12-17 10:53:34,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-12-17 10:53:34,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:34,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-12-17 10:53:34,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-12-17 10:53:34,660 INFO L87 Difference]: Start difference. First operand 96 states and 143 transitions. Second operand 48 states. [2019-12-17 10:53:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:34,819 INFO L93 Difference]: Finished difference Result 98 states and 146 transitions. [2019-12-17 10:53:34,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-17 10:53:34,819 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-12-17 10:53:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:34,820 INFO L225 Difference]: With dead ends: 98 [2019-12-17 10:53:34,820 INFO L226 Difference]: Without dead ends: 98 [2019-12-17 10:53:34,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-12-17 10:53:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-17 10:53:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-12-17 10:53:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-17 10:53:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 146 transitions. [2019-12-17 10:53:34,823 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 146 transitions. Word has length 48 [2019-12-17 10:53:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:34,824 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 146 transitions. [2019-12-17 10:53:34,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-12-17 10:53:34,824 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 146 transitions. [2019-12-17 10:53:34,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-17 10:53:34,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:34,825 INFO L411 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1] [2019-12-17 10:53:35,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:35,028 INFO L410 AbstractCegarLoop]: === Iteration 46 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:35,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:35,028 INFO L82 PathProgramCache]: Analyzing trace with hash 515209402, now seen corresponding path program 45 times [2019-12-17 10:53:35,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:35,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640395847] [2019-12-17 10:53:35,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:35,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640395847] [2019-12-17 10:53:35,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467650452] [2019-12-17 10:53:35,819 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:35,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-12-17 10:53:35,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:35,877 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 47 conjunts are in the unsatisfiable core [2019-12-17 10:53:35,878 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:35,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:35,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:35,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-12-17 10:53:35,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990074872] [2019-12-17 10:53:35,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-17 10:53:35,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:35,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-17 10:53:35,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-12-17 10:53:35,894 INFO L87 Difference]: Start difference. First operand 98 states and 146 transitions. Second operand 49 states. [2019-12-17 10:53:35,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:35,981 INFO L93 Difference]: Finished difference Result 100 states and 149 transitions. [2019-12-17 10:53:35,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-17 10:53:35,981 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-12-17 10:53:35,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:35,982 INFO L225 Difference]: With dead ends: 100 [2019-12-17 10:53:35,982 INFO L226 Difference]: Without dead ends: 100 [2019-12-17 10:53:35,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-12-17 10:53:35,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-17 10:53:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-17 10:53:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-17 10:53:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 149 transitions. [2019-12-17 10:53:35,985 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 149 transitions. Word has length 49 [2019-12-17 10:53:35,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:35,985 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 149 transitions. [2019-12-17 10:53:35,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-17 10:53:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 149 transitions. [2019-12-17 10:53:35,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-17 10:53:35,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:35,986 INFO L411 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1] [2019-12-17 10:53:36,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:36,187 INFO L410 AbstractCegarLoop]: === Iteration 47 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:36,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:36,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1208377575, now seen corresponding path program 46 times [2019-12-17 10:53:36,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:36,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362408227] [2019-12-17 10:53:36,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:37,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362408227] [2019-12-17 10:53:37,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167512346] [2019-12-17 10:53:37,031 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:37,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:53:37,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:37,077 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-17 10:53:37,078 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:37,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:37,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-12-17 10:53:37,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439874941] [2019-12-17 10:53:37,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-12-17 10:53:37,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:37,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-12-17 10:53:37,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-12-17 10:53:37,095 INFO L87 Difference]: Start difference. First operand 100 states and 149 transitions. Second operand 50 states. [2019-12-17 10:53:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:37,166 INFO L93 Difference]: Finished difference Result 102 states and 152 transitions. [2019-12-17 10:53:37,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-17 10:53:37,166 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-12-17 10:53:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:37,167 INFO L225 Difference]: With dead ends: 102 [2019-12-17 10:53:37,167 INFO L226 Difference]: Without dead ends: 102 [2019-12-17 10:53:37,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-12-17 10:53:37,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-17 10:53:37,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-17 10:53:37,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-17 10:53:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 152 transitions. [2019-12-17 10:53:37,170 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 152 transitions. Word has length 50 [2019-12-17 10:53:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:37,171 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 152 transitions. [2019-12-17 10:53:37,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-12-17 10:53:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 152 transitions. [2019-12-17 10:53:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-17 10:53:37,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:37,172 INFO L411 BasicCegarLoop]: trace histogram [47, 1, 1, 1, 1] [2019-12-17 10:53:37,374 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:37,375 INFO L410 AbstractCegarLoop]: === Iteration 48 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:37,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:37,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1195000986, now seen corresponding path program 47 times [2019-12-17 10:53:37,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:37,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271982995] [2019-12-17 10:53:37,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:38,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:38,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271982995] [2019-12-17 10:53:38,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740652653] [2019-12-17 10:53:38,383 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:38,434 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-12-17 10:53:38,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:38,436 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 49 conjunts are in the unsatisfiable core [2019-12-17 10:53:38,438 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:38,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:38,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:38,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-12-17 10:53:38,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007554828] [2019-12-17 10:53:38,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-12-17 10:53:38,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:38,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-12-17 10:53:38,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-12-17 10:53:38,454 INFO L87 Difference]: Start difference. First operand 102 states and 152 transitions. Second operand 51 states. [2019-12-17 10:53:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:38,601 INFO L93 Difference]: Finished difference Result 104 states and 155 transitions. [2019-12-17 10:53:38,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-12-17 10:53:38,602 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-12-17 10:53:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:38,603 INFO L225 Difference]: With dead ends: 104 [2019-12-17 10:53:38,603 INFO L226 Difference]: Without dead ends: 104 [2019-12-17 10:53:38,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-12-17 10:53:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-12-17 10:53:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-12-17 10:53:38,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-12-17 10:53:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2019-12-17 10:53:38,607 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 51 [2019-12-17 10:53:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:38,608 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2019-12-17 10:53:38,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-12-17 10:53:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2019-12-17 10:53:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-17 10:53:38,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:38,608 INFO L411 BasicCegarLoop]: trace histogram [48, 1, 1, 1, 1] [2019-12-17 10:53:38,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:38,812 INFO L410 AbstractCegarLoop]: === Iteration 49 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:38,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:38,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1609674951, now seen corresponding path program 48 times [2019-12-17 10:53:38,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:38,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069297814] [2019-12-17 10:53:38,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:39,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:39,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069297814] [2019-12-17 10:53:39,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899227819] [2019-12-17 10:53:39,720 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:39,781 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-12-17 10:53:39,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:39,783 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 50 conjunts are in the unsatisfiable core [2019-12-17 10:53:39,784 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:39,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:39,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 51 [2019-12-17 10:53:39,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035746408] [2019-12-17 10:53:39,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-12-17 10:53:39,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:39,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-12-17 10:53:39,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-12-17 10:53:39,803 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand 52 states. [2019-12-17 10:53:39,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:39,948 INFO L93 Difference]: Finished difference Result 106 states and 158 transitions. [2019-12-17 10:53:39,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-17 10:53:39,948 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-12-17 10:53:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:39,949 INFO L225 Difference]: With dead ends: 106 [2019-12-17 10:53:39,950 INFO L226 Difference]: Without dead ends: 106 [2019-12-17 10:53:39,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-12-17 10:53:39,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-12-17 10:53:39,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-12-17 10:53:39,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-17 10:53:39,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 158 transitions. [2019-12-17 10:53:39,954 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 158 transitions. Word has length 52 [2019-12-17 10:53:39,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:39,954 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 158 transitions. [2019-12-17 10:53:39,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-12-17 10:53:39,955 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 158 transitions. [2019-12-17 10:53:39,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-17 10:53:39,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:39,955 INFO L411 BasicCegarLoop]: trace histogram [49, 1, 1, 1, 1] [2019-12-17 10:53:40,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:40,159 INFO L410 AbstractCegarLoop]: === Iteration 50 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:40,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:40,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1639684218, now seen corresponding path program 49 times [2019-12-17 10:53:40,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:40,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533657967] [2019-12-17 10:53:40,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:41,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533657967] [2019-12-17 10:53:41,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233361312] [2019-12-17 10:53:41,125 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:41,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:41,169 INFO L264 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-17 10:53:41,170 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:41,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:41,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:41,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 52 [2019-12-17 10:53:41,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146422401] [2019-12-17 10:53:41,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-12-17 10:53:41,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:41,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-12-17 10:53:41,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-12-17 10:53:41,184 INFO L87 Difference]: Start difference. First operand 106 states and 158 transitions. Second operand 53 states. [2019-12-17 10:53:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:41,266 INFO L93 Difference]: Finished difference Result 108 states and 161 transitions. [2019-12-17 10:53:41,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-17 10:53:41,267 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-12-17 10:53:41,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:41,268 INFO L225 Difference]: With dead ends: 108 [2019-12-17 10:53:41,268 INFO L226 Difference]: Without dead ends: 108 [2019-12-17 10:53:41,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-12-17 10:53:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-17 10:53:41,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-12-17 10:53:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-12-17 10:53:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 161 transitions. [2019-12-17 10:53:41,272 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 161 transitions. Word has length 53 [2019-12-17 10:53:41,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:41,272 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 161 transitions. [2019-12-17 10:53:41,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-12-17 10:53:41,273 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 161 transitions. [2019-12-17 10:53:41,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-17 10:53:41,273 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:41,273 INFO L411 BasicCegarLoop]: trace histogram [50, 1, 1, 1, 1] [2019-12-17 10:53:41,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:41,476 INFO L410 AbstractCegarLoop]: === Iteration 51 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:41,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:41,477 INFO L82 PathProgramCache]: Analyzing trace with hash -709396647, now seen corresponding path program 50 times [2019-12-17 10:53:41,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:41,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587775939] [2019-12-17 10:53:41,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:42,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587775939] [2019-12-17 10:53:42,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84713034] [2019-12-17 10:53:42,484 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:42,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:53:42,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:42,529 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-17 10:53:42,530 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:42,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:42,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-12-17 10:53:42,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541018864] [2019-12-17 10:53:42,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-12-17 10:53:42,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:42,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-12-17 10:53:42,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-12-17 10:53:42,547 INFO L87 Difference]: Start difference. First operand 108 states and 161 transitions. Second operand 54 states. [2019-12-17 10:53:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:42,674 INFO L93 Difference]: Finished difference Result 110 states and 164 transitions. [2019-12-17 10:53:42,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-17 10:53:42,674 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-12-17 10:53:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:42,675 INFO L225 Difference]: With dead ends: 110 [2019-12-17 10:53:42,675 INFO L226 Difference]: Without dead ends: 110 [2019-12-17 10:53:42,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-12-17 10:53:42,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-12-17 10:53:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-12-17 10:53:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-12-17 10:53:42,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 164 transitions. [2019-12-17 10:53:42,679 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 164 transitions. Word has length 54 [2019-12-17 10:53:42,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:42,679 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 164 transitions. [2019-12-17 10:53:42,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-12-17 10:53:42,679 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 164 transitions. [2019-12-17 10:53:42,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-17 10:53:42,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:42,680 INFO L411 BasicCegarLoop]: trace histogram [51, 1, 1, 1, 1] [2019-12-17 10:53:42,880 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:42,881 INFO L410 AbstractCegarLoop]: === Iteration 52 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:42,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:42,881 INFO L82 PathProgramCache]: Analyzing trace with hash -516459430, now seen corresponding path program 51 times [2019-12-17 10:53:42,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:42,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349792778] [2019-12-17 10:53:42,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:43,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349792778] [2019-12-17 10:53:43,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916220991] [2019-12-17 10:53:43,875 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:43,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-12-17 10:53:43,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:43,940 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 53 conjunts are in the unsatisfiable core [2019-12-17 10:53:43,941 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:43,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:43,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:43,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-12-17 10:53:43,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000228017] [2019-12-17 10:53:43,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-12-17 10:53:43,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:43,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-12-17 10:53:43,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-12-17 10:53:43,956 INFO L87 Difference]: Start difference. First operand 110 states and 164 transitions. Second operand 55 states. [2019-12-17 10:53:44,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:44,115 INFO L93 Difference]: Finished difference Result 112 states and 167 transitions. [2019-12-17 10:53:44,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-17 10:53:44,116 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-12-17 10:53:44,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:44,117 INFO L225 Difference]: With dead ends: 112 [2019-12-17 10:53:44,117 INFO L226 Difference]: Without dead ends: 112 [2019-12-17 10:53:44,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-12-17 10:53:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-17 10:53:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-12-17 10:53:44,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-17 10:53:44,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 167 transitions. [2019-12-17 10:53:44,121 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 167 transitions. Word has length 55 [2019-12-17 10:53:44,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:44,122 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 167 transitions. [2019-12-17 10:53:44,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-12-17 10:53:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 167 transitions. [2019-12-17 10:53:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-17 10:53:44,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:44,122 INFO L411 BasicCegarLoop]: trace histogram [52, 1, 1, 1, 1] [2019-12-17 10:53:44,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:44,326 INFO L410 AbstractCegarLoop]: === Iteration 53 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:44,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:44,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1169627001, now seen corresponding path program 52 times [2019-12-17 10:53:44,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:44,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195738106] [2019-12-17 10:53:44,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:46,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195738106] [2019-12-17 10:53:46,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542683738] [2019-12-17 10:53:46,292 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:46,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:53:46,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:46,373 INFO L264 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 54 conjunts are in the unsatisfiable core [2019-12-17 10:53:46,375 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:46,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:46,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:46,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 55 [2019-12-17 10:53:46,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088877294] [2019-12-17 10:53:46,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-12-17 10:53:46,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:46,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-12-17 10:53:46,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-12-17 10:53:46,404 INFO L87 Difference]: Start difference. First operand 112 states and 167 transitions. Second operand 56 states. [2019-12-17 10:53:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:46,586 INFO L93 Difference]: Finished difference Result 114 states and 170 transitions. [2019-12-17 10:53:46,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-17 10:53:46,586 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-12-17 10:53:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:46,587 INFO L225 Difference]: With dead ends: 114 [2019-12-17 10:53:46,587 INFO L226 Difference]: Without dead ends: 114 [2019-12-17 10:53:46,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-12-17 10:53:46,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-17 10:53:46,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-12-17 10:53:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-12-17 10:53:46,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 170 transitions. [2019-12-17 10:53:46,590 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 170 transitions. Word has length 56 [2019-12-17 10:53:46,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:46,591 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 170 transitions. [2019-12-17 10:53:46,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-12-17 10:53:46,591 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 170 transitions. [2019-12-17 10:53:46,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-17 10:53:46,591 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:46,592 INFO L411 BasicCegarLoop]: trace histogram [53, 1, 1, 1, 1] [2019-12-17 10:53:46,794 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:46,795 INFO L410 AbstractCegarLoop]: === Iteration 54 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:46,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:46,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1898698810, now seen corresponding path program 53 times [2019-12-17 10:53:46,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:46,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452328020] [2019-12-17 10:53:46,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:47,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452328020] [2019-12-17 10:53:47,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111456650] [2019-12-17 10:53:47,947 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:48,006 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-12-17 10:53:48,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:48,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 55 conjunts are in the unsatisfiable core [2019-12-17 10:53:48,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:48,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:48,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:48,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-12-17 10:53:48,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966744444] [2019-12-17 10:53:48,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-12-17 10:53:48,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:48,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-12-17 10:53:48,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-12-17 10:53:48,024 INFO L87 Difference]: Start difference. First operand 114 states and 170 transitions. Second operand 57 states. [2019-12-17 10:53:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:48,160 INFO L93 Difference]: Finished difference Result 116 states and 173 transitions. [2019-12-17 10:53:48,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-17 10:53:48,161 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-12-17 10:53:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:48,162 INFO L225 Difference]: With dead ends: 116 [2019-12-17 10:53:48,162 INFO L226 Difference]: Without dead ends: 116 [2019-12-17 10:53:48,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-12-17 10:53:48,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-12-17 10:53:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-12-17 10:53:48,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-17 10:53:48,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 173 transitions. [2019-12-17 10:53:48,166 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 173 transitions. Word has length 57 [2019-12-17 10:53:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:48,166 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 173 transitions. [2019-12-17 10:53:48,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-12-17 10:53:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 173 transitions. [2019-12-17 10:53:48,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-17 10:53:48,167 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:48,167 INFO L411 BasicCegarLoop]: trace histogram [54, 1, 1, 1, 1] [2019-12-17 10:53:48,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:48,370 INFO L410 AbstractCegarLoop]: === Iteration 55 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:48,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:48,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1269878887, now seen corresponding path program 54 times [2019-12-17 10:53:48,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:48,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028410179] [2019-12-17 10:53:48,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:49,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:49,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028410179] [2019-12-17 10:53:49,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2142019019] [2019-12-17 10:53:49,487 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:49,550 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-12-17 10:53:49,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:49,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 56 conjunts are in the unsatisfiable core [2019-12-17 10:53:49,553 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:49,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:49,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-12-17 10:53:49,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524011419] [2019-12-17 10:53:49,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-12-17 10:53:49,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:49,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-12-17 10:53:49,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-12-17 10:53:49,569 INFO L87 Difference]: Start difference. First operand 116 states and 173 transitions. Second operand 58 states. [2019-12-17 10:53:49,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:49,733 INFO L93 Difference]: Finished difference Result 118 states and 176 transitions. [2019-12-17 10:53:49,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-17 10:53:49,734 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-12-17 10:53:49,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:49,735 INFO L225 Difference]: With dead ends: 118 [2019-12-17 10:53:49,735 INFO L226 Difference]: Without dead ends: 118 [2019-12-17 10:53:49,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-12-17 10:53:49,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-17 10:53:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-12-17 10:53:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-12-17 10:53:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 176 transitions. [2019-12-17 10:53:49,738 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 176 transitions. Word has length 58 [2019-12-17 10:53:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:49,738 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 176 transitions. [2019-12-17 10:53:49,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-12-17 10:53:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 176 transitions. [2019-12-17 10:53:49,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-17 10:53:49,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:49,739 INFO L411 BasicCegarLoop]: trace histogram [55, 1, 1, 1, 1] [2019-12-17 10:53:49,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:49,943 INFO L410 AbstractCegarLoop]: === Iteration 56 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:49,943 INFO L82 PathProgramCache]: Analyzing trace with hash -711539686, now seen corresponding path program 55 times [2019-12-17 10:53:49,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:49,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162004239] [2019-12-17 10:53:49,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:51,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162004239] [2019-12-17 10:53:51,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748252305] [2019-12-17 10:53:51,142 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:51,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:51,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-17 10:53:51,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:51,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:51,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-12-17 10:53:51,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704327774] [2019-12-17 10:53:51,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-12-17 10:53:51,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:51,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-12-17 10:53:51,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-12-17 10:53:51,203 INFO L87 Difference]: Start difference. First operand 118 states and 176 transitions. Second operand 59 states. [2019-12-17 10:53:51,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:51,336 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2019-12-17 10:53:51,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-17 10:53:51,337 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-12-17 10:53:51,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:51,338 INFO L225 Difference]: With dead ends: 120 [2019-12-17 10:53:51,338 INFO L226 Difference]: Without dead ends: 120 [2019-12-17 10:53:51,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-12-17 10:53:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-17 10:53:51,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-12-17 10:53:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-12-17 10:53:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 179 transitions. [2019-12-17 10:53:51,342 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 179 transitions. Word has length 59 [2019-12-17 10:53:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:51,342 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 179 transitions. [2019-12-17 10:53:51,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-12-17 10:53:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 179 transitions. [2019-12-17 10:53:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-17 10:53:51,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:51,343 INFO L411 BasicCegarLoop]: trace histogram [56, 1, 1, 1, 1] [2019-12-17 10:53:51,547 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:51,547 INFO L410 AbstractCegarLoop]: === Iteration 57 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:51,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:51,548 INFO L82 PathProgramCache]: Analyzing trace with hash -582893639, now seen corresponding path program 56 times [2019-12-17 10:53:51,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:51,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622957934] [2019-12-17 10:53:51,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:53,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622957934] [2019-12-17 10:53:53,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267766515] [2019-12-17 10:53:53,712 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:53,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:53:53,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:53,790 INFO L264 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 58 conjunts are in the unsatisfiable core [2019-12-17 10:53:53,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:53,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:53,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:53,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-12-17 10:53:53,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960215103] [2019-12-17 10:53:53,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-12-17 10:53:53,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:53,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-12-17 10:53:53,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-12-17 10:53:53,814 INFO L87 Difference]: Start difference. First operand 120 states and 179 transitions. Second operand 60 states. [2019-12-17 10:53:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:54,013 INFO L93 Difference]: Finished difference Result 122 states and 182 transitions. [2019-12-17 10:53:54,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-12-17 10:53:54,014 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-12-17 10:53:54,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:54,015 INFO L225 Difference]: With dead ends: 122 [2019-12-17 10:53:54,015 INFO L226 Difference]: Without dead ends: 122 [2019-12-17 10:53:54,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-12-17 10:53:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-12-17 10:53:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-12-17 10:53:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-12-17 10:53:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 182 transitions. [2019-12-17 10:53:54,019 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 182 transitions. Word has length 60 [2019-12-17 10:53:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:54,019 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 182 transitions. [2019-12-17 10:53:54,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-12-17 10:53:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 182 transitions. [2019-12-17 10:53:54,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-17 10:53:54,020 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:54,020 INFO L411 BasicCegarLoop]: trace histogram [57, 1, 1, 1, 1] [2019-12-17 10:53:54,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:54,223 INFO L410 AbstractCegarLoop]: === Iteration 58 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:54,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:54,224 INFO L82 PathProgramCache]: Analyzing trace with hash -889833478, now seen corresponding path program 57 times [2019-12-17 10:53:54,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:54,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137878919] [2019-12-17 10:53:54,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:55,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:55,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137878919] [2019-12-17 10:53:55,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001251196] [2019-12-17 10:53:55,450 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:55,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-12-17 10:53:55,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:55,519 INFO L264 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 59 conjunts are in the unsatisfiable core [2019-12-17 10:53:55,520 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:55,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:55,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:55,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-12-17 10:53:55,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786621049] [2019-12-17 10:53:55,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-12-17 10:53:55,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:55,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-12-17 10:53:55,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-12-17 10:53:55,540 INFO L87 Difference]: Start difference. First operand 122 states and 182 transitions. Second operand 61 states. [2019-12-17 10:53:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:55,738 INFO L93 Difference]: Finished difference Result 124 states and 185 transitions. [2019-12-17 10:53:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-12-17 10:53:55,739 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-12-17 10:53:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:55,740 INFO L225 Difference]: With dead ends: 124 [2019-12-17 10:53:55,740 INFO L226 Difference]: Without dead ends: 124 [2019-12-17 10:53:55,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-12-17 10:53:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-12-17 10:53:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-12-17 10:53:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-17 10:53:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 185 transitions. [2019-12-17 10:53:55,744 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 185 transitions. Word has length 61 [2019-12-17 10:53:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:55,744 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 185 transitions. [2019-12-17 10:53:55,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-12-17 10:53:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 185 transitions. [2019-12-17 10:53:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-17 10:53:55,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:55,745 INFO L411 BasicCegarLoop]: trace histogram [58, 1, 1, 1, 1] [2019-12-17 10:53:55,948 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:55,948 INFO L410 AbstractCegarLoop]: === Iteration 59 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:55,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:55,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1815033895, now seen corresponding path program 58 times [2019-12-17 10:53:55,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:55,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932149844] [2019-12-17 10:53:55,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:55,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:57,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932149844] [2019-12-17 10:53:57,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512240775] [2019-12-17 10:53:57,415 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:57,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:53:57,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:57,463 INFO L264 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-17 10:53:57,464 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:57,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:57,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-12-17 10:53:57,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914566065] [2019-12-17 10:53:57,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-12-17 10:53:57,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:57,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-12-17 10:53:57,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-12-17 10:53:57,480 INFO L87 Difference]: Start difference. First operand 124 states and 185 transitions. Second operand 62 states. [2019-12-17 10:53:57,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:57,640 INFO L93 Difference]: Finished difference Result 126 states and 188 transitions. [2019-12-17 10:53:57,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-17 10:53:57,641 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-12-17 10:53:57,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:57,642 INFO L225 Difference]: With dead ends: 126 [2019-12-17 10:53:57,642 INFO L226 Difference]: Without dead ends: 126 [2019-12-17 10:53:57,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-12-17 10:53:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-17 10:53:57,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-12-17 10:53:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-17 10:53:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-12-17 10:53:57,646 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 62 [2019-12-17 10:53:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:57,646 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-12-17 10:53:57,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-12-17 10:53:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-12-17 10:53:57,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-17 10:53:57,646 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:57,646 INFO L411 BasicCegarLoop]: trace histogram [59, 1, 1, 1, 1] [2019-12-17 10:53:57,847 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:57,847 INFO L410 AbstractCegarLoop]: === Iteration 60 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:57,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash -431475750, now seen corresponding path program 59 times [2019-12-17 10:53:57,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:57,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240805036] [2019-12-17 10:53:57,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:53:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:59,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240805036] [2019-12-17 10:53:59,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605754850] [2019-12-17 10:53:59,146 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:59,220 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2019-12-17 10:53:59,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:53:59,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 61 conjunts are in the unsatisfiable core [2019-12-17 10:53:59,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:53:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:53:59,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:53:59,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 62 [2019-12-17 10:53:59,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784929688] [2019-12-17 10:53:59,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-12-17 10:53:59,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:53:59,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-12-17 10:53:59,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-12-17 10:53:59,247 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 63 states. [2019-12-17 10:53:59,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:53:59,378 INFO L93 Difference]: Finished difference Result 128 states and 191 transitions. [2019-12-17 10:53:59,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-17 10:53:59,379 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-12-17 10:53:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:53:59,380 INFO L225 Difference]: With dead ends: 128 [2019-12-17 10:53:59,380 INFO L226 Difference]: Without dead ends: 128 [2019-12-17 10:53:59,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-12-17 10:53:59,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-17 10:53:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-12-17 10:53:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-12-17 10:53:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2019-12-17 10:53:59,383 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 63 [2019-12-17 10:53:59,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:53:59,383 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2019-12-17 10:53:59,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-12-17 10:53:59,384 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2019-12-17 10:53:59,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-17 10:53:59,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:53:59,384 INFO L411 BasicCegarLoop]: trace histogram [60, 1, 1, 1, 1] [2019-12-17 10:53:59,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:53:59,588 INFO L410 AbstractCegarLoop]: === Iteration 61 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:53:59,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:53:59,589 INFO L82 PathProgramCache]: Analyzing trace with hash -490846215, now seen corresponding path program 60 times [2019-12-17 10:53:59,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:53:59,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497069881] [2019-12-17 10:53:59,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:53:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:00,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497069881] [2019-12-17 10:54:00,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407754190] [2019-12-17 10:54:00,922 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:00,999 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-12-17 10:54:00,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:01,001 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 62 conjunts are in the unsatisfiable core [2019-12-17 10:54:01,002 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:01,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:01,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-12-17 10:54:01,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348225330] [2019-12-17 10:54:01,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-12-17 10:54:01,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:01,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-12-17 10:54:01,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-12-17 10:54:01,019 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand 64 states. [2019-12-17 10:54:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:01,140 INFO L93 Difference]: Finished difference Result 130 states and 194 transitions. [2019-12-17 10:54:01,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-12-17 10:54:01,141 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-12-17 10:54:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:01,142 INFO L225 Difference]: With dead ends: 130 [2019-12-17 10:54:01,142 INFO L226 Difference]: Without dead ends: 130 [2019-12-17 10:54:01,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-12-17 10:54:01,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-12-17 10:54:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-12-17 10:54:01,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-17 10:54:01,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2019-12-17 10:54:01,146 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 194 transitions. Word has length 64 [2019-12-17 10:54:01,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:01,146 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 194 transitions. [2019-12-17 10:54:01,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-12-17 10:54:01,147 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 194 transitions. [2019-12-17 10:54:01,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-17 10:54:01,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:01,147 INFO L411 BasicCegarLoop]: trace histogram [61, 1, 1, 1, 1] [2019-12-17 10:54:01,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:01,348 INFO L410 AbstractCegarLoop]: === Iteration 62 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:01,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:01,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1963636666, now seen corresponding path program 61 times [2019-12-17 10:54:01,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:01,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386304837] [2019-12-17 10:54:01,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:01,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:02,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386304837] [2019-12-17 10:54:02,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008828698] [2019-12-17 10:54:02,721 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:02,766 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 63 conjunts are in the unsatisfiable core [2019-12-17 10:54:02,767 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:02,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:02,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:02,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2019-12-17 10:54:02,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113826203] [2019-12-17 10:54:02,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-12-17 10:54:02,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:02,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-12-17 10:54:02,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-12-17 10:54:02,782 INFO L87 Difference]: Start difference. First operand 130 states and 194 transitions. Second operand 65 states. [2019-12-17 10:54:02,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:02,922 INFO L93 Difference]: Finished difference Result 132 states and 197 transitions. [2019-12-17 10:54:02,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-12-17 10:54:02,922 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-12-17 10:54:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:02,924 INFO L225 Difference]: With dead ends: 132 [2019-12-17 10:54:02,924 INFO L226 Difference]: Without dead ends: 132 [2019-12-17 10:54:02,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-12-17 10:54:02,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-17 10:54:02,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-12-17 10:54:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-17 10:54:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 197 transitions. [2019-12-17 10:54:02,927 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 197 transitions. Word has length 65 [2019-12-17 10:54:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:02,927 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 197 transitions. [2019-12-17 10:54:02,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-12-17 10:54:02,928 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 197 transitions. [2019-12-17 10:54:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-17 10:54:02,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:02,928 INFO L411 BasicCegarLoop]: trace histogram [62, 1, 1, 1, 1] [2019-12-17 10:54:03,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:03,132 INFO L410 AbstractCegarLoop]: === Iteration 63 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:03,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:03,132 INFO L82 PathProgramCache]: Analyzing trace with hash 743194649, now seen corresponding path program 62 times [2019-12-17 10:54:03,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:03,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034455915] [2019-12-17 10:54:03,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:04,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034455915] [2019-12-17 10:54:04,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1546778498] [2019-12-17 10:54:04,541 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:04,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:54:04,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:04,591 INFO L264 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 64 conjunts are in the unsatisfiable core [2019-12-17 10:54:04,592 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:04,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:04,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:04,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64] total 65 [2019-12-17 10:54:04,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619547265] [2019-12-17 10:54:04,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-12-17 10:54:04,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:04,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-12-17 10:54:04,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-12-17 10:54:04,611 INFO L87 Difference]: Start difference. First operand 132 states and 197 transitions. Second operand 66 states. [2019-12-17 10:54:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:04,796 INFO L93 Difference]: Finished difference Result 134 states and 200 transitions. [2019-12-17 10:54:04,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-17 10:54:04,797 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-12-17 10:54:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:04,798 INFO L225 Difference]: With dead ends: 134 [2019-12-17 10:54:04,798 INFO L226 Difference]: Without dead ends: 134 [2019-12-17 10:54:04,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-12-17 10:54:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-17 10:54:04,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-12-17 10:54:04,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-12-17 10:54:04,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2019-12-17 10:54:04,801 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 66 [2019-12-17 10:54:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:04,801 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2019-12-17 10:54:04,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-12-17 10:54:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2019-12-17 10:54:04,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-17 10:54:04,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:04,802 INFO L411 BasicCegarLoop]: trace histogram [63, 1, 1, 1, 1] [2019-12-17 10:54:05,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:05,006 INFO L410 AbstractCegarLoop]: === Iteration 64 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:05,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:05,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1564197786, now seen corresponding path program 63 times [2019-12-17 10:54:05,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:05,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395906918] [2019-12-17 10:54:05,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:06,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395906918] [2019-12-17 10:54:06,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166250083] [2019-12-17 10:54:06,467 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:06,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-12-17 10:54:06,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:06,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 65 conjunts are in the unsatisfiable core [2019-12-17 10:54:06,550 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:06,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:06,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-12-17 10:54:06,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913904694] [2019-12-17 10:54:06,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-12-17 10:54:06,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:06,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-12-17 10:54:06,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-12-17 10:54:06,572 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand 67 states. [2019-12-17 10:54:06,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:06,791 INFO L93 Difference]: Finished difference Result 136 states and 203 transitions. [2019-12-17 10:54:06,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-12-17 10:54:06,791 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-12-17 10:54:06,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:06,792 INFO L225 Difference]: With dead ends: 136 [2019-12-17 10:54:06,792 INFO L226 Difference]: Without dead ends: 136 [2019-12-17 10:54:06,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-12-17 10:54:06,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-12-17 10:54:06,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-12-17 10:54:06,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-17 10:54:06,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 203 transitions. [2019-12-17 10:54:06,796 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 203 transitions. Word has length 67 [2019-12-17 10:54:06,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:06,796 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 203 transitions. [2019-12-17 10:54:06,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-12-17 10:54:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 203 transitions. [2019-12-17 10:54:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-17 10:54:06,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:06,797 INFO L411 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1] [2019-12-17 10:54:06,998 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:06,998 INFO L410 AbstractCegarLoop]: === Iteration 65 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:06,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1245491257, now seen corresponding path program 64 times [2019-12-17 10:54:06,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:06,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63004573] [2019-12-17 10:54:07,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:07,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:08,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63004573] [2019-12-17 10:54:08,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605989963] [2019-12-17 10:54:08,469 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:08,532 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:54:08,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:08,534 INFO L264 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 66 conjunts are in the unsatisfiable core [2019-12-17 10:54:08,536 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:08,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:08,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-12-17 10:54:08,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703116950] [2019-12-17 10:54:08,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-12-17 10:54:08,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:08,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-12-17 10:54:08,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-12-17 10:54:08,564 INFO L87 Difference]: Start difference. First operand 136 states and 203 transitions. Second operand 68 states. [2019-12-17 10:54:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:08,764 INFO L93 Difference]: Finished difference Result 138 states and 206 transitions. [2019-12-17 10:54:08,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-12-17 10:54:08,765 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-12-17 10:54:08,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:08,765 INFO L225 Difference]: With dead ends: 138 [2019-12-17 10:54:08,765 INFO L226 Difference]: Without dead ends: 138 [2019-12-17 10:54:08,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-12-17 10:54:08,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-12-17 10:54:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-12-17 10:54:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-12-17 10:54:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 206 transitions. [2019-12-17 10:54:08,768 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 206 transitions. Word has length 68 [2019-12-17 10:54:08,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:08,769 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 206 transitions. [2019-12-17 10:54:08,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-12-17 10:54:08,769 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 206 transitions. [2019-12-17 10:54:08,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-17 10:54:08,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:08,770 INFO L411 BasicCegarLoop]: trace histogram [65, 1, 1, 1, 1] [2019-12-17 10:54:08,971 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:08,971 INFO L410 AbstractCegarLoop]: === Iteration 66 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:08,972 INFO L82 PathProgramCache]: Analyzing trace with hash -44476550, now seen corresponding path program 65 times [2019-12-17 10:54:08,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:08,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320686739] [2019-12-17 10:54:08,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:10,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320686739] [2019-12-17 10:54:10,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894917507] [2019-12-17 10:54:10,500 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:10,567 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 34 check-sat command(s) [2019-12-17 10:54:10,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:10,569 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 67 conjunts are in the unsatisfiable core [2019-12-17 10:54:10,571 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:10,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:10,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-12-17 10:54:10,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381926840] [2019-12-17 10:54:10,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-12-17 10:54:10,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:10,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-12-17 10:54:10,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-12-17 10:54:10,587 INFO L87 Difference]: Start difference. First operand 138 states and 206 transitions. Second operand 69 states. [2019-12-17 10:54:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:10,723 INFO L93 Difference]: Finished difference Result 140 states and 209 transitions. [2019-12-17 10:54:10,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-12-17 10:54:10,723 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-12-17 10:54:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:10,724 INFO L225 Difference]: With dead ends: 140 [2019-12-17 10:54:10,725 INFO L226 Difference]: Without dead ends: 140 [2019-12-17 10:54:10,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-12-17 10:54:10,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-12-17 10:54:10,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-12-17 10:54:10,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-12-17 10:54:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 209 transitions. [2019-12-17 10:54:10,728 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 209 transitions. Word has length 69 [2019-12-17 10:54:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:10,728 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 209 transitions. [2019-12-17 10:54:10,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-12-17 10:54:10,728 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 209 transitions. [2019-12-17 10:54:10,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-17 10:54:10,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:10,729 INFO L411 BasicCegarLoop]: trace histogram [66, 1, 1, 1, 1] [2019-12-17 10:54:10,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:10,929 INFO L410 AbstractCegarLoop]: === Iteration 67 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:10,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:10,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1378772903, now seen corresponding path program 66 times [2019-12-17 10:54:10,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:10,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894520892] [2019-12-17 10:54:10,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:12,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894520892] [2019-12-17 10:54:12,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284355985] [2019-12-17 10:54:12,511 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:12,610 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2019-12-17 10:54:12,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:12,612 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 68 conjunts are in the unsatisfiable core [2019-12-17 10:54:12,614 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:12,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:12,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68] total 69 [2019-12-17 10:54:12,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063113876] [2019-12-17 10:54:12,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-12-17 10:54:12,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:12,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-12-17 10:54:12,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-12-17 10:54:12,629 INFO L87 Difference]: Start difference. First operand 140 states and 209 transitions. Second operand 70 states. [2019-12-17 10:54:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:13,053 INFO L93 Difference]: Finished difference Result 142 states and 212 transitions. [2019-12-17 10:54:13,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-17 10:54:13,053 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-12-17 10:54:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:13,054 INFO L225 Difference]: With dead ends: 142 [2019-12-17 10:54:13,055 INFO L226 Difference]: Without dead ends: 142 [2019-12-17 10:54:13,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-12-17 10:54:13,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-17 10:54:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-12-17 10:54:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-12-17 10:54:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2019-12-17 10:54:13,058 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 70 [2019-12-17 10:54:13,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:13,058 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2019-12-17 10:54:13,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-12-17 10:54:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2019-12-17 10:54:13,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-17 10:54:13,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:13,059 INFO L411 BasicCegarLoop]: trace histogram [67, 1, 1, 1, 1] [2019-12-17 10:54:13,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:13,262 INFO L410 AbstractCegarLoop]: === Iteration 68 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:13,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:13,263 INFO L82 PathProgramCache]: Analyzing trace with hash 207713114, now seen corresponding path program 67 times [2019-12-17 10:54:13,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:13,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491998534] [2019-12-17 10:54:13,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:14,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491998534] [2019-12-17 10:54:14,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602042044] [2019-12-17 10:54:14,988 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:15,040 INFO L264 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 69 conjunts are in the unsatisfiable core [2019-12-17 10:54:15,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:15,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:15,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:15,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 70 [2019-12-17 10:54:15,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652691024] [2019-12-17 10:54:15,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-12-17 10:54:15,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:15,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-12-17 10:54:15,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-12-17 10:54:15,059 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand 71 states. [2019-12-17 10:54:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:15,227 INFO L93 Difference]: Finished difference Result 144 states and 215 transitions. [2019-12-17 10:54:15,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-12-17 10:54:15,228 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-12-17 10:54:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:15,229 INFO L225 Difference]: With dead ends: 144 [2019-12-17 10:54:15,229 INFO L226 Difference]: Without dead ends: 144 [2019-12-17 10:54:15,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-12-17 10:54:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-17 10:54:15,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-12-17 10:54:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-12-17 10:54:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 215 transitions. [2019-12-17 10:54:15,233 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 215 transitions. Word has length 71 [2019-12-17 10:54:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:15,233 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 215 transitions. [2019-12-17 10:54:15,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-12-17 10:54:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 215 transitions. [2019-12-17 10:54:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-17 10:54:15,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:15,234 INFO L411 BasicCegarLoop]: trace histogram [68, 1, 1, 1, 1] [2019-12-17 10:54:15,437 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:15,437 INFO L410 AbstractCegarLoop]: === Iteration 69 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:15,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:15,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2144139385, now seen corresponding path program 68 times [2019-12-17 10:54:15,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:15,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985737423] [2019-12-17 10:54:15,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:17,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985737423] [2019-12-17 10:54:17,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125019477] [2019-12-17 10:54:17,142 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:17,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:54:17,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:17,191 INFO L264 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 70 conjunts are in the unsatisfiable core [2019-12-17 10:54:17,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:17,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:17,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 71 [2019-12-17 10:54:17,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83579115] [2019-12-17 10:54:17,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-12-17 10:54:17,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:17,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-12-17 10:54:17,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-12-17 10:54:17,207 INFO L87 Difference]: Start difference. First operand 144 states and 215 transitions. Second operand 72 states. [2019-12-17 10:54:17,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:17,458 INFO L93 Difference]: Finished difference Result 146 states and 218 transitions. [2019-12-17 10:54:17,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-12-17 10:54:17,458 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-12-17 10:54:17,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:17,460 INFO L225 Difference]: With dead ends: 146 [2019-12-17 10:54:17,460 INFO L226 Difference]: Without dead ends: 146 [2019-12-17 10:54:17,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-12-17 10:54:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-12-17 10:54:17,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-12-17 10:54:17,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-17 10:54:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-12-17 10:54:17,464 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 72 [2019-12-17 10:54:17,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:17,464 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-12-17 10:54:17,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-12-17 10:54:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-12-17 10:54:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-17 10:54:17,464 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:17,464 INFO L411 BasicCegarLoop]: trace histogram [69, 1, 1, 1, 1] [2019-12-17 10:54:17,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:17,665 INFO L410 AbstractCegarLoop]: === Iteration 70 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:17,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2043811642, now seen corresponding path program 69 times [2019-12-17 10:54:17,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:17,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511992124] [2019-12-17 10:54:17,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:19,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:19,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511992124] [2019-12-17 10:54:19,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624427027] [2019-12-17 10:54:19,374 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:19,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-12-17 10:54:19,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:19,457 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 71 conjunts are in the unsatisfiable core [2019-12-17 10:54:19,459 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:19,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:19,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71] total 72 [2019-12-17 10:54:19,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268408814] [2019-12-17 10:54:19,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-12-17 10:54:19,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:19,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-12-17 10:54:19,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-12-17 10:54:19,473 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 73 states. [2019-12-17 10:54:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:19,644 INFO L93 Difference]: Finished difference Result 148 states and 221 transitions. [2019-12-17 10:54:19,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-12-17 10:54:19,644 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-12-17 10:54:19,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:19,645 INFO L225 Difference]: With dead ends: 148 [2019-12-17 10:54:19,646 INFO L226 Difference]: Without dead ends: 148 [2019-12-17 10:54:19,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-12-17 10:54:19,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-17 10:54:19,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-12-17 10:54:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-17 10:54:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 221 transitions. [2019-12-17 10:54:19,649 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 221 transitions. Word has length 73 [2019-12-17 10:54:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:19,649 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 221 transitions. [2019-12-17 10:54:19,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-12-17 10:54:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 221 transitions. [2019-12-17 10:54:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-17 10:54:19,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:19,650 INFO L411 BasicCegarLoop]: trace histogram [70, 1, 1, 1, 1] [2019-12-17 10:54:19,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:19,854 INFO L410 AbstractCegarLoop]: === Iteration 71 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:19,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:19,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1066348391, now seen corresponding path program 70 times [2019-12-17 10:54:19,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:19,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111423978] [2019-12-17 10:54:19,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:21,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111423978] [2019-12-17 10:54:21,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56743458] [2019-12-17 10:54:21,600 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:21,653 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:54:21,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:21,655 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 72 conjunts are in the unsatisfiable core [2019-12-17 10:54:21,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:21,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:21,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 73 [2019-12-17 10:54:21,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788717778] [2019-12-17 10:54:21,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-12-17 10:54:21,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:21,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-12-17 10:54:21,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-12-17 10:54:21,685 INFO L87 Difference]: Start difference. First operand 148 states and 221 transitions. Second operand 74 states. [2019-12-17 10:54:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:21,956 INFO L93 Difference]: Finished difference Result 150 states and 224 transitions. [2019-12-17 10:54:21,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-17 10:54:21,956 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-12-17 10:54:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:21,957 INFO L225 Difference]: With dead ends: 150 [2019-12-17 10:54:21,957 INFO L226 Difference]: Without dead ends: 150 [2019-12-17 10:54:21,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-12-17 10:54:21,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-12-17 10:54:21,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-12-17 10:54:21,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-12-17 10:54:21,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 224 transitions. [2019-12-17 10:54:21,961 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 224 transitions. Word has length 74 [2019-12-17 10:54:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:21,961 INFO L462 AbstractCegarLoop]: Abstraction has 150 states and 224 transitions. [2019-12-17 10:54:21,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-12-17 10:54:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 224 transitions. [2019-12-17 10:54:21,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-17 10:54:21,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:21,962 INFO L411 BasicCegarLoop]: trace histogram [71, 1, 1, 1, 1] [2019-12-17 10:54:22,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:22,165 INFO L410 AbstractCegarLoop]: === Iteration 72 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:22,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:22,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1302938394, now seen corresponding path program 71 times [2019-12-17 10:54:22,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:22,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383573659] [2019-12-17 10:54:22,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:24,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383573659] [2019-12-17 10:54:24,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307321309] [2019-12-17 10:54:24,240 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:24,316 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-12-17 10:54:24,316 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:24,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 73 conjunts are in the unsatisfiable core [2019-12-17 10:54:24,320 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:24,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:24,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:24,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 74 [2019-12-17 10:54:24,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912749793] [2019-12-17 10:54:24,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-12-17 10:54:24,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:24,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-12-17 10:54:24,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-12-17 10:54:24,345 INFO L87 Difference]: Start difference. First operand 150 states and 224 transitions. Second operand 75 states. [2019-12-17 10:54:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:24,704 INFO L93 Difference]: Finished difference Result 152 states and 227 transitions. [2019-12-17 10:54:24,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-17 10:54:24,705 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-12-17 10:54:24,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:24,706 INFO L225 Difference]: With dead ends: 152 [2019-12-17 10:54:24,707 INFO L226 Difference]: Without dead ends: 152 [2019-12-17 10:54:24,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-12-17 10:54:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-17 10:54:24,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-12-17 10:54:24,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-12-17 10:54:24,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 227 transitions. [2019-12-17 10:54:24,712 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 227 transitions. Word has length 75 [2019-12-17 10:54:24,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:24,712 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 227 transitions. [2019-12-17 10:54:24,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-12-17 10:54:24,713 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 227 transitions. [2019-12-17 10:54:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-17 10:54:24,714 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:24,714 INFO L411 BasicCegarLoop]: trace histogram [72, 1, 1, 1, 1] [2019-12-17 10:54:24,918 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:24,919 INFO L410 AbstractCegarLoop]: === Iteration 73 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:24,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:24,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1736384697, now seen corresponding path program 72 times [2019-12-17 10:54:24,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:24,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45603069] [2019-12-17 10:54:24,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:27,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45603069] [2019-12-17 10:54:27,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716665611] [2019-12-17 10:54:27,122 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:27,204 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-12-17 10:54:27,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:27,207 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 74 conjunts are in the unsatisfiable core [2019-12-17 10:54:27,209 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:27,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:27,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:27,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74] total 75 [2019-12-17 10:54:27,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331336392] [2019-12-17 10:54:27,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-12-17 10:54:27,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:27,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-12-17 10:54:27,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-12-17 10:54:27,230 INFO L87 Difference]: Start difference. First operand 152 states and 227 transitions. Second operand 76 states. [2019-12-17 10:54:27,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:27,523 INFO L93 Difference]: Finished difference Result 154 states and 230 transitions. [2019-12-17 10:54:27,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-12-17 10:54:27,523 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-12-17 10:54:27,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:27,524 INFO L225 Difference]: With dead ends: 154 [2019-12-17 10:54:27,524 INFO L226 Difference]: Without dead ends: 154 [2019-12-17 10:54:27,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-12-17 10:54:27,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-12-17 10:54:27,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-12-17 10:54:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-17 10:54:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 230 transitions. [2019-12-17 10:54:27,527 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 230 transitions. Word has length 76 [2019-12-17 10:54:27,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:27,527 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 230 transitions. [2019-12-17 10:54:27,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-12-17 10:54:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 230 transitions. [2019-12-17 10:54:27,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-17 10:54:27,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:27,528 INFO L411 BasicCegarLoop]: trace histogram [73, 1, 1, 1, 1] [2019-12-17 10:54:27,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:27,730 INFO L410 AbstractCegarLoop]: === Iteration 74 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:27,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:27,731 INFO L82 PathProgramCache]: Analyzing trace with hash -2006649094, now seen corresponding path program 73 times [2019-12-17 10:54:27,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:27,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647933767] [2019-12-17 10:54:27,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:29,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647933767] [2019-12-17 10:54:29,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215475030] [2019-12-17 10:54:29,609 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:29,663 INFO L264 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 75 conjunts are in the unsatisfiable core [2019-12-17 10:54:29,664 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:29,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:29,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 76 [2019-12-17 10:54:29,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316628901] [2019-12-17 10:54:29,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-12-17 10:54:29,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:29,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-12-17 10:54:29,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-12-17 10:54:29,689 INFO L87 Difference]: Start difference. First operand 154 states and 230 transitions. Second operand 77 states. [2019-12-17 10:54:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:29,969 INFO L93 Difference]: Finished difference Result 156 states and 233 transitions. [2019-12-17 10:54:29,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-12-17 10:54:29,970 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-12-17 10:54:29,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:29,971 INFO L225 Difference]: With dead ends: 156 [2019-12-17 10:54:29,971 INFO L226 Difference]: Without dead ends: 156 [2019-12-17 10:54:29,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-12-17 10:54:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-17 10:54:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-12-17 10:54:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-12-17 10:54:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 233 transitions. [2019-12-17 10:54:29,975 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 233 transitions. Word has length 77 [2019-12-17 10:54:29,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:29,975 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 233 transitions. [2019-12-17 10:54:29,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-12-17 10:54:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 233 transitions. [2019-12-17 10:54:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-17 10:54:29,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:29,976 INFO L411 BasicCegarLoop]: trace histogram [74, 1, 1, 1, 1] [2019-12-17 10:54:30,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:30,176 INFO L410 AbstractCegarLoop]: === Iteration 75 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:30,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:30,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2076579623, now seen corresponding path program 74 times [2019-12-17 10:54:30,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:30,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232778184] [2019-12-17 10:54:30,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:32,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232778184] [2019-12-17 10:54:32,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703331464] [2019-12-17 10:54:32,105 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:32,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:54:32,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:32,156 INFO L264 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 76 conjunts are in the unsatisfiable core [2019-12-17 10:54:32,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:32,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:32,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 77 [2019-12-17 10:54:32,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887069545] [2019-12-17 10:54:32,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-12-17 10:54:32,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:32,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-12-17 10:54:32,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-12-17 10:54:32,174 INFO L87 Difference]: Start difference. First operand 156 states and 233 transitions. Second operand 78 states. [2019-12-17 10:54:32,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:32,478 INFO L93 Difference]: Finished difference Result 158 states and 236 transitions. [2019-12-17 10:54:32,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-17 10:54:32,478 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-12-17 10:54:32,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:32,479 INFO L225 Difference]: With dead ends: 158 [2019-12-17 10:54:32,479 INFO L226 Difference]: Without dead ends: 158 [2019-12-17 10:54:32,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-12-17 10:54:32,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-17 10:54:32,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-12-17 10:54:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-12-17 10:54:32,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 236 transitions. [2019-12-17 10:54:32,482 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 236 transitions. Word has length 78 [2019-12-17 10:54:32,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:32,483 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 236 transitions. [2019-12-17 10:54:32,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-12-17 10:54:32,483 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 236 transitions. [2019-12-17 10:54:32,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-17 10:54:32,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:32,484 INFO L411 BasicCegarLoop]: trace histogram [75, 1, 1, 1, 1] [2019-12-17 10:54:32,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:32,687 INFO L410 AbstractCegarLoop]: === Iteration 76 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:32,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:32,687 INFO L82 PathProgramCache]: Analyzing trace with hash 50541274, now seen corresponding path program 75 times [2019-12-17 10:54:32,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:32,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081560471] [2019-12-17 10:54:32,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:34,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081560471] [2019-12-17 10:54:34,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584032732] [2019-12-17 10:54:34,786 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:34,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-12-17 10:54:34,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:34,880 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 77 conjunts are in the unsatisfiable core [2019-12-17 10:54:34,882 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:34,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:34,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:34,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77] total 78 [2019-12-17 10:54:34,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670755637] [2019-12-17 10:54:34,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-12-17 10:54:34,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:34,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-12-17 10:54:34,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-12-17 10:54:34,909 INFO L87 Difference]: Start difference. First operand 158 states and 236 transitions. Second operand 79 states. [2019-12-17 10:54:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:35,338 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2019-12-17 10:54:35,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-17 10:54:35,338 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-12-17 10:54:35,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:35,339 INFO L225 Difference]: With dead ends: 160 [2019-12-17 10:54:35,339 INFO L226 Difference]: Without dead ends: 160 [2019-12-17 10:54:35,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-12-17 10:54:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-17 10:54:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-12-17 10:54:35,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-12-17 10:54:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 239 transitions. [2019-12-17 10:54:35,344 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 239 transitions. Word has length 79 [2019-12-17 10:54:35,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:35,344 INFO L462 AbstractCegarLoop]: Abstraction has 160 states and 239 transitions. [2019-12-17 10:54:35,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-12-17 10:54:35,344 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 239 transitions. [2019-12-17 10:54:35,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-17 10:54:35,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:35,349 INFO L411 BasicCegarLoop]: trace histogram [76, 1, 1, 1, 1] [2019-12-17 10:54:35,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:35,553 INFO L410 AbstractCegarLoop]: === Iteration 77 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:35,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:35,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1566779641, now seen corresponding path program 76 times [2019-12-17 10:54:35,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:35,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883704907] [2019-12-17 10:54:35,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:37,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883704907] [2019-12-17 10:54:37,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658473562] [2019-12-17 10:54:37,825 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:37,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:54:37,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:37,882 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 78 conjunts are in the unsatisfiable core [2019-12-17 10:54:37,884 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:37,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:37,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78] total 79 [2019-12-17 10:54:37,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667659947] [2019-12-17 10:54:37,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-12-17 10:54:37,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:37,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-12-17 10:54:37,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-12-17 10:54:37,906 INFO L87 Difference]: Start difference. First operand 160 states and 239 transitions. Second operand 80 states. [2019-12-17 10:54:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:38,161 INFO L93 Difference]: Finished difference Result 162 states and 242 transitions. [2019-12-17 10:54:38,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-12-17 10:54:38,161 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-12-17 10:54:38,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:38,162 INFO L225 Difference]: With dead ends: 162 [2019-12-17 10:54:38,162 INFO L226 Difference]: Without dead ends: 162 [2019-12-17 10:54:38,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-12-17 10:54:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-17 10:54:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-12-17 10:54:38,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-17 10:54:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 242 transitions. [2019-12-17 10:54:38,167 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 242 transitions. Word has length 80 [2019-12-17 10:54:38,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:38,167 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 242 transitions. [2019-12-17 10:54:38,167 INFO L463 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-12-17 10:54:38,168 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 242 transitions. [2019-12-17 10:54:38,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-17 10:54:38,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:38,169 INFO L411 BasicCegarLoop]: trace histogram [77, 1, 1, 1, 1] [2019-12-17 10:54:38,369 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:38,369 INFO L410 AbstractCegarLoop]: === Iteration 78 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1325528762, now seen corresponding path program 77 times [2019-12-17 10:54:38,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:38,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467492522] [2019-12-17 10:54:38,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:38,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:40,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467492522] [2019-12-17 10:54:40,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819540532] [2019-12-17 10:54:40,559 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:40,642 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 40 check-sat command(s) [2019-12-17 10:54:40,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:40,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 79 conjunts are in the unsatisfiable core [2019-12-17 10:54:40,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:40,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:40,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 80 [2019-12-17 10:54:40,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96040740] [2019-12-17 10:54:40,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-12-17 10:54:40,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:40,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-12-17 10:54:40,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-12-17 10:54:40,665 INFO L87 Difference]: Start difference. First operand 162 states and 242 transitions. Second operand 81 states. [2019-12-17 10:54:40,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:40,881 INFO L93 Difference]: Finished difference Result 164 states and 245 transitions. [2019-12-17 10:54:40,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-12-17 10:54:40,882 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-12-17 10:54:40,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:40,883 INFO L225 Difference]: With dead ends: 164 [2019-12-17 10:54:40,883 INFO L226 Difference]: Without dead ends: 164 [2019-12-17 10:54:40,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-12-17 10:54:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-17 10:54:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-12-17 10:54:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-17 10:54:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 245 transitions. [2019-12-17 10:54:40,889 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 245 transitions. Word has length 81 [2019-12-17 10:54:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:40,889 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 245 transitions. [2019-12-17 10:54:40,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-12-17 10:54:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 245 transitions. [2019-12-17 10:54:40,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-17 10:54:40,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:40,890 INFO L411 BasicCegarLoop]: trace histogram [78, 1, 1, 1, 1] [2019-12-17 10:54:41,094 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 78 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:41,094 INFO L410 AbstractCegarLoop]: === Iteration 79 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:41,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:41,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1858281191, now seen corresponding path program 78 times [2019-12-17 10:54:41,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:41,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088209726] [2019-12-17 10:54:41,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:43,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:43,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088209726] [2019-12-17 10:54:43,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234342698] [2019-12-17 10:54:43,244 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:43,331 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2019-12-17 10:54:43,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:43,333 INFO L264 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 80 conjunts are in the unsatisfiable core [2019-12-17 10:54:43,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:43,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:43,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 81 [2019-12-17 10:54:43,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466720729] [2019-12-17 10:54:43,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-12-17 10:54:43,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:43,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-12-17 10:54:43,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-12-17 10:54:43,375 INFO L87 Difference]: Start difference. First operand 164 states and 245 transitions. Second operand 82 states. [2019-12-17 10:54:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:43,750 INFO L93 Difference]: Finished difference Result 166 states and 248 transitions. [2019-12-17 10:54:43,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-17 10:54:43,750 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-12-17 10:54:43,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:43,751 INFO L225 Difference]: With dead ends: 166 [2019-12-17 10:54:43,751 INFO L226 Difference]: Without dead ends: 166 [2019-12-17 10:54:43,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-12-17 10:54:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-17 10:54:43,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-12-17 10:54:43,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-12-17 10:54:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 248 transitions. [2019-12-17 10:54:43,754 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 248 transitions. Word has length 82 [2019-12-17 10:54:43,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:43,755 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 248 transitions. [2019-12-17 10:54:43,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-12-17 10:54:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 248 transitions. [2019-12-17 10:54:43,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-17 10:54:43,755 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:43,755 INFO L411 BasicCegarLoop]: trace histogram [79, 1, 1, 1, 1] [2019-12-17 10:54:43,956 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 79 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:43,956 INFO L410 AbstractCegarLoop]: === Iteration 80 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:43,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1772141926, now seen corresponding path program 79 times [2019-12-17 10:54:43,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:43,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990686912] [2019-12-17 10:54:43,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:46,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990686912] [2019-12-17 10:54:46,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130224488] [2019-12-17 10:54:46,197 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:46,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:46,251 INFO L264 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 81 conjunts are in the unsatisfiable core [2019-12-17 10:54:46,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:46,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:46,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81] total 82 [2019-12-17 10:54:46,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463402069] [2019-12-17 10:54:46,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-12-17 10:54:46,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:46,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-12-17 10:54:46,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-12-17 10:54:46,281 INFO L87 Difference]: Start difference. First operand 166 states and 248 transitions. Second operand 83 states. [2019-12-17 10:54:46,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:46,536 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2019-12-17 10:54:46,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-12-17 10:54:46,537 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-12-17 10:54:46,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:46,538 INFO L225 Difference]: With dead ends: 168 [2019-12-17 10:54:46,538 INFO L226 Difference]: Without dead ends: 168 [2019-12-17 10:54:46,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-12-17 10:54:46,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-17 10:54:46,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-12-17 10:54:46,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-17 10:54:46,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-12-17 10:54:46,541 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 83 [2019-12-17 10:54:46,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:46,541 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-12-17 10:54:46,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-12-17 10:54:46,541 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-12-17 10:54:46,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-17 10:54:46,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:46,542 INFO L411 BasicCegarLoop]: trace histogram [80, 1, 1, 1, 1] [2019-12-17 10:54:46,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:46,745 INFO L410 AbstractCegarLoop]: === Iteration 81 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:46,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:46,745 INFO L82 PathProgramCache]: Analyzing trace with hash 898175289, now seen corresponding path program 80 times [2019-12-17 10:54:46,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:46,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253534516] [2019-12-17 10:54:46,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:46,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:48,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253534516] [2019-12-17 10:54:48,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418836916] [2019-12-17 10:54:48,987 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:49,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:54:49,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:49,043 INFO L264 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 82 conjunts are in the unsatisfiable core [2019-12-17 10:54:49,044 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:49,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:49,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 83 [2019-12-17 10:54:49,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554167737] [2019-12-17 10:54:49,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-12-17 10:54:49,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:49,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-12-17 10:54:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-12-17 10:54:49,061 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 84 states. [2019-12-17 10:54:49,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:49,441 INFO L93 Difference]: Finished difference Result 170 states and 254 transitions. [2019-12-17 10:54:49,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-12-17 10:54:49,441 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-12-17 10:54:49,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:49,443 INFO L225 Difference]: With dead ends: 170 [2019-12-17 10:54:49,443 INFO L226 Difference]: Without dead ends: 170 [2019-12-17 10:54:49,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-12-17 10:54:49,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-17 10:54:49,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-12-17 10:54:49,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-17 10:54:49,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 254 transitions. [2019-12-17 10:54:49,446 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 254 transitions. Word has length 84 [2019-12-17 10:54:49,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:49,447 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 254 transitions. [2019-12-17 10:54:49,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-12-17 10:54:49,447 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 254 transitions. [2019-12-17 10:54:49,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-17 10:54:49,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:49,448 INFO L411 BasicCegarLoop]: trace histogram [81, 1, 1, 1, 1] [2019-12-17 10:54:49,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:49,651 INFO L410 AbstractCegarLoop]: === Iteration 82 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:49,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2073630330, now seen corresponding path program 81 times [2019-12-17 10:54:49,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:49,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507330480] [2019-12-17 10:54:49,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:51,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507330480] [2019-12-17 10:54:51,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527830321] [2019-12-17 10:54:51,953 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:52,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-12-17 10:54:52,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:52,050 INFO L264 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 83 conjunts are in the unsatisfiable core [2019-12-17 10:54:52,051 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:52,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:52,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 84 [2019-12-17 10:54:52,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934811342] [2019-12-17 10:54:52,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-12-17 10:54:52,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:52,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-12-17 10:54:52,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-12-17 10:54:52,067 INFO L87 Difference]: Start difference. First operand 170 states and 254 transitions. Second operand 85 states. [2019-12-17 10:54:52,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:52,299 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2019-12-17 10:54:52,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-12-17 10:54:52,300 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-12-17 10:54:52,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:52,301 INFO L225 Difference]: With dead ends: 172 [2019-12-17 10:54:52,301 INFO L226 Difference]: Without dead ends: 172 [2019-12-17 10:54:52,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-12-17 10:54:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-12-17 10:54:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-12-17 10:54:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-12-17 10:54:52,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 257 transitions. [2019-12-17 10:54:52,305 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 257 transitions. Word has length 85 [2019-12-17 10:54:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:52,305 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 257 transitions. [2019-12-17 10:54:52,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-12-17 10:54:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 257 transitions. [2019-12-17 10:54:52,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-17 10:54:52,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:52,306 INFO L411 BasicCegarLoop]: trace histogram [82, 1, 1, 1, 1] [2019-12-17 10:54:52,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:52,508 INFO L410 AbstractCegarLoop]: === Iteration 83 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:52,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:52,509 INFO L82 PathProgramCache]: Analyzing trace with hash -141969063, now seen corresponding path program 82 times [2019-12-17 10:54:52,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:52,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842434838] [2019-12-17 10:54:52,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:54,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842434838] [2019-12-17 10:54:54,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061858417] [2019-12-17 10:54:54,864 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:54,919 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:54:54,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:54,921 INFO L264 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 84 conjunts are in the unsatisfiable core [2019-12-17 10:54:54,922 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:54,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:54,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84] total 85 [2019-12-17 10:54:54,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82801339] [2019-12-17 10:54:54,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-12-17 10:54:54,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:54,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-12-17 10:54:54,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-12-17 10:54:54,940 INFO L87 Difference]: Start difference. First operand 172 states and 257 transitions. Second operand 86 states. [2019-12-17 10:54:55,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:55,319 INFO L93 Difference]: Finished difference Result 174 states and 260 transitions. [2019-12-17 10:54:55,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-12-17 10:54:55,320 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-12-17 10:54:55,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:55,321 INFO L225 Difference]: With dead ends: 174 [2019-12-17 10:54:55,321 INFO L226 Difference]: Without dead ends: 174 [2019-12-17 10:54:55,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-12-17 10:54:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-12-17 10:54:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-12-17 10:54:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-17 10:54:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 260 transitions. [2019-12-17 10:54:55,325 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 260 transitions. Word has length 86 [2019-12-17 10:54:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:55,325 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 260 transitions. [2019-12-17 10:54:55,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-12-17 10:54:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2019-12-17 10:54:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-17 10:54:55,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:55,326 INFO L411 BasicCegarLoop]: trace histogram [83, 1, 1, 1, 1] [2019-12-17 10:54:55,529 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:55,529 INFO L410 AbstractCegarLoop]: === Iteration 84 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:55,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:55,530 INFO L82 PathProgramCache]: Analyzing trace with hash -106073510, now seen corresponding path program 83 times [2019-12-17 10:54:55,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:55,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209189953] [2019-12-17 10:54:55,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:54:57,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:57,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209189953] [2019-12-17 10:54:57,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67820920] [2019-12-17 10:54:57,976 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:58,066 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 43 check-sat command(s) [2019-12-17 10:54:58,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:54:58,068 INFO L264 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 85 conjunts are in the unsatisfiable core [2019-12-17 10:54:58,069 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:54:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:54:58,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:54:58,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85] total 86 [2019-12-17 10:54:58,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288437480] [2019-12-17 10:54:58,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-12-17 10:54:58,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:54:58,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-12-17 10:54:58,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-12-17 10:54:58,090 INFO L87 Difference]: Start difference. First operand 174 states and 260 transitions. Second operand 87 states. [2019-12-17 10:54:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:54:58,553 INFO L93 Difference]: Finished difference Result 176 states and 263 transitions. [2019-12-17 10:54:58,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-12-17 10:54:58,554 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-12-17 10:54:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:54:58,554 INFO L225 Difference]: With dead ends: 176 [2019-12-17 10:54:58,555 INFO L226 Difference]: Without dead ends: 176 [2019-12-17 10:54:58,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-12-17 10:54:58,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-12-17 10:54:58,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-12-17 10:54:58,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-17 10:54:58,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 263 transitions. [2019-12-17 10:54:58,558 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 263 transitions. Word has length 87 [2019-12-17 10:54:58,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:54:58,558 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 263 transitions. [2019-12-17 10:54:58,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-12-17 10:54:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 263 transitions. [2019-12-17 10:54:58,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-17 10:54:58,559 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:54:58,559 INFO L411 BasicCegarLoop]: trace histogram [84, 1, 1, 1, 1] [2019-12-17 10:54:58,762 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 84 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:54:58,762 INFO L410 AbstractCegarLoop]: === Iteration 85 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:54:58,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:54:58,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1006688633, now seen corresponding path program 84 times [2019-12-17 10:54:58,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:54:58,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585584127] [2019-12-17 10:54:58,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:54:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:01,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585584127] [2019-12-17 10:55:01,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934735395] [2019-12-17 10:55:01,269 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:01,364 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2019-12-17 10:55:01,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:01,367 INFO L264 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 86 conjunts are in the unsatisfiable core [2019-12-17 10:55:01,369 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:01,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:01,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:01,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 87 [2019-12-17 10:55:01,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242850004] [2019-12-17 10:55:01,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-12-17 10:55:01,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:01,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-12-17 10:55:01,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-12-17 10:55:01,387 INFO L87 Difference]: Start difference. First operand 176 states and 263 transitions. Second operand 88 states. [2019-12-17 10:55:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:01,750 INFO L93 Difference]: Finished difference Result 178 states and 266 transitions. [2019-12-17 10:55:01,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-12-17 10:55:01,751 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-12-17 10:55:01,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:01,752 INFO L225 Difference]: With dead ends: 178 [2019-12-17 10:55:01,752 INFO L226 Difference]: Without dead ends: 178 [2019-12-17 10:55:01,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-12-17 10:55:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-17 10:55:01,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-12-17 10:55:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-12-17 10:55:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 266 transitions. [2019-12-17 10:55:01,756 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 266 transitions. Word has length 88 [2019-12-17 10:55:01,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:01,756 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 266 transitions. [2019-12-17 10:55:01,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-12-17 10:55:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 266 transitions. [2019-12-17 10:55:01,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-17 10:55:01,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:01,757 INFO L411 BasicCegarLoop]: trace histogram [85, 1, 1, 1, 1] [2019-12-17 10:55:01,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 85 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:01,958 INFO L410 AbstractCegarLoop]: === Iteration 86 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:01,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:01,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1142576698, now seen corresponding path program 85 times [2019-12-17 10:55:01,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:01,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738079980] [2019-12-17 10:55:01,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:01,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:04,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:04,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738079980] [2019-12-17 10:55:04,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112127422] [2019-12-17 10:55:04,565 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:04,625 INFO L264 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 87 conjunts are in the unsatisfiable core [2019-12-17 10:55:04,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:04,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:04,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 88 [2019-12-17 10:55:04,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007157941] [2019-12-17 10:55:04,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-12-17 10:55:04,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:04,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-12-17 10:55:04,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-12-17 10:55:04,644 INFO L87 Difference]: Start difference. First operand 178 states and 266 transitions. Second operand 89 states. [2019-12-17 10:55:04,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:04,926 INFO L93 Difference]: Finished difference Result 180 states and 269 transitions. [2019-12-17 10:55:04,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-12-17 10:55:04,926 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-12-17 10:55:04,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:04,928 INFO L225 Difference]: With dead ends: 180 [2019-12-17 10:55:04,928 INFO L226 Difference]: Without dead ends: 180 [2019-12-17 10:55:04,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-12-17 10:55:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-17 10:55:04,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-12-17 10:55:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-17 10:55:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 269 transitions. [2019-12-17 10:55:04,930 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 269 transitions. Word has length 89 [2019-12-17 10:55:04,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:04,931 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 269 transitions. [2019-12-17 10:55:04,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-12-17 10:55:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 269 transitions. [2019-12-17 10:55:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-17 10:55:04,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:04,932 INFO L411 BasicCegarLoop]: trace histogram [86, 1, 1, 1, 1] [2019-12-17 10:55:05,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:05,132 INFO L410 AbstractCegarLoop]: === Iteration 87 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:05,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:05,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1060139417, now seen corresponding path program 86 times [2019-12-17 10:55:05,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:05,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569442478] [2019-12-17 10:55:05,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:07,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:07,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569442478] [2019-12-17 10:55:07,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789751813] [2019-12-17 10:55:07,713 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:07,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:55:07,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:07,775 INFO L264 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 88 conjunts are in the unsatisfiable core [2019-12-17 10:55:07,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:07,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:07,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:07,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88] total 89 [2019-12-17 10:55:07,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520952146] [2019-12-17 10:55:07,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-12-17 10:55:07,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:07,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-12-17 10:55:07,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-12-17 10:55:07,794 INFO L87 Difference]: Start difference. First operand 180 states and 269 transitions. Second operand 90 states. [2019-12-17 10:55:08,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:08,092 INFO L93 Difference]: Finished difference Result 182 states and 272 transitions. [2019-12-17 10:55:08,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-12-17 10:55:08,093 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-12-17 10:55:08,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:08,094 INFO L225 Difference]: With dead ends: 182 [2019-12-17 10:55:08,094 INFO L226 Difference]: Without dead ends: 182 [2019-12-17 10:55:08,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-12-17 10:55:08,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-12-17 10:55:08,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-12-17 10:55:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-12-17 10:55:08,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 272 transitions. [2019-12-17 10:55:08,097 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 272 transitions. Word has length 90 [2019-12-17 10:55:08,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:08,098 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 272 transitions. [2019-12-17 10:55:08,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-12-17 10:55:08,098 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 272 transitions. [2019-12-17 10:55:08,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-17 10:55:08,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:08,099 INFO L411 BasicCegarLoop]: trace histogram [87, 1, 1, 1, 1] [2019-12-17 10:55:08,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 87 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:08,302 INFO L410 AbstractCegarLoop]: === Iteration 88 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:08,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:08,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1495416294, now seen corresponding path program 87 times [2019-12-17 10:55:08,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:08,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729160286] [2019-12-17 10:55:08,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:10,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:10,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729160286] [2019-12-17 10:55:10,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637903709] [2019-12-17 10:55:10,938 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:11,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-12-17 10:55:11,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:11,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 89 conjunts are in the unsatisfiable core [2019-12-17 10:55:11,039 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:11,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:11,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89] total 90 [2019-12-17 10:55:11,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896848079] [2019-12-17 10:55:11,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-12-17 10:55:11,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:11,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-12-17 10:55:11,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-12-17 10:55:11,057 INFO L87 Difference]: Start difference. First operand 182 states and 272 transitions. Second operand 91 states. [2019-12-17 10:55:11,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:11,389 INFO L93 Difference]: Finished difference Result 184 states and 275 transitions. [2019-12-17 10:55:11,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-12-17 10:55:11,389 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-12-17 10:55:11,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:11,390 INFO L225 Difference]: With dead ends: 184 [2019-12-17 10:55:11,390 INFO L226 Difference]: Without dead ends: 184 [2019-12-17 10:55:11,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-12-17 10:55:11,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-12-17 10:55:11,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-12-17 10:55:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-12-17 10:55:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 275 transitions. [2019-12-17 10:55:11,393 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 275 transitions. Word has length 91 [2019-12-17 10:55:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:11,393 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 275 transitions. [2019-12-17 10:55:11,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-12-17 10:55:11,393 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 275 transitions. [2019-12-17 10:55:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-17 10:55:11,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:11,394 INFO L411 BasicCegarLoop]: trace histogram [88, 1, 1, 1, 1] [2019-12-17 10:55:11,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 88 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:11,594 INFO L410 AbstractCegarLoop]: === Iteration 89 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:11,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:11,595 INFO L82 PathProgramCache]: Analyzing trace with hash 886735289, now seen corresponding path program 88 times [2019-12-17 10:55:11,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:11,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797890609] [2019-12-17 10:55:11,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:14,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:14,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797890609] [2019-12-17 10:55:14,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125871598] [2019-12-17 10:55:14,308 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:14,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:55:14,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:14,370 INFO L264 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 90 conjunts are in the unsatisfiable core [2019-12-17 10:55:14,371 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:14,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:14,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90] total 91 [2019-12-17 10:55:14,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675585855] [2019-12-17 10:55:14,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-12-17 10:55:14,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:14,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-12-17 10:55:14,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-12-17 10:55:14,408 INFO L87 Difference]: Start difference. First operand 184 states and 275 transitions. Second operand 92 states. [2019-12-17 10:55:14,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:14,872 INFO L93 Difference]: Finished difference Result 186 states and 278 transitions. [2019-12-17 10:55:14,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-12-17 10:55:14,872 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-12-17 10:55:14,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:14,873 INFO L225 Difference]: With dead ends: 186 [2019-12-17 10:55:14,873 INFO L226 Difference]: Without dead ends: 186 [2019-12-17 10:55:14,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-12-17 10:55:14,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-12-17 10:55:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-12-17 10:55:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-17 10:55:14,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 278 transitions. [2019-12-17 10:55:14,876 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 278 transitions. Word has length 92 [2019-12-17 10:55:14,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:14,877 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 278 transitions. [2019-12-17 10:55:14,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-12-17 10:55:14,877 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 278 transitions. [2019-12-17 10:55:14,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-17 10:55:14,877 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:14,877 INFO L411 BasicCegarLoop]: trace histogram [89, 1, 1, 1, 1] [2019-12-17 10:55:15,081 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:15,081 INFO L410 AbstractCegarLoop]: === Iteration 90 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:15,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:15,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1718990330, now seen corresponding path program 89 times [2019-12-17 10:55:15,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:15,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171294390] [2019-12-17 10:55:15,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:17,828 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:17,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171294390] [2019-12-17 10:55:17,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006530334] [2019-12-17 10:55:17,829 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:17,926 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2019-12-17 10:55:17,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:17,928 INFO L264 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 91 conjunts are in the unsatisfiable core [2019-12-17 10:55:17,929 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:17,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:17,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91] total 92 [2019-12-17 10:55:17,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106976766] [2019-12-17 10:55:17,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-12-17 10:55:17,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:17,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-12-17 10:55:17,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-12-17 10:55:17,949 INFO L87 Difference]: Start difference. First operand 186 states and 278 transitions. Second operand 93 states. [2019-12-17 10:55:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:18,454 INFO L93 Difference]: Finished difference Result 188 states and 281 transitions. [2019-12-17 10:55:18,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-12-17 10:55:18,454 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-12-17 10:55:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:18,455 INFO L225 Difference]: With dead ends: 188 [2019-12-17 10:55:18,455 INFO L226 Difference]: Without dead ends: 188 [2019-12-17 10:55:18,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-12-17 10:55:18,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-17 10:55:18,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-12-17 10:55:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-12-17 10:55:18,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 281 transitions. [2019-12-17 10:55:18,458 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 281 transitions. Word has length 93 [2019-12-17 10:55:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:18,458 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 281 transitions. [2019-12-17 10:55:18,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-12-17 10:55:18,459 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 281 transitions. [2019-12-17 10:55:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-17 10:55:18,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:18,460 INFO L411 BasicCegarLoop]: trace histogram [90, 1, 1, 1, 1] [2019-12-17 10:55:18,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:18,663 INFO L410 AbstractCegarLoop]: === Iteration 91 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:18,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:18,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1749092825, now seen corresponding path program 90 times [2019-12-17 10:55:18,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:18,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016472705] [2019-12-17 10:55:18,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:21,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016472705] [2019-12-17 10:55:21,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766918704] [2019-12-17 10:55:21,453 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:21,553 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2019-12-17 10:55:21,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:21,556 INFO L264 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-17 10:55:21,558 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:21,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:21,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92] total 93 [2019-12-17 10:55:21,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843018698] [2019-12-17 10:55:21,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-12-17 10:55:21,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:21,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-12-17 10:55:21,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-12-17 10:55:21,594 INFO L87 Difference]: Start difference. First operand 188 states and 281 transitions. Second operand 94 states. [2019-12-17 10:55:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:22,271 INFO L93 Difference]: Finished difference Result 190 states and 284 transitions. [2019-12-17 10:55:22,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-12-17 10:55:22,272 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-12-17 10:55:22,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:22,273 INFO L225 Difference]: With dead ends: 190 [2019-12-17 10:55:22,273 INFO L226 Difference]: Without dead ends: 190 [2019-12-17 10:55:22,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-12-17 10:55:22,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-17 10:55:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-12-17 10:55:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-12-17 10:55:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 284 transitions. [2019-12-17 10:55:22,277 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 284 transitions. Word has length 94 [2019-12-17 10:55:22,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:22,277 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 284 transitions. [2019-12-17 10:55:22,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-12-17 10:55:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2019-12-17 10:55:22,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-17 10:55:22,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:22,278 INFO L411 BasicCegarLoop]: trace histogram [91, 1, 1, 1, 1] [2019-12-17 10:55:22,481 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:22,482 INFO L410 AbstractCegarLoop]: === Iteration 92 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:22,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:22,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1612697126, now seen corresponding path program 91 times [2019-12-17 10:55:22,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:22,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175364491] [2019-12-17 10:55:22,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:25,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:25,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175364491] [2019-12-17 10:55:25,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502121388] [2019-12-17 10:55:25,613 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:25,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 93 conjunts are in the unsatisfiable core [2019-12-17 10:55:25,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:25,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:25,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:25,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93] total 94 [2019-12-17 10:55:25,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288731797] [2019-12-17 10:55:25,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-12-17 10:55:25,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:25,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-12-17 10:55:25,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-12-17 10:55:25,695 INFO L87 Difference]: Start difference. First operand 190 states and 284 transitions. Second operand 95 states. [2019-12-17 10:55:26,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:26,070 INFO L93 Difference]: Finished difference Result 192 states and 287 transitions. [2019-12-17 10:55:26,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-12-17 10:55:26,071 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-12-17 10:55:26,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:26,072 INFO L225 Difference]: With dead ends: 192 [2019-12-17 10:55:26,072 INFO L226 Difference]: Without dead ends: 192 [2019-12-17 10:55:26,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-12-17 10:55:26,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-12-17 10:55:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-12-17 10:55:26,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-12-17 10:55:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 287 transitions. [2019-12-17 10:55:26,075 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 287 transitions. Word has length 95 [2019-12-17 10:55:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:26,076 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 287 transitions. [2019-12-17 10:55:26,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-12-17 10:55:26,076 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 287 transitions. [2019-12-17 10:55:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-17 10:55:26,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:26,077 INFO L411 BasicCegarLoop]: trace histogram [92, 1, 1, 1, 1] [2019-12-17 10:55:26,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:26,280 INFO L410 AbstractCegarLoop]: === Iteration 93 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:26,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:26,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1545996793, now seen corresponding path program 92 times [2019-12-17 10:55:26,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:26,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957235776] [2019-12-17 10:55:26,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:29,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957235776] [2019-12-17 10:55:29,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137835732] [2019-12-17 10:55:29,224 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:29,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:55:29,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:29,286 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 94 conjunts are in the unsatisfiable core [2019-12-17 10:55:29,288 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:29,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:29,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94] total 95 [2019-12-17 10:55:29,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265701733] [2019-12-17 10:55:29,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-12-17 10:55:29,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:29,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-12-17 10:55:29,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-12-17 10:55:29,308 INFO L87 Difference]: Start difference. First operand 192 states and 287 transitions. Second operand 96 states. [2019-12-17 10:55:29,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:29,847 INFO L93 Difference]: Finished difference Result 194 states and 290 transitions. [2019-12-17 10:55:29,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-12-17 10:55:29,847 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-12-17 10:55:29,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:29,848 INFO L225 Difference]: With dead ends: 194 [2019-12-17 10:55:29,848 INFO L226 Difference]: Without dead ends: 194 [2019-12-17 10:55:29,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-12-17 10:55:29,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-17 10:55:29,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-12-17 10:55:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-12-17 10:55:29,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 290 transitions. [2019-12-17 10:55:29,850 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 290 transitions. Word has length 96 [2019-12-17 10:55:29,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:29,851 INFO L462 AbstractCegarLoop]: Abstraction has 194 states and 290 transitions. [2019-12-17 10:55:29,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-12-17 10:55:29,851 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 290 transitions. [2019-12-17 10:55:29,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-17 10:55:29,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:29,851 INFO L411 BasicCegarLoop]: trace histogram [93, 1, 1, 1, 1] [2019-12-17 10:55:30,052 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 93 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:30,052 INFO L410 AbstractCegarLoop]: === Iteration 94 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:30,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:30,053 INFO L82 PathProgramCache]: Analyzing trace with hash 681260474, now seen corresponding path program 93 times [2019-12-17 10:55:30,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:30,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357056491] [2019-12-17 10:55:30,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:30,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:33,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357056491] [2019-12-17 10:55:33,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022887366] [2019-12-17 10:55:33,082 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:33,192 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-12-17 10:55:33,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:33,194 INFO L264 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 95 conjunts are in the unsatisfiable core [2019-12-17 10:55:33,195 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:33,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:33,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95] total 96 [2019-12-17 10:55:33,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045117770] [2019-12-17 10:55:33,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-12-17 10:55:33,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:33,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-12-17 10:55:33,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-12-17 10:55:33,213 INFO L87 Difference]: Start difference. First operand 194 states and 290 transitions. Second operand 97 states. [2019-12-17 10:55:33,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:33,615 INFO L93 Difference]: Finished difference Result 196 states and 293 transitions. [2019-12-17 10:55:33,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-12-17 10:55:33,616 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-12-17 10:55:33,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:33,617 INFO L225 Difference]: With dead ends: 196 [2019-12-17 10:55:33,617 INFO L226 Difference]: Without dead ends: 196 [2019-12-17 10:55:33,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-12-17 10:55:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-12-17 10:55:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-12-17 10:55:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-12-17 10:55:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 293 transitions. [2019-12-17 10:55:33,621 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 293 transitions. Word has length 97 [2019-12-17 10:55:33,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:33,621 INFO L462 AbstractCegarLoop]: Abstraction has 196 states and 293 transitions. [2019-12-17 10:55:33,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-12-17 10:55:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 293 transitions. [2019-12-17 10:55:33,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-17 10:55:33,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:33,622 INFO L411 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1] [2019-12-17 10:55:33,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 94 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:33,822 INFO L410 AbstractCegarLoop]: === Iteration 95 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:33,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:33,823 INFO L82 PathProgramCache]: Analyzing trace with hash -355761639, now seen corresponding path program 94 times [2019-12-17 10:55:33,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:33,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093125564] [2019-12-17 10:55:33,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:36,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:36,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093125564] [2019-12-17 10:55:36,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341481720] [2019-12-17 10:55:36,890 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:36,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-17 10:55:36,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:36,954 INFO L264 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 96 conjunts are in the unsatisfiable core [2019-12-17 10:55:36,955 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:36,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:36,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96] total 97 [2019-12-17 10:55:36,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061957697] [2019-12-17 10:55:36,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-12-17 10:55:36,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:36,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-12-17 10:55:36,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-12-17 10:55:36,975 INFO L87 Difference]: Start difference. First operand 196 states and 293 transitions. Second operand 98 states. [2019-12-17 10:55:37,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:37,407 INFO L93 Difference]: Finished difference Result 198 states and 296 transitions. [2019-12-17 10:55:37,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-12-17 10:55:37,407 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-12-17 10:55:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:37,409 INFO L225 Difference]: With dead ends: 198 [2019-12-17 10:55:37,409 INFO L226 Difference]: Without dead ends: 198 [2019-12-17 10:55:37,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-12-17 10:55:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-12-17 10:55:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-12-17 10:55:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-17 10:55:37,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 296 transitions. [2019-12-17 10:55:37,412 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 296 transitions. Word has length 98 [2019-12-17 10:55:37,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:37,413 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 296 transitions. [2019-12-17 10:55:37,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-12-17 10:55:37,413 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 296 transitions. [2019-12-17 10:55:37,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-17 10:55:37,413 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:37,413 INFO L411 BasicCegarLoop]: trace histogram [95, 1, 1, 1, 1] [2019-12-17 10:55:37,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:37,617 INFO L410 AbstractCegarLoop]: === Iteration 96 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:37,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:37,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1856291226, now seen corresponding path program 95 times [2019-12-17 10:55:37,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:37,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587794389] [2019-12-17 10:55:37,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:40,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587794389] [2019-12-17 10:55:40,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724596525] [2019-12-17 10:55:40,755 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:40,857 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 49 check-sat command(s) [2019-12-17 10:55:40,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:40,859 INFO L264 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 97 conjunts are in the unsatisfiable core [2019-12-17 10:55:40,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:40,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:40,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:40,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97] total 98 [2019-12-17 10:55:40,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299047655] [2019-12-17 10:55:40,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-12-17 10:55:40,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:40,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-12-17 10:55:40,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-12-17 10:55:40,886 INFO L87 Difference]: Start difference. First operand 198 states and 296 transitions. Second operand 99 states. [2019-12-17 10:55:41,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:41,531 INFO L93 Difference]: Finished difference Result 200 states and 299 transitions. [2019-12-17 10:55:41,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-12-17 10:55:41,532 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-12-17 10:55:41,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:41,533 INFO L225 Difference]: With dead ends: 200 [2019-12-17 10:55:41,533 INFO L226 Difference]: Without dead ends: 200 [2019-12-17 10:55:41,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-12-17 10:55:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-12-17 10:55:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-12-17 10:55:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-12-17 10:55:41,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 299 transitions. [2019-12-17 10:55:41,536 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 299 transitions. Word has length 99 [2019-12-17 10:55:41,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:41,536 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 299 transitions. [2019-12-17 10:55:41,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-12-17 10:55:41,536 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 299 transitions. [2019-12-17 10:55:41,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-17 10:55:41,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:41,536 INFO L411 BasicCegarLoop]: trace histogram [96, 1, 1, 1, 1] [2019-12-17 10:55:41,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:41,737 INFO L410 AbstractCegarLoop]: === Iteration 97 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:41,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:41,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1710453305, now seen corresponding path program 96 times [2019-12-17 10:55:41,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:41,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20813676] [2019-12-17 10:55:41,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:44,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20813676] [2019-12-17 10:55:44,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000539811] [2019-12-17 10:55:44,916 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:45,023 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2019-12-17 10:55:45,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:45,026 INFO L264 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 98 conjunts are in the unsatisfiable core [2019-12-17 10:55:45,028 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:45,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:45,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98] total 99 [2019-12-17 10:55:45,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101294738] [2019-12-17 10:55:45,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-12-17 10:55:45,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:45,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-12-17 10:55:45,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-12-17 10:55:45,047 INFO L87 Difference]: Start difference. First operand 200 states and 299 transitions. Second operand 100 states. [2019-12-17 10:55:45,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:45,538 INFO L93 Difference]: Finished difference Result 202 states and 302 transitions. [2019-12-17 10:55:45,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-12-17 10:55:45,538 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-12-17 10:55:45,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:45,539 INFO L225 Difference]: With dead ends: 202 [2019-12-17 10:55:45,539 INFO L226 Difference]: Without dead ends: 202 [2019-12-17 10:55:45,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-12-17 10:55:45,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-12-17 10:55:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-12-17 10:55:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-12-17 10:55:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 302 transitions. [2019-12-17 10:55:45,543 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 302 transitions. Word has length 100 [2019-12-17 10:55:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:45,543 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 302 transitions. [2019-12-17 10:55:45,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-12-17 10:55:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 302 transitions. [2019-12-17 10:55:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-17 10:55:45,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:45,544 INFO L411 BasicCegarLoop]: trace histogram [97, 1, 1, 1, 1] [2019-12-17 10:55:45,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 97 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:45,748 INFO L410 AbstractCegarLoop]: === Iteration 98 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:45,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:45,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1484445050, now seen corresponding path program 97 times [2019-12-17 10:55:45,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:45,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85254177] [2019-12-17 10:55:45,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:45,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:49,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:49,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85254177] [2019-12-17 10:55:49,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2139292361] [2019-12-17 10:55:49,014 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:49,079 INFO L264 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 99 conjunts are in the unsatisfiable core [2019-12-17 10:55:49,080 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:49,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:49,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99] total 100 [2019-12-17 10:55:49,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749991476] [2019-12-17 10:55:49,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-12-17 10:55:49,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:49,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-12-17 10:55:49,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-12-17 10:55:49,112 INFO L87 Difference]: Start difference. First operand 202 states and 302 transitions. Second operand 101 states. [2019-12-17 10:55:49,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:49,542 INFO L93 Difference]: Finished difference Result 204 states and 305 transitions. [2019-12-17 10:55:49,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-12-17 10:55:49,542 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-12-17 10:55:49,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:49,543 INFO L225 Difference]: With dead ends: 204 [2019-12-17 10:55:49,543 INFO L226 Difference]: Without dead ends: 204 [2019-12-17 10:55:49,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-12-17 10:55:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-12-17 10:55:49,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2019-12-17 10:55:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-12-17 10:55:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 305 transitions. [2019-12-17 10:55:49,546 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 305 transitions. Word has length 101 [2019-12-17 10:55:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:49,546 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 305 transitions. [2019-12-17 10:55:49,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-12-17 10:55:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 305 transitions. [2019-12-17 10:55:49,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-17 10:55:49,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:49,546 INFO L411 BasicCegarLoop]: trace histogram [98, 1, 1, 1, 1] [2019-12-17 10:55:49,747 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 98 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:49,749 INFO L410 AbstractCegarLoop]: === Iteration 99 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:49,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:49,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1226843559, now seen corresponding path program 98 times [2019-12-17 10:55:49,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:49,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114403672] [2019-12-17 10:55:49,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:49,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:53,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:53,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114403672] [2019-12-17 10:55:53,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749439258] [2019-12-17 10:55:53,055 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:53,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-17 10:55:53,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:53,129 INFO L264 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 100 conjunts are in the unsatisfiable core [2019-12-17 10:55:53,130 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:53,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:53,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100] total 101 [2019-12-17 10:55:53,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362699759] [2019-12-17 10:55:53,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-12-17 10:55:53,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-12-17 10:55:53,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-12-17 10:55:53,151 INFO L87 Difference]: Start difference. First operand 204 states and 305 transitions. Second operand 102 states. [2019-12-17 10:55:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:53,634 INFO L93 Difference]: Finished difference Result 206 states and 308 transitions. [2019-12-17 10:55:53,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-12-17 10:55:53,634 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-12-17 10:55:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:53,635 INFO L225 Difference]: With dead ends: 206 [2019-12-17 10:55:53,636 INFO L226 Difference]: Without dead ends: 206 [2019-12-17 10:55:53,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-12-17 10:55:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-12-17 10:55:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2019-12-17 10:55:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-12-17 10:55:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 308 transitions. [2019-12-17 10:55:53,638 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 308 transitions. Word has length 102 [2019-12-17 10:55:53,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:53,638 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 308 transitions. [2019-12-17 10:55:53,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-12-17 10:55:53,638 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 308 transitions. [2019-12-17 10:55:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-12-17 10:55:53,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:53,639 INFO L411 BasicCegarLoop]: trace histogram [99, 1, 1, 1, 1] [2019-12-17 10:55:53,839 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:53,840 INFO L410 AbstractCegarLoop]: === Iteration 100 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:53,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:53,840 INFO L82 PathProgramCache]: Analyzing trace with hash 622555482, now seen corresponding path program 99 times [2019-12-17 10:55:53,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:53,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914488404] [2019-12-17 10:55:53,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-17 10:55:57,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:57,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914488404] [2019-12-17 10:55:57,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356215208] [2019-12-17 10:55:57,239 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:57,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-12-17 10:55:57,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-17 10:55:57,365 INFO L264 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 101 conjunts are in the unsatisfiable core [2019-12-17 10:55:57,367 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-17 10:55:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-17 10:55:57,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-17 10:55:57,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101] total 102 [2019-12-17 10:55:57,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676137029] [2019-12-17 10:55:57,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-12-17 10:55:57,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-17 10:55:57,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-12-17 10:55:57,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-12-17 10:55:57,388 INFO L87 Difference]: Start difference. First operand 206 states and 308 transitions. Second operand 103 states. [2019-12-17 10:55:57,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-17 10:55:57,893 INFO L93 Difference]: Finished difference Result 208 states and 311 transitions. [2019-12-17 10:55:57,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-12-17 10:55:57,893 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-12-17 10:55:57,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-17 10:55:57,895 INFO L225 Difference]: With dead ends: 208 [2019-12-17 10:55:57,895 INFO L226 Difference]: Without dead ends: 208 [2019-12-17 10:55:57,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2019-12-17 10:55:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-12-17 10:55:57,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-12-17 10:55:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-12-17 10:55:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 311 transitions. [2019-12-17 10:55:57,898 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 311 transitions. Word has length 103 [2019-12-17 10:55:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-17 10:55:57,898 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 311 transitions. [2019-12-17 10:55:57,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-12-17 10:55:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 311 transitions. [2019-12-17 10:55:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-17 10:55:57,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-17 10:55:57,899 INFO L411 BasicCegarLoop]: trace histogram [100, 1, 1, 1, 1] [2019-12-17 10:55:58,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 100 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-17 10:55:58,103 INFO L410 AbstractCegarLoop]: === Iteration 101 === [worker_threadErr0ASSERT_VIOLATIONASSERT, worker_threadErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATION]=== [2019-12-17 10:55:58,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-17 10:55:58,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2119350905, now seen corresponding path program 100 times [2019-12-17 10:55:58,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-17 10:55:58,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356332987] [2019-12-17 10:55:58,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-17 10:55:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-17 10:55:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-17 10:55:58,199 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-17 10:55:58,199 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-17 10:55:58,203 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [88] [88] ULTIMATE.startENTRY-->L27: Formula: (let ((.cse0 (store |v_#valid_19| 0 0))) (and (= |v_#NULL.offset_4| 0) (= |v_#valid_17| (store .cse0 |v_ULTIMATE.start_main_~#thread~0.base_13| 1)) (= 0 |v_#NULL.base_4|) (< 0 |v_#StackHeapBarrier_6|) (< |v_#StackHeapBarrier_6| |v_ULTIMATE.start_main_~#thread~0.base_13|) (= |v_ULTIMATE.start_main_~#thread~0.offset_12| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#thread~0.base_13|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#thread~0.base_13| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#thread~0.base_13|) |v_ULTIMATE.start_main_~#thread~0.offset_12| 0))) (= |v_#length_7| (store |v_#length_8| |v_ULTIMATE.start_main_~#thread~0.base_13| 4)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_6|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, #length=|v_#length_8|} OutVars{ULTIMATE.start_main_#t~nondet1=|v_ULTIMATE.start_main_#t~nondet1_6|, #StackHeapBarrier=|v_#StackHeapBarrier_6|, ULTIMATE.start_main_~#thread~0.base=|v_ULTIMATE.start_main_~#thread~0.base_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_7|, ULTIMATE.start_main_~#thread~0.offset=|v_ULTIMATE.start_main_~#thread~0.offset_12|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_7|, #NULL.offset=|v_#NULL.offset_4|, #length=|v_#length_7|, #NULL.base=|v_#NULL.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet1, ULTIMATE.start_main_~#thread~0.base, ULTIMATE.start_main_#res, ULTIMATE.start_main_~#thread~0.offset, #valid, #memory_int, #NULL.offset, #length, #NULL.base] because there is no mapped edge [2019-12-17 10:55:58,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [76] [76] worker_threadENTRY-->L19-2: Formula: (and (= |v_worker_threadThread1of1ForFork0_#in~arg.offset_4| v_worker_threadThread1of1ForFork0_~arg.offset_4) (= v_worker_threadThread1of1ForFork0_~x~0_8 0) (= v_worker_threadThread1of1ForFork0_~arg.base_4 |v_worker_threadThread1of1ForFork0_#in~arg.base_4|)) InVars {worker_threadThread1of1ForFork0_#in~arg.base=|v_worker_threadThread1of1ForFork0_#in~arg.base_4|, worker_threadThread1of1ForFork0_#in~arg.offset=|v_worker_threadThread1of1ForFork0_#in~arg.offset_4|} OutVars{worker_threadThread1of1ForFork0_~arg.base=v_worker_threadThread1of1ForFork0_~arg.base_4, worker_threadThread1of1ForFork0_~arg.offset=v_worker_threadThread1of1ForFork0_~arg.offset_4, worker_threadThread1of1ForFork0_#in~arg.base=|v_worker_threadThread1of1ForFork0_#in~arg.base_4|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_8, worker_threadThread1of1ForFork0_#in~arg.offset=|v_worker_threadThread1of1ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_~arg.base, worker_threadThread1of1ForFork0_~arg.offset, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,204 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,205 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,206 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,216 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,217 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,218 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [87] [87] L19-2-->L19-2: Formula: (and (= v_worker_threadThread1of1ForFork0_~x~0_13 (+ v_worker_threadThread1of1ForFork0_~x~0_14 1)) (< v_worker_threadThread1of1ForFork0_~x~0_14 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_14} OutVars{worker_threadThread1of1ForFork0_#t~post0=|v_worker_threadThread1of1ForFork0_#t~post0_9|, worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_13} AuxVars[] AssignedVars[worker_threadThread1of1ForFork0_#t~post0, worker_threadThread1of1ForFork0_~x~0] because there is no mapped edge [2019-12-17 10:55:58,219 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [85] [85] L19-2-->worker_threadErr0ASSERT_VIOLATIONASSERT: Formula: (not (< v_worker_threadThread1of1ForFork0_~x~0_11 100)) InVars {worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_11} OutVars{worker_threadThread1of1ForFork0_~x~0=v_worker_threadThread1of1ForFork0_~x~0_11} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-17 10:55:58,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 10:55:58 BasicIcfg [2019-12-17 10:55:58,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-17 10:55:58,235 INFO L168 Benchmark]: Toolchain (without parser) took 175607.00 ms. Allocated memory was 145.8 MB in the beginning and 655.4 MB in the end (delta: 509.6 MB). Free memory was 102.3 MB in the beginning and 425.4 MB in the end (delta: -323.1 MB). Peak memory consumption was 186.5 MB. Max. memory is 7.1 GB. [2019-12-17 10:55:58,236 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-17 10:55:58,236 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.32 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.9 MB in the beginning and 182.7 MB in the end (delta: -80.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2019-12-17 10:55:58,237 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.01 ms. Allocated memory is still 203.9 MB. Free memory was 182.7 MB in the beginning and 181.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-17 10:55:58,237 INFO L168 Benchmark]: Boogie Preprocessor took 18.98 ms. Allocated memory is still 203.9 MB. Free memory was 181.4 MB in the beginning and 180.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-17 10:55:58,238 INFO L168 Benchmark]: RCFGBuilder took 263.86 ms. Allocated memory is still 203.9 MB. Free memory was 180.1 MB in the beginning and 167.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2019-12-17 10:55:58,238 INFO L168 Benchmark]: TraceAbstraction took 174927.73 ms. Allocated memory was 203.9 MB in the beginning and 655.4 MB in the end (delta: 451.4 MB). Free memory was 166.4 MB in the beginning and 425.4 MB in the end (delta: -259.0 MB). Peak memory consumption was 192.4 MB. Max. memory is 7.1 GB. [2019-12-17 10:55:58,241 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 353.32 ms. Allocated memory was 145.8 MB in the beginning and 203.9 MB in the end (delta: 58.2 MB). Free memory was 101.9 MB in the beginning and 182.7 MB in the end (delta: -80.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.01 ms. Allocated memory is still 203.9 MB. Free memory was 182.7 MB in the beginning and 181.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 18.98 ms. Allocated memory is still 203.9 MB. Free memory was 181.4 MB in the beginning and 180.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 263.86 ms. Allocated memory is still 203.9 MB. Free memory was 180.1 MB in the beginning and 167.1 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 174927.73 ms. Allocated memory was 203.9 MB in the beginning and 655.4 MB in the end (delta: 451.4 MB). Free memory was 166.4 MB in the beginning and 425.4 MB in the end (delta: -259.0 MB). Peak memory consumption was 192.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.5s, 27 ProgramPointsBefore, 9 ProgramPointsAfterwards, 25 TransitionsBefore, 8 TransitionsAfterwards, 110 CoEnabledTransitionPairs, 4 FixpointIterations, 6 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 1 ChoiceCompositions, 48 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 61 CheckedPairsTotal, 17 TotalNumberOfCompositions - CounterExampleResult [Line: 22]: assertion can be violated assertion can be violated We found a FailurePath: [L27] FCALL, FORK 0 pthread_create(&thread, NULL, worker_thread, NULL) VAL [arg={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 24 locations, 1 error locations. Result: UNSAFE, OverallTime: 174.7s, OverallIterations: 101, TraceHistogramMax: 100, AutomataDifference: 18.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 600 SDtfs, 6400 SDslu, 12513 SDs, 0 SdLazy, 12713 SolverSat, 145 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10397 GetRequests, 5248 SyntacticMatches, 0 SemanticMatches, 5149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9702 ImplicationChecksByTransitivity, 123.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 100 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 127.0s InterpolantComputationTime, 10800 NumberOfCodeBlocks, 10800 NumberOfCodeBlocksAsserted, 1491 NumberOfCheckSat, 10497 ConstructedInterpolants, 0 QuantifiedInterpolants, 2111685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 17721 ConjunctsInSsa, 5148 ConjunctsInUnsatCore, 199 InterpolantComputations, 1 PerfectInterpolantSequences, 0/333300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...