/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/svcomp/pthread/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:43:14,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:43:14,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:43:14,538 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:43:14,539 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:43:14,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:43:14,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:43:14,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:43:14,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:43:14,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:43:14,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:43:14,564 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:43:14,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:43:14,566 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:43:14,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:43:14,570 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:43:14,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:43:14,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:43:14,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:43:14,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:43:14,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:43:14,586 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:43:14,587 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:43:14,588 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:43:14,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:43:14,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:43:14,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:43:14,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:43:14,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:43:14,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:43:14,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:43:14,596 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:43:14,597 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:43:14,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:43:14,599 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:43:14,599 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:43:14,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:43:14,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:43:14,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:43:14,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:43:14,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:43:14,603 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-18 15:43:14,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:43:14,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:43:14,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:43:14,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:43:14,638 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:43:14,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:43:14,639 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:43:14,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:43:14,639 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:43:14,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:43:14,640 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:43:14,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:43:14,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:43:14,640 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:43:14,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:43:14,640 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:43:14,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:43:14,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:43:14,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:43:14,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:43:14,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:43:14,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:43:14,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:43:14,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:43:14,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:43:14,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:43:14,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:43:14,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:43:14,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:43:14,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:43:14,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:43:14,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:43:14,927 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:43:14,927 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:43:14,928 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2019-12-18 15:43:14,988 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be2bd703f/2df39e487d42480bb93e461ad9df9d8c/FLAG4c8ecb59f [2019-12-18 15:43:15,526 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:43:15,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2019-12-18 15:43:15,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be2bd703f/2df39e487d42480bb93e461ad9df9d8c/FLAG4c8ecb59f [2019-12-18 15:43:15,759 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be2bd703f/2df39e487d42480bb93e461ad9df9d8c [2019-12-18 15:43:15,768 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:43:15,770 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:43:15,771 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:43:15,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:43:15,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:43:15,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:43:15" (1/1) ... [2019-12-18 15:43:15,779 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67c358ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:15, skipping insertion in model container [2019-12-18 15:43:15,779 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:43:15" (1/1) ... [2019-12-18 15:43:15,788 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:43:15,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:43:16,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:43:16,318 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:43:16,371 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:43:16,445 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:43:16,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:16 WrapperNode [2019-12-18 15:43:16,445 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:43:16,446 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:43:16,446 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:43:16,446 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:43:16,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:16" (1/1) ... [2019-12-18 15:43:16,471 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:16" (1/1) ... [2019-12-18 15:43:16,491 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:43:16,491 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:43:16,492 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:43:16,492 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:43:16,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:16" (1/1) ... [2019-12-18 15:43:16,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:16" (1/1) ... [2019-12-18 15:43:16,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:16" (1/1) ... [2019-12-18 15:43:16,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:16" (1/1) ... [2019-12-18 15:43:16,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:16" (1/1) ... [2019-12-18 15:43:16,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:16" (1/1) ... [2019-12-18 15:43:16,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:16" (1/1) ... [2019-12-18 15:43:16,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:43:16,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:43:16,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:43:16,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:43:16,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:16" (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-18 15:43:16,586 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-18 15:43:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-18 15:43:16,586 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-18 15:43:16,586 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-18 15:43:16,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:43:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:43:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:43:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:43:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:43:16,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:43:16,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:43:16,589 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:43:16,920 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:43:16,921 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-18 15:43:16,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:43:16 BoogieIcfgContainer [2019-12-18 15:43:16,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:43:16,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:43:16,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:43:16,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:43:16,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:43:15" (1/3) ... [2019-12-18 15:43:16,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446112e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:43:16, skipping insertion in model container [2019-12-18 15:43:16,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:43:16" (2/3) ... [2019-12-18 15:43:16,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@446112e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:43:16, skipping insertion in model container [2019-12-18 15:43:16,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:43:16" (3/3) ... [2019-12-18 15:43:16,931 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2019-12-18 15:43:16,940 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:43:16,940 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:43:16,946 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 15:43:16,947 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:43:16,975 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,975 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,975 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,976 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,976 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,977 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,977 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,977 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,977 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,978 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,978 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,978 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,979 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,979 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,979 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,980 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,980 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,980 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,980 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,981 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,981 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,981 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,982 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,982 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,982 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,983 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,983 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,983 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,987 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,988 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,988 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,988 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,989 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,989 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,994 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,995 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,995 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,995 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,995 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:16,996 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:43:17,011 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-18 15:43:17,028 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:43:17,028 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:43:17,028 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:43:17,028 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:43:17,029 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:43:17,029 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:43:17,029 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:43:17,029 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:43:17,043 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-18 15:43:17,045 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-18 15:43:17,085 INFO L126 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-18 15:43:17,085 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:43:17,093 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs. 6/49 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-18 15:43:17,098 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-18 15:43:17,114 INFO L126 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-18 15:43:17,115 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:43:17,116 INFO L76 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 49 events. 5/49 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs. 6/49 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2019-12-18 15:43:17,118 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-18 15:43:17,120 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:43:18,252 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-18 15:43:18,397 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-18 15:43:18,397 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-18 15:43:18,402 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-18 15:43:18,415 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-18 15:43:18,417 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-18 15:43:18,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 15:43:18,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:18,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 15:43:18,426 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:18,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:18,435 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-18 15:43:18,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:18,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584450638] [2019-12-18 15:43:18,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:18,659 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-18 15:43:18,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584450638] [2019-12-18 15:43:18,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:43:18,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:43:18,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617651182] [2019-12-18 15:43:18,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:43:18,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:43:18,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:43:18,688 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-18 15:43:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:18,729 INFO L93 Difference]: Finished difference Result 48 states and 115 transitions. [2019-12-18 15:43:18,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:43:18,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 15:43:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:18,743 INFO L225 Difference]: With dead ends: 48 [2019-12-18 15:43:18,743 INFO L226 Difference]: Without dead ends: 28 [2019-12-18 15:43:18,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-18 15:43:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-18 15:43:18,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-18 15:43:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-18 15:43:18,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2019-12-18 15:43:18,786 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 5 [2019-12-18 15:43:18,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:18,787 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2019-12-18 15:43:18,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:43:18,787 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2019-12-18 15:43:18,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 15:43:18,788 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:18,788 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:18,789 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:18,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:18,789 INFO L82 PathProgramCache]: Analyzing trace with hash 232906128, now seen corresponding path program 1 times [2019-12-18 15:43:18,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:18,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308779815] [2019-12-18 15:43:18,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:18,922 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-18 15:43:18,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308779815] [2019-12-18 15:43:18,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:43:18,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:43:18,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289207382] [2019-12-18 15:43:18,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:43:18,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:18,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:43:18,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:43:18,926 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand 4 states. [2019-12-18 15:43:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:18,948 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-18 15:43:18,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:43:18,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-18 15:43:18,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:18,949 INFO L225 Difference]: With dead ends: 34 [2019-12-18 15:43:18,950 INFO L226 Difference]: Without dead ends: 30 [2019-12-18 15:43:18,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:43:18,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-18 15:43:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-18 15:43:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-18 15:43:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-18 15:43:18,957 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 7 [2019-12-18 15:43:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:18,957 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-18 15:43:18,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:43:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-18 15:43:18,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:43:18,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:18,958 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:18,959 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:18,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:18,959 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-12-18 15:43:18,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:18,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44096950] [2019-12-18 15:43:18,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:19,034 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-18 15:43:19,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44096950] [2019-12-18 15:43:19,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:43:19,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:43:19,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365631632] [2019-12-18 15:43:19,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:43:19,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:19,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:43:19,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:43:19,038 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 5 states. [2019-12-18 15:43:19,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:19,077 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-18 15:43:19,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 15:43:19,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 15:43:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:19,082 INFO L225 Difference]: With dead ends: 34 [2019-12-18 15:43:19,082 INFO L226 Difference]: Without dead ends: 28 [2019-12-18 15:43:19,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:43:19,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-18 15:43:19,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-12-18 15:43:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-18 15:43:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-18 15:43:19,088 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 9 [2019-12-18 15:43:19,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:19,088 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-18 15:43:19,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:43:19,088 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-18 15:43:19,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 15:43:19,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:19,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:19,089 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:19,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:19,090 INFO L82 PathProgramCache]: Analyzing trace with hash 483962890, now seen corresponding path program 2 times [2019-12-18 15:43:19,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:19,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125469776] [2019-12-18 15:43:19,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:19,141 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-18 15:43:19,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125469776] [2019-12-18 15:43:19,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:43:19,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:43:19,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156622659] [2019-12-18 15:43:19,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:43:19,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:19,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:43:19,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:43:19,144 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 5 states. [2019-12-18 15:43:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:19,184 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-18 15:43:19,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:43:19,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 15:43:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:19,186 INFO L225 Difference]: With dead ends: 32 [2019-12-18 15:43:19,186 INFO L226 Difference]: Without dead ends: 28 [2019-12-18 15:43:19,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:43:19,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-18 15:43:19,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-18 15:43:19,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-18 15:43:19,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-18 15:43:19,191 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 9 [2019-12-18 15:43:19,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:19,192 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-18 15:43:19,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:43:19,192 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-18 15:43:19,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 15:43:19,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:19,193 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:19,193 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:19,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:19,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 3 times [2019-12-18 15:43:19,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:19,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418663030] [2019-12-18 15:43:19,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:19,286 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-18 15:43:19,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418663030] [2019-12-18 15:43:19,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18892529] [2019-12-18 15:43:19,287 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 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-18 15:43:19,352 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 15:43:19,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:19,355 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:43:19,360 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:19,393 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-18 15:43:19,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:19,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-18 15:43:19,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85189601] [2019-12-18 15:43:19,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:43:19,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:19,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:43:19,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:43:19,397 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 7 states. [2019-12-18 15:43:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:19,471 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-18 15:43:19,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:43:19,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-18 15:43:19,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:19,474 INFO L225 Difference]: With dead ends: 32 [2019-12-18 15:43:19,474 INFO L226 Difference]: Without dead ends: 29 [2019-12-18 15:43:19,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:43:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-18 15:43:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-12-18 15:43:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-18 15:43:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-18 15:43:19,482 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 10 [2019-12-18 15:43:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:19,483 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-18 15:43:19,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:43:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-18 15:43:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 15:43:19,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:19,484 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:19,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:19,685 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:19,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:19,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2117948007, now seen corresponding path program 4 times [2019-12-18 15:43:19,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:19,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171396095] [2019-12-18 15:43:19,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:19,757 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-18 15:43:19,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171396095] [2019-12-18 15:43:19,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854570896] [2019-12-18 15:43:19,758 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 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-18 15:43:19,831 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:43:19,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:19,832 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 15:43:19,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:19,850 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-18 15:43:19,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:19,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-18 15:43:19,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323842482] [2019-12-18 15:43:19,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:43:19,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:19,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:43:19,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:43:19,852 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 7 states. [2019-12-18 15:43:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:19,921 INFO L93 Difference]: Finished difference Result 33 states and 68 transitions. [2019-12-18 15:43:19,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:43:19,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-18 15:43:19,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:19,923 INFO L225 Difference]: With dead ends: 33 [2019-12-18 15:43:19,923 INFO L226 Difference]: Without dead ends: 30 [2019-12-18 15:43:19,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:43:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-18 15:43:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-18 15:43:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-18 15:43:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-18 15:43:19,927 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 10 [2019-12-18 15:43:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:19,928 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-18 15:43:19,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:43:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-18 15:43:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:43:19,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:19,929 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:20,132 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:20,132 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:20,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:20,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1723422894, now seen corresponding path program 5 times [2019-12-18 15:43:20,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:20,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182651363] [2019-12-18 15:43:20,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:20,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182651363] [2019-12-18 15:43:20,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179783166] [2019-12-18 15:43:20,225 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 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-18 15:43:20,280 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:43:20,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:20,281 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 15:43:20,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:20,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:20,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-18 15:43:20,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735096125] [2019-12-18 15:43:20,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:43:20,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:20,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:43:20,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:43:20,298 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 8 states. [2019-12-18 15:43:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:20,396 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-18 15:43:20,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:43:20,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-18 15:43:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:20,397 INFO L225 Difference]: With dead ends: 34 [2019-12-18 15:43:20,398 INFO L226 Difference]: Without dead ends: 31 [2019-12-18 15:43:20,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:43:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-18 15:43:20,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-18 15:43:20,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-18 15:43:20,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2019-12-18 15:43:20,402 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 11 [2019-12-18 15:43:20,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:20,403 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 48 transitions. [2019-12-18 15:43:20,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:43:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 48 transitions. [2019-12-18 15:43:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 15:43:20,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:20,404 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:20,606 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:20,607 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:20,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:20,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1231878834, now seen corresponding path program 6 times [2019-12-18 15:43:20,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:20,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445055136] [2019-12-18 15:43:20,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:20,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:20,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445055136] [2019-12-18 15:43:20,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198691694] [2019-12-18 15:43:20,686 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 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-18 15:43:20,730 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-18 15:43:20,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:20,732 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:43:20,733 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:20,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:20,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:20,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-18 15:43:20,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022424783] [2019-12-18 15:43:20,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 15:43:20,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:20,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 15:43:20,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-18 15:43:20,752 INFO L87 Difference]: Start difference. First operand 23 states and 48 transitions. Second operand 8 states. [2019-12-18 15:43:20,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:20,850 INFO L93 Difference]: Finished difference Result 35 states and 72 transitions. [2019-12-18 15:43:20,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:43:20,851 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-18 15:43:20,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:20,851 INFO L225 Difference]: With dead ends: 35 [2019-12-18 15:43:20,852 INFO L226 Difference]: Without dead ends: 32 [2019-12-18 15:43:20,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:43:20,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-18 15:43:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-18 15:43:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-18 15:43:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-18 15:43:20,856 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 11 [2019-12-18 15:43:20,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:20,856 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-18 15:43:20,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 15:43:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-18 15:43:20,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 15:43:20,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:20,857 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:21,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:21,061 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:21,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1886502219, now seen corresponding path program 7 times [2019-12-18 15:43:21,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:21,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032059953] [2019-12-18 15:43:21,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:21,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032059953] [2019-12-18 15:43:21,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910231849] [2019-12-18 15:43:21,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 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-18 15:43:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:21,189 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:43:21,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:21,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:21,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-18 15:43:21,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554483758] [2019-12-18 15:43:21,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:43:21,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:21,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:43:21,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:43:21,221 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 9 states. [2019-12-18 15:43:21,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:21,315 INFO L93 Difference]: Finished difference Result 36 states and 74 transitions. [2019-12-18 15:43:21,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:43:21,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-18 15:43:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:21,316 INFO L225 Difference]: With dead ends: 36 [2019-12-18 15:43:21,316 INFO L226 Difference]: Without dead ends: 33 [2019-12-18 15:43:21,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:43:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-18 15:43:21,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-12-18 15:43:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-18 15:43:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2019-12-18 15:43:21,321 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 12 [2019-12-18 15:43:21,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:21,322 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2019-12-18 15:43:21,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:43:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2019-12-18 15:43:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 15:43:21,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:21,323 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:21,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:21,526 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash -466461505, now seen corresponding path program 8 times [2019-12-18 15:43:21,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:21,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988544207] [2019-12-18 15:43:21,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:21,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988544207] [2019-12-18 15:43:21,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433107141] [2019-12-18 15:43:21,604 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 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-18 15:43:21,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:43:21,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:21,650 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 15:43:21,652 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:21,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:21,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-18 15:43:21,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794410221] [2019-12-18 15:43:21,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 15:43:21,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:21,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 15:43:21,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:43:21,720 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 9 states. [2019-12-18 15:43:21,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:21,850 INFO L93 Difference]: Finished difference Result 37 states and 76 transitions. [2019-12-18 15:43:21,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 15:43:21,851 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-18 15:43:21,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:21,852 INFO L225 Difference]: With dead ends: 37 [2019-12-18 15:43:21,852 INFO L226 Difference]: Without dead ends: 34 [2019-12-18 15:43:21,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:43:21,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-18 15:43:21,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-18 15:43:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-18 15:43:21,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-18 15:43:21,856 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 12 [2019-12-18 15:43:21,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:21,857 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-18 15:43:21,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 15:43:21,857 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-18 15:43:21,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:43:21,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:21,858 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:22,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:22,061 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:22,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:22,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1647973050, now seen corresponding path program 9 times [2019-12-18 15:43:22,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:22,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280813470] [2019-12-18 15:43:22,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:22,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:22,157 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-18 15:43:22,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280813470] [2019-12-18 15:43:22,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530822610] [2019-12-18 15:43:22,159 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 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-18 15:43:22,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 15:43:22,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:22,213 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:43:22,214 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:22,233 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-18 15:43:22,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:22,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-18 15:43:22,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582411724] [2019-12-18 15:43:22,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:43:22,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:22,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:43:22,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:43:22,235 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 10 states. [2019-12-18 15:43:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:22,371 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2019-12-18 15:43:22,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:43:22,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-18 15:43:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:22,372 INFO L225 Difference]: With dead ends: 38 [2019-12-18 15:43:22,372 INFO L226 Difference]: Without dead ends: 35 [2019-12-18 15:43:22,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:43:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-18 15:43:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-12-18 15:43:22,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-18 15:43:22,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2019-12-18 15:43:22,377 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2019-12-18 15:43:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:22,378 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 52 transitions. [2019-12-18 15:43:22,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:43:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 52 transitions. [2019-12-18 15:43:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:43:22,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:22,379 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:22,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:22,586 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:22,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:22,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1575404710, now seen corresponding path program 10 times [2019-12-18 15:43:22,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:22,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361783028] [2019-12-18 15:43:22,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:22,660 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-18 15:43:22,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361783028] [2019-12-18 15:43:22,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156144413] [2019-12-18 15:43:22,661 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 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-18 15:43:22,707 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:43:22,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:22,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 15:43:22,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:22,748 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-18 15:43:22,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:22,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-18 15:43:22,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095895121] [2019-12-18 15:43:22,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 15:43:22,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:22,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 15:43:22,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 15:43:22,750 INFO L87 Difference]: Start difference. First operand 25 states and 52 transitions. Second operand 10 states. [2019-12-18 15:43:22,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:22,864 INFO L93 Difference]: Finished difference Result 39 states and 80 transitions. [2019-12-18 15:43:22,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:43:22,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-18 15:43:22,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:22,865 INFO L225 Difference]: With dead ends: 39 [2019-12-18 15:43:22,865 INFO L226 Difference]: Without dead ends: 36 [2019-12-18 15:43:22,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:43:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-18 15:43:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-18 15:43:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-18 15:43:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-18 15:43:22,870 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 13 [2019-12-18 15:43:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:22,870 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-18 15:43:22,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 15:43:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-18 15:43:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:43:22,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:22,871 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:23,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:23,072 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:23,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:23,072 INFO L82 PathProgramCache]: Analyzing trace with hash 452443059, now seen corresponding path program 11 times [2019-12-18 15:43:23,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:23,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731296136] [2019-12-18 15:43:23,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:23,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731296136] [2019-12-18 15:43:23,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241342987] [2019-12-18 15:43:23,171 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 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-18 15:43:23,218 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-18 15:43:23,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:23,219 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-18 15:43:23,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:23,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:23,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-18 15:43:23,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268454430] [2019-12-18 15:43:23,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:43:23,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:23,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:43:23,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:43:23,237 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 11 states. [2019-12-18 15:43:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:23,369 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-12-18 15:43:23,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 15:43:23,370 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-18 15:43:23,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:23,371 INFO L225 Difference]: With dead ends: 40 [2019-12-18 15:43:23,371 INFO L226 Difference]: Without dead ends: 37 [2019-12-18 15:43:23,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:43:23,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-18 15:43:23,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-12-18 15:43:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-18 15:43:23,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-18 15:43:23,376 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 14 [2019-12-18 15:43:23,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:23,376 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-18 15:43:23,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:43:23,376 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-18 15:43:23,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 15:43:23,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:23,377 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:23,581 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:23,581 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:23,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:23,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1592905449, now seen corresponding path program 12 times [2019-12-18 15:43:23,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:23,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953655688] [2019-12-18 15:43:23,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:23,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953655688] [2019-12-18 15:43:23,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192724131] [2019-12-18 15:43:23,660 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 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-18 15:43:23,715 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-18 15:43:23,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:23,716 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-18 15:43:23,717 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:23,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:23,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-18 15:43:23,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508666042] [2019-12-18 15:43:23,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 15:43:23,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:23,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 15:43:23,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-18 15:43:23,735 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 11 states. [2019-12-18 15:43:23,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:23,889 INFO L93 Difference]: Finished difference Result 41 states and 84 transitions. [2019-12-18 15:43:23,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 15:43:23,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-18 15:43:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:23,891 INFO L225 Difference]: With dead ends: 41 [2019-12-18 15:43:23,891 INFO L226 Difference]: Without dead ends: 38 [2019-12-18 15:43:23,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:43:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-18 15:43:23,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-18 15:43:23,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-18 15:43:23,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-18 15:43:23,895 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 14 [2019-12-18 15:43:23,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:23,895 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-18 15:43:23,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 15:43:23,896 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-18 15:43:23,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:43:23,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:23,896 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:24,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:24,100 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1140833246, now seen corresponding path program 13 times [2019-12-18 15:43:24,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:24,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941928777] [2019-12-18 15:43:24,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:24,196 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:24,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941928777] [2019-12-18 15:43:24,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665085096] [2019-12-18 15:43:24,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 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-18 15:43:24,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:24,250 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:43:24,251 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:24,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:24,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-18 15:43:24,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655986571] [2019-12-18 15:43:24,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:43:24,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:24,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:43:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:43:24,271 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 12 states. [2019-12-18 15:43:24,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:24,445 INFO L93 Difference]: Finished difference Result 42 states and 86 transitions. [2019-12-18 15:43:24,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:43:24,445 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-18 15:43:24,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:24,446 INFO L225 Difference]: With dead ends: 42 [2019-12-18 15:43:24,446 INFO L226 Difference]: Without dead ends: 39 [2019-12-18 15:43:24,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:43:24,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-18 15:43:24,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-12-18 15:43:24,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-18 15:43:24,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2019-12-18 15:43:24,451 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 15 [2019-12-18 15:43:24,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:24,451 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2019-12-18 15:43:24,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:43:24,451 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2019-12-18 15:43:24,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 15:43:24,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:24,452 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:24,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:24,655 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:24,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:24,655 INFO L82 PathProgramCache]: Analyzing trace with hash -2135428606, now seen corresponding path program 14 times [2019-12-18 15:43:24,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:24,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753939584] [2019-12-18 15:43:24,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:24,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:24,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753939584] [2019-12-18 15:43:24,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862418230] [2019-12-18 15:43:24,761 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 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-18 15:43:24,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:43:24,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:24,807 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 15:43:24,808 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:24,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:24,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-18 15:43:24,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505007935] [2019-12-18 15:43:24,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 15:43:24,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:24,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 15:43:24,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 15:43:24,833 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 12 states. [2019-12-18 15:43:24,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:24,988 INFO L93 Difference]: Finished difference Result 43 states and 88 transitions. [2019-12-18 15:43:24,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 15:43:24,989 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-18 15:43:24,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:24,989 INFO L225 Difference]: With dead ends: 43 [2019-12-18 15:43:24,990 INFO L226 Difference]: Without dead ends: 40 [2019-12-18 15:43:24,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:43:24,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-18 15:43:24,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-18 15:43:24,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-18 15:43:24,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-18 15:43:24,997 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 15 [2019-12-18 15:43:24,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:24,997 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-18 15:43:24,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 15:43:24,997 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-18 15:43:24,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 15:43:24,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:24,998 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:25,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:25,199 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:25,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1006092315, now seen corresponding path program 15 times [2019-12-18 15:43:25,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:25,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261608187] [2019-12-18 15:43:25,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:25,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261608187] [2019-12-18 15:43:25,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21464347] [2019-12-18 15:43:25,325 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 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-18 15:43:25,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-18 15:43:25,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:25,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-18 15:43:25,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:25,441 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:25,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:25,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-18 15:43:25,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914146204] [2019-12-18 15:43:25,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:43:25,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:25,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:43:25,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:43:25,443 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 13 states. [2019-12-18 15:43:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:25,656 INFO L93 Difference]: Finished difference Result 44 states and 90 transitions. [2019-12-18 15:43:25,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:43:25,656 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-18 15:43:25,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:25,657 INFO L225 Difference]: With dead ends: 44 [2019-12-18 15:43:25,657 INFO L226 Difference]: Without dead ends: 41 [2019-12-18 15:43:25,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:43:25,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-18 15:43:25,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-12-18 15:43:25,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-18 15:43:25,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-18 15:43:25,661 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 16 [2019-12-18 15:43:25,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:25,661 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-18 15:43:25,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:43:25,662 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-18 15:43:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 15:43:25,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:25,662 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:25,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:25,866 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:25,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:25,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1773777041, now seen corresponding path program 16 times [2019-12-18 15:43:25,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:25,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686874840] [2019-12-18 15:43:25,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:25,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686874840] [2019-12-18 15:43:25,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883130045] [2019-12-18 15:43:25,963 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 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-18 15:43:26,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:43:26,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:26,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-18 15:43:26,024 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:26,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:26,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-18 15:43:26,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414456505] [2019-12-18 15:43:26,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 15:43:26,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:26,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 15:43:26,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:43:26,044 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 13 states. [2019-12-18 15:43:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:26,213 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. [2019-12-18 15:43:26,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:43:26,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-18 15:43:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:26,215 INFO L225 Difference]: With dead ends: 45 [2019-12-18 15:43:26,215 INFO L226 Difference]: Without dead ends: 42 [2019-12-18 15:43:26,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:43:26,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-18 15:43:26,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-18 15:43:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-18 15:43:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-18 15:43:26,220 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 16 [2019-12-18 15:43:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:26,220 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-18 15:43:26,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 15:43:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-18 15:43:26,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:43:26,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:26,221 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:26,426 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:26,426 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:26,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:26,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1124090998, now seen corresponding path program 17 times [2019-12-18 15:43:26,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:26,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074035936] [2019-12-18 15:43:26,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:26,576 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:26,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074035936] [2019-12-18 15:43:26,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612885360] [2019-12-18 15:43:26,577 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 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-18 15:43:26,637 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-12-18 15:43:26,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:26,638 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-18 15:43:26,641 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:26,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:26,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-18 15:43:26,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038334817] [2019-12-18 15:43:26,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:43:26,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:43:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:43:26,664 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 14 states. [2019-12-18 15:43:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:26,918 INFO L93 Difference]: Finished difference Result 46 states and 94 transitions. [2019-12-18 15:43:26,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:43:26,919 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-12-18 15:43:26,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:26,919 INFO L225 Difference]: With dead ends: 46 [2019-12-18 15:43:26,919 INFO L226 Difference]: Without dead ends: 43 [2019-12-18 15:43:26,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:43:26,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-18 15:43:26,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2019-12-18 15:43:26,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-12-18 15:43:26,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 60 transitions. [2019-12-18 15:43:26,923 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 60 transitions. Word has length 17 [2019-12-18 15:43:26,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:26,923 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 60 transitions. [2019-12-18 15:43:26,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:43:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 60 transitions. [2019-12-18 15:43:26,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 15:43:26,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:26,924 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:27,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:27,127 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:27,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:27,128 INFO L82 PathProgramCache]: Analyzing trace with hash 847486634, now seen corresponding path program 18 times [2019-12-18 15:43:27,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:27,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643371485] [2019-12-18 15:43:27,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:27,225 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:27,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643371485] [2019-12-18 15:43:27,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231525688] [2019-12-18 15:43:27,226 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 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-18 15:43:27,283 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-12-18 15:43:27,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:27,285 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-18 15:43:27,288 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:27,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:27,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-12-18 15:43:27,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14486687] [2019-12-18 15:43:27,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 15:43:27,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:27,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 15:43:27,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 15:43:27,312 INFO L87 Difference]: Start difference. First operand 29 states and 60 transitions. Second operand 14 states. [2019-12-18 15:43:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:27,512 INFO L93 Difference]: Finished difference Result 47 states and 96 transitions. [2019-12-18 15:43:27,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:43:27,512 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-12-18 15:43:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:27,513 INFO L225 Difference]: With dead ends: 47 [2019-12-18 15:43:27,514 INFO L226 Difference]: Without dead ends: 44 [2019-12-18 15:43:27,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=357, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:43:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-12-18 15:43:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-12-18 15:43:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-18 15:43:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2019-12-18 15:43:27,518 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 90 transitions. Word has length 17 [2019-12-18 15:43:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:27,518 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 90 transitions. [2019-12-18 15:43:27,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 15:43:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 90 transitions. [2019-12-18 15:43:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:43:27,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:27,519 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:27,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:27,723 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:27,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:27,724 INFO L82 PathProgramCache]: Analyzing trace with hash 487082627, now seen corresponding path program 19 times [2019-12-18 15:43:27,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:27,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737414700] [2019-12-18 15:43:27,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:27,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737414700] [2019-12-18 15:43:27,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776170178] [2019-12-18 15:43:27,854 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 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-18 15:43:27,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:27,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-18 15:43:27,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:27,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:27,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-18 15:43:27,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197405289] [2019-12-18 15:43:27,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:43:27,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:27,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:43:27,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:43:27,950 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. Second operand 15 states. [2019-12-18 15:43:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:28,156 INFO L93 Difference]: Finished difference Result 48 states and 98 transitions. [2019-12-18 15:43:28,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 15:43:28,156 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-18 15:43:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:28,157 INFO L225 Difference]: With dead ends: 48 [2019-12-18 15:43:28,157 INFO L226 Difference]: Without dead ends: 45 [2019-12-18 15:43:28,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=205, Invalid=395, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:43:28,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-18 15:43:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 30. [2019-12-18 15:43:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-18 15:43:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-18 15:43:28,161 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 18 [2019-12-18 15:43:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:28,161 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-18 15:43:28,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:43:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-18 15:43:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:43:28,162 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:28,162 INFO L411 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:28,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:28,369 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:28,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:28,369 INFO L82 PathProgramCache]: Analyzing trace with hash 502282183, now seen corresponding path program 20 times [2019-12-18 15:43:28,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:28,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847866646] [2019-12-18 15:43:28,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:28,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847866646] [2019-12-18 15:43:28,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827085627] [2019-12-18 15:43:28,476 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 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-18 15:43:28,523 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:43:28,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:28,524 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-18 15:43:28,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:28,548 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:28,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:28,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-12-18 15:43:28,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779329947] [2019-12-18 15:43:28,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 15:43:28,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:28,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 15:43:28,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-18 15:43:28,550 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 15 states. [2019-12-18 15:43:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:28,784 INFO L93 Difference]: Finished difference Result 49 states and 100 transitions. [2019-12-18 15:43:28,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 15:43:28,785 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-18 15:43:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:28,786 INFO L225 Difference]: With dead ends: 49 [2019-12-18 15:43:28,786 INFO L226 Difference]: Without dead ends: 46 [2019-12-18 15:43:28,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=219, Invalid=431, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:43:28,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-12-18 15:43:28,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-12-18 15:43:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-18 15:43:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 94 transitions. [2019-12-18 15:43:28,791 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 94 transitions. Word has length 18 [2019-12-18 15:43:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:28,791 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 94 transitions. [2019-12-18 15:43:28,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 15:43:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2019-12-18 15:43:28,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:43:28,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:28,792 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:28,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:28,996 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:28,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:28,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2080307442, now seen corresponding path program 21 times [2019-12-18 15:43:28,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:28,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386301030] [2019-12-18 15:43:28,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:29,108 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:29,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386301030] [2019-12-18 15:43:29,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208303670] [2019-12-18 15:43:29,110 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 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-18 15:43:29,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-18 15:43:29,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:29,167 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-18 15:43:29,168 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:29,191 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:29,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:29,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-18 15:43:29,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764544880] [2019-12-18 15:43:29,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:43:29,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:29,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:43:29,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:43:29,193 INFO L87 Difference]: Start difference. First operand 46 states and 94 transitions. Second operand 16 states. [2019-12-18 15:43:29,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:29,454 INFO L93 Difference]: Finished difference Result 50 states and 102 transitions. [2019-12-18 15:43:29,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:43:29,455 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-12-18 15:43:29,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:29,455 INFO L225 Difference]: With dead ends: 50 [2019-12-18 15:43:29,456 INFO L226 Difference]: Without dead ends: 47 [2019-12-18 15:43:29,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=502, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:43:29,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-12-18 15:43:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-12-18 15:43:29,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-12-18 15:43:29,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 64 transitions. [2019-12-18 15:43:29,460 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 64 transitions. Word has length 19 [2019-12-18 15:43:29,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:29,460 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 64 transitions. [2019-12-18 15:43:29,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:43:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 64 transitions. [2019-12-18 15:43:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:43:29,461 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:29,461 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:29,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:29,664 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:29,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:29,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1609121454, now seen corresponding path program 22 times [2019-12-18 15:43:29,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:29,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636444097] [2019-12-18 15:43:29,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:29,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636444097] [2019-12-18 15:43:29,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387379984] [2019-12-18 15:43:29,790 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 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-18 15:43:29,842 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:43:29,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:29,844 INFO L264 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-18 15:43:29,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:29,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:29,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-12-18 15:43:29,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942572855] [2019-12-18 15:43:29,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 15:43:29,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:29,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 15:43:29,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-18 15:43:29,875 INFO L87 Difference]: Start difference. First operand 31 states and 64 transitions. Second operand 16 states. [2019-12-18 15:43:30,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:30,192 INFO L93 Difference]: Finished difference Result 51 states and 104 transitions. [2019-12-18 15:43:30,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:43:30,192 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2019-12-18 15:43:30,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:30,193 INFO L225 Difference]: With dead ends: 51 [2019-12-18 15:43:30,193 INFO L226 Difference]: Without dead ends: 48 [2019-12-18 15:43:30,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=493, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:43:30,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-18 15:43:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-18 15:43:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-18 15:43:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2019-12-18 15:43:30,196 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 19 [2019-12-18 15:43:30,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:30,200 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2019-12-18 15:43:30,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 15:43:30,200 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2019-12-18 15:43:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 15:43:30,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:30,200 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:30,401 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:30,401 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash -65021205, now seen corresponding path program 23 times [2019-12-18 15:43:30,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:30,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753112334] [2019-12-18 15:43:30,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:30,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:30,527 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-18 15:43:30,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753112334] [2019-12-18 15:43:30,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119291842] [2019-12-18 15:43:30,528 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 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-18 15:43:30,585 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-12-18 15:43:30,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:30,586 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-18 15:43:30,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:30,620 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-18 15:43:30,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:30,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-18 15:43:30,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881699969] [2019-12-18 15:43:30,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:43:30,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:30,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:43:30,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:43:30,622 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 17 states. [2019-12-18 15:43:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:30,890 INFO L93 Difference]: Finished difference Result 52 states and 106 transitions. [2019-12-18 15:43:30,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 15:43:30,890 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-12-18 15:43:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:30,891 INFO L225 Difference]: With dead ends: 52 [2019-12-18 15:43:30,891 INFO L226 Difference]: Without dead ends: 49 [2019-12-18 15:43:30,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=274, Invalid=538, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:43:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-12-18 15:43:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 32. [2019-12-18 15:43:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-18 15:43:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-18 15:43:30,896 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 20 [2019-12-18 15:43:30,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:30,896 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-18 15:43:30,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:43:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-18 15:43:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-18 15:43:30,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:30,897 INFO L411 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:31,099 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:31,100 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:31,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:31,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1656842783, now seen corresponding path program 24 times [2019-12-18 15:43:31,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:31,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611706616] [2019-12-18 15:43:31,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:31,215 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-18 15:43:31,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611706616] [2019-12-18 15:43:31,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425207193] [2019-12-18 15:43:31,216 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 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-18 15:43:31,266 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-12-18 15:43:31,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:31,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-18 15:43:31,270 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:31,293 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-18 15:43:31,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:31,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-12-18 15:43:31,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402088841] [2019-12-18 15:43:31,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 15:43:31,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:31,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 15:43:31,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2019-12-18 15:43:31,294 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 17 states. [2019-12-18 15:43:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:31,599 INFO L93 Difference]: Finished difference Result 53 states and 108 transitions. [2019-12-18 15:43:31,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 15:43:31,599 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-12-18 15:43:31,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:31,600 INFO L225 Difference]: With dead ends: 53 [2019-12-18 15:43:31,600 INFO L226 Difference]: Without dead ends: 50 [2019-12-18 15:43:31,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=290, Invalid=580, Unknown=0, NotChecked=0, Total=870 [2019-12-18 15:43:31,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-18 15:43:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-12-18 15:43:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-18 15:43:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2019-12-18 15:43:31,602 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 20 [2019-12-18 15:43:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:31,602 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2019-12-18 15:43:31,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 15:43:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2019-12-18 15:43:31,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:43:31,603 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:31,603 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:31,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:31,804 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:31,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:31,804 INFO L82 PathProgramCache]: Analyzing trace with hash -2015657050, now seen corresponding path program 25 times [2019-12-18 15:43:31,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:31,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246456856] [2019-12-18 15:43:31,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:31,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246456856] [2019-12-18 15:43:31,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724271202] [2019-12-18 15:43:31,947 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 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-18 15:43:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:31,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 18 conjunts are in the unsatisfiable core [2019-12-18 15:43:32,000 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:32,026 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:32,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:32,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-18 15:43:32,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742957463] [2019-12-18 15:43:32,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:43:32,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:32,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:43:32,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:43:32,028 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 18 states. [2019-12-18 15:43:32,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:32,346 INFO L93 Difference]: Finished difference Result 54 states and 110 transitions. [2019-12-18 15:43:32,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:43:32,346 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-12-18 15:43:32,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:32,347 INFO L225 Difference]: With dead ends: 54 [2019-12-18 15:43:32,347 INFO L226 Difference]: Without dead ends: 51 [2019-12-18 15:43:32,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=330, Invalid=662, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:43:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-12-18 15:43:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-12-18 15:43:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-12-18 15:43:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 68 transitions. [2019-12-18 15:43:32,350 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 68 transitions. Word has length 21 [2019-12-18 15:43:32,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:32,351 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 68 transitions. [2019-12-18 15:43:32,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:43:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 68 transitions. [2019-12-18 15:43:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-18 15:43:32,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:32,351 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:32,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:32,554 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:32,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:32,555 INFO L82 PathProgramCache]: Analyzing trace with hash -177481222, now seen corresponding path program 26 times [2019-12-18 15:43:32,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:32,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298952280] [2019-12-18 15:43:32,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:32,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298952280] [2019-12-18 15:43:32,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039561744] [2019-12-18 15:43:32,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 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-18 15:43:32,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:43:32,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:32,763 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-18 15:43:32,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:32,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:32,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-12-18 15:43:32,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616781893] [2019-12-18 15:43:32,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 15:43:32,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:32,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 15:43:32,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-18 15:43:32,804 INFO L87 Difference]: Start difference. First operand 33 states and 68 transitions. Second operand 18 states. [2019-12-18 15:43:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:33,116 INFO L93 Difference]: Finished difference Result 55 states and 112 transitions. [2019-12-18 15:43:33,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:43:33,116 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-12-18 15:43:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:33,118 INFO L225 Difference]: With dead ends: 55 [2019-12-18 15:43:33,118 INFO L226 Difference]: Without dead ends: 52 [2019-12-18 15:43:33,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=307, Invalid=685, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:43:33,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-12-18 15:43:33,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-12-18 15:43:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-18 15:43:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2019-12-18 15:43:33,121 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 106 transitions. Word has length 21 [2019-12-18 15:43:33,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:33,121 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 106 transitions. [2019-12-18 15:43:33,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 15:43:33,121 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 106 transitions. [2019-12-18 15:43:33,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:43:33,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:33,122 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:33,325 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:33,325 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:33,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:33,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1939140947, now seen corresponding path program 27 times [2019-12-18 15:43:33,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:33,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465216395] [2019-12-18 15:43:33,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:33,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465216395] [2019-12-18 15:43:33,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [336833286] [2019-12-18 15:43:33,485 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 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-18 15:43:33,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-12-18 15:43:33,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:33,545 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-18 15:43:33,546 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:33,576 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:33,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:33,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-18 15:43:33,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666285843] [2019-12-18 15:43:33,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:43:33,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:33,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:43:33,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:43:33,578 INFO L87 Difference]: Start difference. First operand 52 states and 106 transitions. Second operand 19 states. [2019-12-18 15:43:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:33,910 INFO L93 Difference]: Finished difference Result 56 states and 114 transitions. [2019-12-18 15:43:33,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 15:43:33,911 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-12-18 15:43:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:33,911 INFO L225 Difference]: With dead ends: 56 [2019-12-18 15:43:33,912 INFO L226 Difference]: Without dead ends: 53 [2019-12-18 15:43:33,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=353, Invalid=703, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 15:43:33,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-18 15:43:33,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 34. [2019-12-18 15:43:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-18 15:43:33,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-18 15:43:33,915 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 22 [2019-12-18 15:43:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:33,916 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-18 15:43:33,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:43:33,916 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-18 15:43:33,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 15:43:33,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:33,916 INFO L411 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:34,119 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:34,120 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:34,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:34,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1206950281, now seen corresponding path program 28 times [2019-12-18 15:43:34,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:34,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240563565] [2019-12-18 15:43:34,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:34,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240563565] [2019-12-18 15:43:34,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289191622] [2019-12-18 15:43:34,261 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 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-18 15:43:34,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:43:34,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:34,312 INFO L264 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-18 15:43:34,313 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:34,341 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:34,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:34,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-12-18 15:43:34,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599215457] [2019-12-18 15:43:34,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-18 15:43:34,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:34,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-18 15:43:34,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2019-12-18 15:43:34,343 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 19 states. [2019-12-18 15:43:34,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:34,723 INFO L93 Difference]: Finished difference Result 57 states and 116 transitions. [2019-12-18 15:43:34,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 15:43:34,723 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-12-18 15:43:34,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:34,724 INFO L225 Difference]: With dead ends: 57 [2019-12-18 15:43:34,724 INFO L226 Difference]: Without dead ends: 54 [2019-12-18 15:43:34,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=371, Invalid=751, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 15:43:34,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-18 15:43:34,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-12-18 15:43:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-18 15:43:34,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 110 transitions. [2019-12-18 15:43:34,728 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 110 transitions. Word has length 22 [2019-12-18 15:43:34,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:34,728 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 110 transitions. [2019-12-18 15:43:34,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-18 15:43:34,728 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 110 transitions. [2019-12-18 15:43:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:43:34,729 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:34,729 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:34,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:34,930 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:34,930 INFO L82 PathProgramCache]: Analyzing trace with hash -16172482, now seen corresponding path program 29 times [2019-12-18 15:43:34,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:34,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438988017] [2019-12-18 15:43:34,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:35,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438988017] [2019-12-18 15:43:35,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483013728] [2019-12-18 15:43:35,103 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 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-18 15:43:35,155 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-12-18 15:43:35,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:35,157 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-18 15:43:35,158 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:35,183 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:35,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:35,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-18 15:43:35,183 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758698517] [2019-12-18 15:43:35,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:43:35,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:35,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:43:35,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:43:35,184 INFO L87 Difference]: Start difference. First operand 54 states and 110 transitions. Second operand 20 states. [2019-12-18 15:43:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:35,559 INFO L93 Difference]: Finished difference Result 58 states and 118 transitions. [2019-12-18 15:43:35,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:43:35,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-12-18 15:43:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:35,560 INFO L225 Difference]: With dead ends: 58 [2019-12-18 15:43:35,560 INFO L226 Difference]: Without dead ends: 55 [2019-12-18 15:43:35,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=416, Invalid=844, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:43:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-18 15:43:35,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-12-18 15:43:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-12-18 15:43:35,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 72 transitions. [2019-12-18 15:43:35,564 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 72 transitions. Word has length 23 [2019-12-18 15:43:35,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:35,564 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 72 transitions. [2019-12-18 15:43:35,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:43:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 72 transitions. [2019-12-18 15:43:35,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-18 15:43:35,565 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:35,565 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:35,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:35,767 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:35,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:35,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1239247010, now seen corresponding path program 30 times [2019-12-18 15:43:35,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:35,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051899523] [2019-12-18 15:43:35,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:35,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:35,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051899523] [2019-12-18 15:43:35,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896987875] [2019-12-18 15:43:35,932 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 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-18 15:43:35,987 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-12-18 15:43:35,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:35,988 INFO L264 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-18 15:43:35,989 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:36,026 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:36,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:36,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-12-18 15:43:36,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536604126] [2019-12-18 15:43:36,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-18 15:43:36,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:36,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-18 15:43:36,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2019-12-18 15:43:36,029 INFO L87 Difference]: Start difference. First operand 35 states and 72 transitions. Second operand 20 states. [2019-12-18 15:43:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:36,417 INFO L93 Difference]: Finished difference Result 59 states and 120 transitions. [2019-12-18 15:43:36,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:43:36,417 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2019-12-18 15:43:36,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:36,418 INFO L225 Difference]: With dead ends: 59 [2019-12-18 15:43:36,418 INFO L226 Difference]: Without dead ends: 56 [2019-12-18 15:43:36,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=429, Invalid=831, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:43:36,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-12-18 15:43:36,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-12-18 15:43:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-18 15:43:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2019-12-18 15:43:36,421 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 23 [2019-12-18 15:43:36,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:36,422 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2019-12-18 15:43:36,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-18 15:43:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2019-12-18 15:43:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 15:43:36,422 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:36,422 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:36,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:36,623 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:36,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:36,623 INFO L82 PathProgramCache]: Analyzing trace with hash -501346885, now seen corresponding path program 31 times [2019-12-18 15:43:36,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:36,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771596107] [2019-12-18 15:43:36,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:36,808 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:36,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771596107] [2019-12-18 15:43:36,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559931039] [2019-12-18 15:43:36,809 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 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-18 15:43:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:36,861 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-18 15:43:36,861 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:36,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:36,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-18 15:43:36,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734516429] [2019-12-18 15:43:36,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 15:43:36,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:36,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 15:43:36,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-18 15:43:36,889 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 21 states. [2019-12-18 15:43:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:37,306 INFO L93 Difference]: Finished difference Result 60 states and 122 transitions. [2019-12-18 15:43:37,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 15:43:37,306 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2019-12-18 15:43:37,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:37,307 INFO L225 Difference]: With dead ends: 60 [2019-12-18 15:43:37,307 INFO L226 Difference]: Without dead ends: 57 [2019-12-18 15:43:37,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=442, Invalid=890, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 15:43:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-12-18 15:43:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2019-12-18 15:43:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-18 15:43:37,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-18 15:43:37,310 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 24 [2019-12-18 15:43:37,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:37,310 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-18 15:43:37,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 15:43:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-18 15:43:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 15:43:37,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:37,311 INFO L411 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:37,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:37,515 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:37,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:37,516 INFO L82 PathProgramCache]: Analyzing trace with hash -238048049, now seen corresponding path program 32 times [2019-12-18 15:43:37,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:37,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326109662] [2019-12-18 15:43:37,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:37,735 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:37,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326109662] [2019-12-18 15:43:37,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877194766] [2019-12-18 15:43:37,736 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 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-18 15:43:37,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:43:37,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:37,791 INFO L264 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-18 15:43:37,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:37,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:37,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-12-18 15:43:37,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994881301] [2019-12-18 15:43:37,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-18 15:43:37,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:37,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-18 15:43:37,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2019-12-18 15:43:37,831 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 21 states. [2019-12-18 15:43:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:38,232 INFO L93 Difference]: Finished difference Result 61 states and 124 transitions. [2019-12-18 15:43:38,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 15:43:38,232 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2019-12-18 15:43:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:38,233 INFO L225 Difference]: With dead ends: 61 [2019-12-18 15:43:38,233 INFO L226 Difference]: Without dead ends: 58 [2019-12-18 15:43:38,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=462, Invalid=944, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 15:43:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-12-18 15:43:38,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-12-18 15:43:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-18 15:43:38,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 118 transitions. [2019-12-18 15:43:38,237 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 118 transitions. Word has length 24 [2019-12-18 15:43:38,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:38,237 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 118 transitions. [2019-12-18 15:43:38,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-18 15:43:38,237 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 118 transitions. [2019-12-18 15:43:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:43:38,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:38,238 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:38,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:38,439 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:38,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:38,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1638116054, now seen corresponding path program 33 times [2019-12-18 15:43:38,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:38,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080225483] [2019-12-18 15:43:38,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:38,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080225483] [2019-12-18 15:43:38,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151401261] [2019-12-18 15:43:38,619 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 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-18 15:43:38,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-12-18 15:43:38,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:38,689 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-18 15:43:38,690 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:38,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:38,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-18 15:43:38,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740643623] [2019-12-18 15:43:38,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 15:43:38,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:38,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 15:43:38,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:43:38,716 INFO L87 Difference]: Start difference. First operand 58 states and 118 transitions. Second operand 22 states. [2019-12-18 15:43:39,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:39,165 INFO L93 Difference]: Finished difference Result 62 states and 126 transitions. [2019-12-18 15:43:39,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 15:43:39,166 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-12-18 15:43:39,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:39,166 INFO L225 Difference]: With dead ends: 62 [2019-12-18 15:43:39,166 INFO L226 Difference]: Without dead ends: 59 [2019-12-18 15:43:39,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=512, Invalid=1048, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 15:43:39,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-12-18 15:43:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-12-18 15:43:39,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-18 15:43:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 76 transitions. [2019-12-18 15:43:39,169 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 76 transitions. Word has length 25 [2019-12-18 15:43:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:39,169 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 76 transitions. [2019-12-18 15:43:39,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 15:43:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 76 transitions. [2019-12-18 15:43:39,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 15:43:39,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:39,170 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:39,373 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:39,374 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:39,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:39,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1210445130, now seen corresponding path program 34 times [2019-12-18 15:43:39,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:39,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619877337] [2019-12-18 15:43:39,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:39,573 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:39,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619877337] [2019-12-18 15:43:39,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53578056] [2019-12-18 15:43:39,573 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 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-18 15:43:39,631 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:43:39,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:39,632 INFO L264 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-18 15:43:39,633 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:39,681 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:39,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:39,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-12-18 15:43:39,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273422459] [2019-12-18 15:43:39,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 15:43:39,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:39,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 15:43:39,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2019-12-18 15:43:39,684 INFO L87 Difference]: Start difference. First operand 37 states and 76 transitions. Second operand 22 states. [2019-12-18 15:43:40,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:40,139 INFO L93 Difference]: Finished difference Result 63 states and 128 transitions. [2019-12-18 15:43:40,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 15:43:40,139 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2019-12-18 15:43:40,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:40,140 INFO L225 Difference]: With dead ends: 63 [2019-12-18 15:43:40,140 INFO L226 Difference]: Without dead ends: 60 [2019-12-18 15:43:40,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=527, Invalid=1033, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 15:43:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-12-18 15:43:40,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-12-18 15:43:40,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-12-18 15:43:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 122 transitions. [2019-12-18 15:43:40,144 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 122 transitions. Word has length 25 [2019-12-18 15:43:40,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:40,144 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 122 transitions. [2019-12-18 15:43:40,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 15:43:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 122 transitions. [2019-12-18 15:43:40,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:43:40,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:40,145 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:40,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:40,350 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:40,351 INFO L82 PathProgramCache]: Analyzing trace with hash -758009821, now seen corresponding path program 35 times [2019-12-18 15:43:40,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:40,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086959172] [2019-12-18 15:43:40,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:40,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086959172] [2019-12-18 15:43:40,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114316835] [2019-12-18 15:43:40,575 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 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-18 15:43:40,659 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-12-18 15:43:40,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:40,661 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-18 15:43:40,662 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:40,693 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:40,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:40,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-18 15:43:40,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598967934] [2019-12-18 15:43:40,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:43:40,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:40,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:43:40,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:43:40,696 INFO L87 Difference]: Start difference. First operand 60 states and 122 transitions. Second operand 23 states. [2019-12-18 15:43:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:41,213 INFO L93 Difference]: Finished difference Result 64 states and 130 transitions. [2019-12-18 15:43:41,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-18 15:43:41,213 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-12-18 15:43:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:41,214 INFO L225 Difference]: With dead ends: 64 [2019-12-18 15:43:41,214 INFO L226 Difference]: Without dead ends: 61 [2019-12-18 15:43:41,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=541, Invalid=1099, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:43:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-18 15:43:41,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2019-12-18 15:43:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-18 15:43:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-18 15:43:41,217 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 26 [2019-12-18 15:43:41,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:41,217 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-18 15:43:41,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:43:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-18 15:43:41,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 15:43:41,217 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:41,218 INFO L411 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:41,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:41,421 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:41,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:41,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1130906329, now seen corresponding path program 36 times [2019-12-18 15:43:41,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:41,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453914537] [2019-12-18 15:43:41,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:41,614 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:41,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453914537] [2019-12-18 15:43:41,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858063776] [2019-12-18 15:43:41,615 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 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-18 15:43:41,671 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-12-18 15:43:41,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:41,673 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 23 conjunts are in the unsatisfiable core [2019-12-18 15:43:41,674 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:41,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:41,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-12-18 15:43:41,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451508980] [2019-12-18 15:43:41,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 15:43:41,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:41,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 15:43:41,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-12-18 15:43:41,741 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 23 states. [2019-12-18 15:43:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:42,207 INFO L93 Difference]: Finished difference Result 65 states and 132 transitions. [2019-12-18 15:43:42,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 15:43:42,208 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2019-12-18 15:43:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:42,209 INFO L225 Difference]: With dead ends: 65 [2019-12-18 15:43:42,209 INFO L226 Difference]: Without dead ends: 62 [2019-12-18 15:43:42,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=563, Invalid=1159, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 15:43:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-12-18 15:43:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-12-18 15:43:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-12-18 15:43:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 126 transitions. [2019-12-18 15:43:42,213 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 126 transitions. Word has length 26 [2019-12-18 15:43:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:42,213 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 126 transitions. [2019-12-18 15:43:42,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 15:43:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 126 transitions. [2019-12-18 15:43:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:43:42,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:42,214 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:42,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:42,417 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:42,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:42,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2023467666, now seen corresponding path program 37 times [2019-12-18 15:43:42,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:42,418 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079812383] [2019-12-18 15:43:42,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:42,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079812383] [2019-12-18 15:43:42,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859411853] [2019-12-18 15:43:42,652 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 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-18 15:43:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:42,735 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-18 15:43:42,737 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:42,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:42,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-18 15:43:42,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175712267] [2019-12-18 15:43:42,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:43:42,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:43:42,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:43:42,794 INFO L87 Difference]: Start difference. First operand 62 states and 126 transitions. Second operand 24 states. [2019-12-18 15:43:43,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:43,392 INFO L93 Difference]: Finished difference Result 66 states and 134 transitions. [2019-12-18 15:43:43,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 15:43:43,393 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-12-18 15:43:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:43,393 INFO L225 Difference]: With dead ends: 66 [2019-12-18 15:43:43,394 INFO L226 Difference]: Without dead ends: 63 [2019-12-18 15:43:43,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=618, Invalid=1274, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 15:43:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-12-18 15:43:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 39. [2019-12-18 15:43:43,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-18 15:43:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 80 transitions. [2019-12-18 15:43:43,397 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 80 transitions. Word has length 27 [2019-12-18 15:43:43,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:43,397 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 80 transitions. [2019-12-18 15:43:43,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:43:43,397 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 80 transitions. [2019-12-18 15:43:43,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 15:43:43,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:43,398 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:43,601 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:43,601 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:43,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash -698357774, now seen corresponding path program 38 times [2019-12-18 15:43:43,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:43,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195014955] [2019-12-18 15:43:43,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:43,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195014955] [2019-12-18 15:43:43,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053311819] [2019-12-18 15:43:43,841 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 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-18 15:43:43,893 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:43:43,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:43,894 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 24 conjunts are in the unsatisfiable core [2019-12-18 15:43:43,895 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:43,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:43,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-12-18 15:43:43,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234863725] [2019-12-18 15:43:43,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-12-18 15:43:43,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:43,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-12-18 15:43:43,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2019-12-18 15:43:43,932 INFO L87 Difference]: Start difference. First operand 39 states and 80 transitions. Second operand 24 states. [2019-12-18 15:43:44,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:44,422 INFO L93 Difference]: Finished difference Result 67 states and 136 transitions. [2019-12-18 15:43:44,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 15:43:44,422 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 27 [2019-12-18 15:43:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:44,423 INFO L225 Difference]: With dead ends: 67 [2019-12-18 15:43:44,423 INFO L226 Difference]: Without dead ends: 64 [2019-12-18 15:43:44,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=635, Invalid=1257, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 15:43:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-18 15:43:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-12-18 15:43:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-12-18 15:43:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 130 transitions. [2019-12-18 15:43:44,428 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 130 transitions. Word has length 27 [2019-12-18 15:43:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:44,428 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 130 transitions. [2019-12-18 15:43:44,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-12-18 15:43:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 130 transitions. [2019-12-18 15:43:44,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 15:43:44,429 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:44,429 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:44,632 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:44,632 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:44,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:44,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1697011851, now seen corresponding path program 39 times [2019-12-18 15:43:44,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:44,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444827495] [2019-12-18 15:43:44,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:44,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444827495] [2019-12-18 15:43:44,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413267436] [2019-12-18 15:43:44,855 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 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-18 15:43:44,918 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-12-18 15:43:44,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:44,919 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-18 15:43:44,920 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:44,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:44,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-18 15:43:44,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890881481] [2019-12-18 15:43:44,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-18 15:43:44,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:44,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-18 15:43:44,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:43:44,969 INFO L87 Difference]: Start difference. First operand 64 states and 130 transitions. Second operand 25 states. [2019-12-18 15:43:45,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:45,474 INFO L93 Difference]: Finished difference Result 68 states and 138 transitions. [2019-12-18 15:43:45,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:43:45,475 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2019-12-18 15:43:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:45,476 INFO L225 Difference]: With dead ends: 68 [2019-12-18 15:43:45,476 INFO L226 Difference]: Without dead ends: 65 [2019-12-18 15:43:45,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=1440, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 15:43:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-18 15:43:45,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 40. [2019-12-18 15:43:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-18 15:43:45,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-18 15:43:45,480 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 28 [2019-12-18 15:43:45,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:45,480 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-18 15:43:45,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-18 15:43:45,480 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-18 15:43:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 15:43:45,480 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:45,480 INFO L411 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:45,683 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:45,684 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:45,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:45,684 INFO L82 PathProgramCache]: Analyzing trace with hash -174254209, now seen corresponding path program 40 times [2019-12-18 15:43:45,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:45,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33990356] [2019-12-18 15:43:45,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:45,903 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:45,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33990356] [2019-12-18 15:43:45,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261804068] [2019-12-18 15:43:45,904 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 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-18 15:43:45,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:43:45,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:45,959 INFO L264 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-18 15:43:45,960 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:45,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:45,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-12-18 15:43:45,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389993424] [2019-12-18 15:43:45,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-18 15:43:45,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:45,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-18 15:43:45,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=450, Unknown=0, NotChecked=0, Total=600 [2019-12-18 15:43:45,988 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 25 states. [2019-12-18 15:43:46,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:46,553 INFO L93 Difference]: Finished difference Result 69 states and 140 transitions. [2019-12-18 15:43:46,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 15:43:46,553 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 28 [2019-12-18 15:43:46,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:46,554 INFO L225 Difference]: With dead ends: 69 [2019-12-18 15:43:46,554 INFO L226 Difference]: Without dead ends: 66 [2019-12-18 15:43:46,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=674, Invalid=1396, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 15:43:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-12-18 15:43:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-12-18 15:43:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-18 15:43:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 134 transitions. [2019-12-18 15:43:46,557 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 134 transitions. Word has length 28 [2019-12-18 15:43:46,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:46,557 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 134 transitions. [2019-12-18 15:43:46,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-18 15:43:46,558 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 134 transitions. [2019-12-18 15:43:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 15:43:46,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:46,558 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:46,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:46,762 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:46,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:46,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1067760134, now seen corresponding path program 41 times [2019-12-18 15:43:46,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:46,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547001406] [2019-12-18 15:43:46,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:46,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547001406] [2019-12-18 15:43:46,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864474475] [2019-12-18 15:43:46,968 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 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-18 15:43:47,031 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-12-18 15:43:47,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:47,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-18 15:43:47,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:47,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:47,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-18 15:43:47,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260707333] [2019-12-18 15:43:47,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-18 15:43:47,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:47,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-18 15:43:47,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:43:47,062 INFO L87 Difference]: Start difference. First operand 66 states and 134 transitions. Second operand 26 states. [2019-12-18 15:43:47,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:47,655 INFO L93 Difference]: Finished difference Result 70 states and 142 transitions. [2019-12-18 15:43:47,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 15:43:47,656 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-12-18 15:43:47,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:47,657 INFO L225 Difference]: With dead ends: 70 [2019-12-18 15:43:47,657 INFO L226 Difference]: Without dead ends: 67 [2019-12-18 15:43:47,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=734, Invalid=1522, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 15:43:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-12-18 15:43:47,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 41. [2019-12-18 15:43:47,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-18 15:43:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 84 transitions. [2019-12-18 15:43:47,661 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 84 transitions. Word has length 29 [2019-12-18 15:43:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:47,661 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 84 transitions. [2019-12-18 15:43:47,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-18 15:43:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 84 transitions. [2019-12-18 15:43:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 15:43:47,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:47,662 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:47,863 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:47,863 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:47,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:47,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1106913126, now seen corresponding path program 42 times [2019-12-18 15:43:47,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:47,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894362098] [2019-12-18 15:43:47,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:48,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894362098] [2019-12-18 15:43:48,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614897424] [2019-12-18 15:43:48,148 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 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-18 15:43:48,225 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-12-18 15:43:48,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:48,226 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-18 15:43:48,227 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:48,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:48,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-12-18 15:43:48,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245530166] [2019-12-18 15:43:48,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-18 15:43:48,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:48,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-18 15:43:48,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-18 15:43:48,254 INFO L87 Difference]: Start difference. First operand 41 states and 84 transitions. Second operand 26 states. [2019-12-18 15:43:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:48,884 INFO L93 Difference]: Finished difference Result 71 states and 144 transitions. [2019-12-18 15:43:48,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 15:43:48,885 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 29 [2019-12-18 15:43:48,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:48,885 INFO L225 Difference]: With dead ends: 71 [2019-12-18 15:43:48,886 INFO L226 Difference]: Without dead ends: 68 [2019-12-18 15:43:48,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=677, Invalid=1579, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 15:43:48,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-18 15:43:48,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-12-18 15:43:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-12-18 15:43:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 138 transitions. [2019-12-18 15:43:48,889 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 138 transitions. Word has length 29 [2019-12-18 15:43:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:48,889 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 138 transitions. [2019-12-18 15:43:48,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-18 15:43:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 138 transitions. [2019-12-18 15:43:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:43:48,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:48,890 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:49,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:49,093 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:49,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1259174157, now seen corresponding path program 43 times [2019-12-18 15:43:49,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:49,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389030269] [2019-12-18 15:43:49,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:49,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:49,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389030269] [2019-12-18 15:43:49,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254244983] [2019-12-18 15:43:49,342 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 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-18 15:43:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:49,398 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-18 15:43:49,399 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:49,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:49,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-18 15:43:49,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422069952] [2019-12-18 15:43:49,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-18 15:43:49,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:49,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-18 15:43:49,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:43:49,429 INFO L87 Difference]: Start difference. First operand 68 states and 138 transitions. Second operand 27 states. [2019-12-18 15:43:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:50,060 INFO L93 Difference]: Finished difference Result 72 states and 146 transitions. [2019-12-18 15:43:50,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 15:43:50,066 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 30 [2019-12-18 15:43:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:50,067 INFO L225 Difference]: With dead ends: 72 [2019-12-18 15:43:50,067 INFO L226 Difference]: Without dead ends: 69 [2019-12-18 15:43:50,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=769, Invalid=1583, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 15:43:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-12-18 15:43:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2019-12-18 15:43:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-18 15:43:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-18 15:43:50,070 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 30 [2019-12-18 15:43:50,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:50,070 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-18 15:43:50,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-18 15:43:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-18 15:43:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-18 15:43:50,071 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:50,071 INFO L411 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:50,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:50,275 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:50,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:50,275 INFO L82 PathProgramCache]: Analyzing trace with hash 45431767, now seen corresponding path program 44 times [2019-12-18 15:43:50,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:50,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168079706] [2019-12-18 15:43:50,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:50,499 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:50,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168079706] [2019-12-18 15:43:50,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186389145] [2019-12-18 15:43:50,500 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 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-18 15:43:50,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:43:50,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:50,558 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 27 conjunts are in the unsatisfiable core [2019-12-18 15:43:50,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:50,583 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:50,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:50,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-12-18 15:43:50,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313252476] [2019-12-18 15:43:50,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-18 15:43:50,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:50,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-18 15:43:50,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=527, Unknown=0, NotChecked=0, Total=702 [2019-12-18 15:43:50,585 INFO L87 Difference]: Start difference. First operand 42 states and 86 transitions. Second operand 27 states. [2019-12-18 15:43:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:51,222 INFO L93 Difference]: Finished difference Result 73 states and 148 transitions. [2019-12-18 15:43:51,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 15:43:51,223 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 30 [2019-12-18 15:43:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:51,223 INFO L225 Difference]: With dead ends: 73 [2019-12-18 15:43:51,224 INFO L226 Difference]: Without dead ends: 70 [2019-12-18 15:43:51,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=795, Invalid=1655, Unknown=0, NotChecked=0, Total=2450 [2019-12-18 15:43:51,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-18 15:43:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-12-18 15:43:51,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-12-18 15:43:51,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 142 transitions. [2019-12-18 15:43:51,227 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 142 transitions. Word has length 30 [2019-12-18 15:43:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:51,228 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 142 transitions. [2019-12-18 15:43:51,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-18 15:43:51,228 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 142 transitions. [2019-12-18 15:43:51,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 15:43:51,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:51,228 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:51,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:51,432 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:51,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash -379692898, now seen corresponding path program 45 times [2019-12-18 15:43:51,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:51,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549419160] [2019-12-18 15:43:51,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:51,742 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:51,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549419160] [2019-12-18 15:43:51,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464266579] [2019-12-18 15:43:51,743 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 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-18 15:43:51,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-12-18 15:43:51,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:51,807 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-18 15:43:51,808 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:51,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:51,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-18 15:43:51,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753769535] [2019-12-18 15:43:51,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-18 15:43:51,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:51,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-18 15:43:51,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:43:51,845 INFO L87 Difference]: Start difference. First operand 70 states and 142 transitions. Second operand 28 states. [2019-12-18 15:43:52,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:52,485 INFO L93 Difference]: Finished difference Result 74 states and 150 transitions. [2019-12-18 15:43:52,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 15:43:52,486 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 31 [2019-12-18 15:43:52,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:52,487 INFO L225 Difference]: With dead ends: 74 [2019-12-18 15:43:52,487 INFO L226 Difference]: Without dead ends: 71 [2019-12-18 15:43:52,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=860, Invalid=1792, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 15:43:52,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-12-18 15:43:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 43. [2019-12-18 15:43:52,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-18 15:43:52,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 88 transitions. [2019-12-18 15:43:52,491 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 88 transitions. Word has length 31 [2019-12-18 15:43:52,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:52,491 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 88 transitions. [2019-12-18 15:43:52,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-18 15:43:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 88 transitions. [2019-12-18 15:43:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-18 15:43:52,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:52,492 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:52,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:52,695 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:52,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:52,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1408384834, now seen corresponding path program 46 times [2019-12-18 15:43:52,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:52,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420224173] [2019-12-18 15:43:52,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:52,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420224173] [2019-12-18 15:43:52,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585730062] [2019-12-18 15:43:52,977 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 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-18 15:43:53,029 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:43:53,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:53,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 28 conjunts are in the unsatisfiable core [2019-12-18 15:43:53,032 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:53,056 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:53,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:53,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-12-18 15:43:53,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043620673] [2019-12-18 15:43:53,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-18 15:43:53,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:53,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-18 15:43:53,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2019-12-18 15:43:53,058 INFO L87 Difference]: Start difference. First operand 43 states and 88 transitions. Second operand 28 states. [2019-12-18 15:43:53,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:53,675 INFO L93 Difference]: Finished difference Result 75 states and 152 transitions. [2019-12-18 15:43:53,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 15:43:53,676 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 31 [2019-12-18 15:43:53,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:53,677 INFO L225 Difference]: With dead ends: 75 [2019-12-18 15:43:53,677 INFO L226 Difference]: Without dead ends: 72 [2019-12-18 15:43:53,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=881, Invalid=1771, Unknown=0, NotChecked=0, Total=2652 [2019-12-18 15:43:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-12-18 15:43:53,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-12-18 15:43:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-18 15:43:53,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 146 transitions. [2019-12-18 15:43:53,682 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 146 transitions. Word has length 31 [2019-12-18 15:43:53,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:53,682 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 146 transitions. [2019-12-18 15:43:53,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-18 15:43:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 146 transitions. [2019-12-18 15:43:53,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 15:43:53,682 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:53,683 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:53,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:53,886 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:53,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:53,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1114422107, now seen corresponding path program 47 times [2019-12-18 15:43:53,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:53,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468311540] [2019-12-18 15:43:53,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:54,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468311540] [2019-12-18 15:43:54,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930764937] [2019-12-18 15:43:54,162 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 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-18 15:43:54,226 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2019-12-18 15:43:54,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:54,228 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-18 15:43:54,229 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:54,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:54,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-12-18 15:43:54,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938777417] [2019-12-18 15:43:54,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-18 15:43:54,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:54,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-18 15:43:54,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:43:54,252 INFO L87 Difference]: Start difference. First operand 72 states and 146 transitions. Second operand 29 states. [2019-12-18 15:43:54,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:54,921 INFO L93 Difference]: Finished difference Result 76 states and 154 transitions. [2019-12-18 15:43:54,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-18 15:43:54,921 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2019-12-18 15:43:54,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:54,922 INFO L225 Difference]: With dead ends: 76 [2019-12-18 15:43:54,922 INFO L226 Difference]: Without dead ends: 73 [2019-12-18 15:43:54,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=898, Invalid=1858, Unknown=0, NotChecked=0, Total=2756 [2019-12-18 15:43:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-12-18 15:43:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2019-12-18 15:43:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-12-18 15:43:54,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2019-12-18 15:43:54,925 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 90 transitions. Word has length 32 [2019-12-18 15:43:54,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:54,925 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 90 transitions. [2019-12-18 15:43:54,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-18 15:43:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 90 transitions. [2019-12-18 15:43:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 15:43:54,926 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:54,926 INFO L411 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:55,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:55,127 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:55,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:55,127 INFO L82 PathProgramCache]: Analyzing trace with hash 710257199, now seen corresponding path program 48 times [2019-12-18 15:43:55,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:55,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299294303] [2019-12-18 15:43:55,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:55,508 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:55,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299294303] [2019-12-18 15:43:55,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349103927] [2019-12-18 15:43:55,509 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 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-18 15:43:55,586 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-12-18 15:43:55,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:55,588 INFO L264 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 29 conjunts are in the unsatisfiable core [2019-12-18 15:43:55,589 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:55,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:55,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-12-18 15:43:55,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935584798] [2019-12-18 15:43:55,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-18 15:43:55,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:55,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-18 15:43:55,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2019-12-18 15:43:55,618 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. Second operand 29 states. [2019-12-18 15:43:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:56,297 INFO L93 Difference]: Finished difference Result 77 states and 156 transitions. [2019-12-18 15:43:56,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 15:43:56,297 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 32 [2019-12-18 15:43:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:56,298 INFO L225 Difference]: With dead ends: 77 [2019-12-18 15:43:56,299 INFO L226 Difference]: Without dead ends: 74 [2019-12-18 15:43:56,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=926, Invalid=1936, Unknown=0, NotChecked=0, Total=2862 [2019-12-18 15:43:56,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-18 15:43:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-18 15:43:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-18 15:43:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 150 transitions. [2019-12-18 15:43:56,302 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 150 transitions. Word has length 32 [2019-12-18 15:43:56,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:56,303 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 150 transitions. [2019-12-18 15:43:56,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-18 15:43:56,303 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 150 transitions. [2019-12-18 15:43:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 15:43:56,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:56,304 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:56,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:56,507 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:56,508 INFO L82 PathProgramCache]: Analyzing trace with hash 187347254, now seen corresponding path program 49 times [2019-12-18 15:43:56,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:56,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30153633] [2019-12-18 15:43:56,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:56,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30153633] [2019-12-18 15:43:56,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837606479] [2019-12-18 15:43:56,785 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 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-18 15:43:56,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:56,845 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-18 15:43:56,845 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:56,876 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:56,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:56,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-18 15:43:56,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726214036] [2019-12-18 15:43:56,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-18 15:43:56,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:56,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-18 15:43:56,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-12-18 15:43:56,879 INFO L87 Difference]: Start difference. First operand 74 states and 150 transitions. Second operand 30 states. [2019-12-18 15:43:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:57,599 INFO L93 Difference]: Finished difference Result 78 states and 158 transitions. [2019-12-18 15:43:57,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:43:57,599 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 33 [2019-12-18 15:43:57,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:57,601 INFO L225 Difference]: With dead ends: 78 [2019-12-18 15:43:57,601 INFO L226 Difference]: Without dead ends: 75 [2019-12-18 15:43:57,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=996, Invalid=2084, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 15:43:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-12-18 15:43:57,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 45. [2019-12-18 15:43:57,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-18 15:43:57,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 92 transitions. [2019-12-18 15:43:57,604 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 92 transitions. Word has length 33 [2019-12-18 15:43:57,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:57,604 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 92 transitions. [2019-12-18 15:43:57,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-18 15:43:57,604 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 92 transitions. [2019-12-18 15:43:57,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 15:43:57,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:57,605 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:57,807 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:57,808 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:57,808 INFO L82 PathProgramCache]: Analyzing trace with hash 543136746, now seen corresponding path program 50 times [2019-12-18 15:43:57,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:57,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437416288] [2019-12-18 15:43:57,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:58,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437416288] [2019-12-18 15:43:58,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381252915] [2019-12-18 15:43:58,108 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 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-18 15:43:58,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:43:58,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:58,177 INFO L264 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-18 15:43:58,178 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:58,198 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:58,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:58,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-12-18 15:43:58,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121925467] [2019-12-18 15:43:58,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-18 15:43:58,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:58,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-18 15:43:58,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2019-12-18 15:43:58,200 INFO L87 Difference]: Start difference. First operand 45 states and 92 transitions. Second operand 30 states. [2019-12-18 15:43:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:43:58,903 INFO L93 Difference]: Finished difference Result 79 states and 160 transitions. [2019-12-18 15:43:58,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 15:43:58,904 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 33 [2019-12-18 15:43:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:43:58,905 INFO L225 Difference]: With dead ends: 79 [2019-12-18 15:43:58,905 INFO L226 Difference]: Without dead ends: 76 [2019-12-18 15:43:58,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1019, Invalid=2061, Unknown=0, NotChecked=0, Total=3080 [2019-12-18 15:43:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-12-18 15:43:58,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-12-18 15:43:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-18 15:43:58,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 154 transitions. [2019-12-18 15:43:58,909 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 154 transitions. Word has length 33 [2019-12-18 15:43:58,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:43:58,909 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 154 transitions. [2019-12-18 15:43:58,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-18 15:43:58,909 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 154 transitions. [2019-12-18 15:43:58,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 15:43:58,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:43:58,910 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:43:59,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:43:59,113 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:43:59,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:43:59,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1512797635, now seen corresponding path program 51 times [2019-12-18 15:43:59,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:43:59,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23251810] [2019-12-18 15:43:59,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:43:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:43:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:59,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23251810] [2019-12-18 15:43:59,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278962987] [2019-12-18 15:43:59,429 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 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-18 15:43:59,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-12-18 15:43:59,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:43:59,499 INFO L264 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-18 15:43:59,500 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:43:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:43:59,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:43:59,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-12-18 15:43:59,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907679229] [2019-12-18 15:43:59,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-18 15:43:59,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:43:59,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-18 15:43:59,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2019-12-18 15:43:59,551 INFO L87 Difference]: Start difference. First operand 76 states and 154 transitions. Second operand 31 states. [2019-12-18 15:44:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:00,247 INFO L93 Difference]: Finished difference Result 80 states and 162 transitions. [2019-12-18 15:44:00,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 15:44:00,248 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 34 [2019-12-18 15:44:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:00,249 INFO L225 Difference]: With dead ends: 80 [2019-12-18 15:44:00,249 INFO L226 Difference]: Without dead ends: 77 [2019-12-18 15:44:00,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=2316, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 15:44:00,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-12-18 15:44:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 46. [2019-12-18 15:44:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-12-18 15:44:00,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 94 transitions. [2019-12-18 15:44:00,253 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 94 transitions. Word has length 34 [2019-12-18 15:44:00,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:00,253 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 94 transitions. [2019-12-18 15:44:00,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-18 15:44:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 94 transitions. [2019-12-18 15:44:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 15:44:00,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:00,254 INFO L411 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:00,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:00,457 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:00,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:00,458 INFO L82 PathProgramCache]: Analyzing trace with hash -342629753, now seen corresponding path program 52 times [2019-12-18 15:44:00,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:00,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776508218] [2019-12-18 15:44:00,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:00,763 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:00,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776508218] [2019-12-18 15:44:00,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99983823] [2019-12-18 15:44:00,764 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 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-18 15:44:00,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:44:00,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:00,822 INFO L264 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-18 15:44:00,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:00,846 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:00,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:00,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-12-18 15:44:00,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206714167] [2019-12-18 15:44:00,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-12-18 15:44:00,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:00,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-12-18 15:44:00,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=699, Unknown=0, NotChecked=0, Total=930 [2019-12-18 15:44:00,849 INFO L87 Difference]: Start difference. First operand 46 states and 94 transitions. Second operand 31 states. [2019-12-18 15:44:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:01,590 INFO L93 Difference]: Finished difference Result 81 states and 164 transitions. [2019-12-18 15:44:01,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 15:44:01,590 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 34 [2019-12-18 15:44:01,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:01,591 INFO L225 Difference]: With dead ends: 81 [2019-12-18 15:44:01,592 INFO L226 Difference]: Without dead ends: 78 [2019-12-18 15:44:01,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1067, Invalid=2239, Unknown=0, NotChecked=0, Total=3306 [2019-12-18 15:44:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-18 15:44:01,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-12-18 15:44:01,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-12-18 15:44:01,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 158 transitions. [2019-12-18 15:44:01,596 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 158 transitions. Word has length 34 [2019-12-18 15:44:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:01,596 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 158 transitions. [2019-12-18 15:44:01,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-12-18 15:44:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 158 transitions. [2019-12-18 15:44:01,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 15:44:01,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:01,597 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:01,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:01,800 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:01,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash -347913266, now seen corresponding path program 53 times [2019-12-18 15:44:01,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:01,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108284685] [2019-12-18 15:44:01,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:02,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108284685] [2019-12-18 15:44:02,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582331907] [2019-12-18 15:44:02,211 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 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-18 15:44:02,276 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-12-18 15:44:02,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:02,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-18 15:44:02,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:02,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:02,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-12-18 15:44:02,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376736930] [2019-12-18 15:44:02,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-18 15:44:02,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:02,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-18 15:44:02,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:44:02,314 INFO L87 Difference]: Start difference. First operand 78 states and 158 transitions. Second operand 32 states. [2019-12-18 15:44:03,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:03,125 INFO L93 Difference]: Finished difference Result 82 states and 166 transitions. [2019-12-18 15:44:03,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 15:44:03,125 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 35 [2019-12-18 15:44:03,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:03,126 INFO L225 Difference]: With dead ends: 82 [2019-12-18 15:44:03,126 INFO L226 Difference]: Without dead ends: 79 [2019-12-18 15:44:03,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1142, Invalid=2398, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 15:44:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-12-18 15:44:03,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 47. [2019-12-18 15:44:03,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-18 15:44:03,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 96 transitions. [2019-12-18 15:44:03,130 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 96 transitions. Word has length 35 [2019-12-18 15:44:03,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:03,130 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 96 transitions. [2019-12-18 15:44:03,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-18 15:44:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 96 transitions. [2019-12-18 15:44:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 15:44:03,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:03,131 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:03,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:03,334 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:03,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2031587694, now seen corresponding path program 54 times [2019-12-18 15:44:03,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:03,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885376512] [2019-12-18 15:44:03,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:03,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885376512] [2019-12-18 15:44:03,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947273526] [2019-12-18 15:44:03,654 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 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-18 15:44:03,730 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-12-18 15:44:03,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:03,731 INFO L264 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 32 conjunts are in the unsatisfiable core [2019-12-18 15:44:03,732 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:03,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:03,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-12-18 15:44:03,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782975738] [2019-12-18 15:44:03,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-18 15:44:03,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:03,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-18 15:44:03,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=746, Unknown=0, NotChecked=0, Total=992 [2019-12-18 15:44:03,756 INFO L87 Difference]: Start difference. First operand 47 states and 96 transitions. Second operand 32 states. [2019-12-18 15:44:04,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:04,546 INFO L93 Difference]: Finished difference Result 83 states and 168 transitions. [2019-12-18 15:44:04,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 15:44:04,547 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 35 [2019-12-18 15:44:04,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:04,547 INFO L225 Difference]: With dead ends: 83 [2019-12-18 15:44:04,548 INFO L226 Difference]: Without dead ends: 80 [2019-12-18 15:44:04,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1167, Invalid=2373, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 15:44:04,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-12-18 15:44:04,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-12-18 15:44:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-12-18 15:44:04,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 162 transitions. [2019-12-18 15:44:04,551 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 162 transitions. Word has length 35 [2019-12-18 15:44:04,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:04,551 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 162 transitions. [2019-12-18 15:44:04,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-18 15:44:04,552 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 162 transitions. [2019-12-18 15:44:04,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 15:44:04,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:04,552 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:04,754 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:04,754 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:04,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:04,755 INFO L82 PathProgramCache]: Analyzing trace with hash 2099590699, now seen corresponding path program 55 times [2019-12-18 15:44:04,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:04,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008997339] [2019-12-18 15:44:04,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:05,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008997339] [2019-12-18 15:44:05,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238766923] [2019-12-18 15:44:05,089 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 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-18 15:44:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:05,151 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-18 15:44:05,152 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:05,176 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:05,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:05,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-18 15:44:05,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310830143] [2019-12-18 15:44:05,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-18 15:44:05,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:05,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-18 15:44:05,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 15:44:05,178 INFO L87 Difference]: Start difference. First operand 80 states and 162 transitions. Second operand 33 states. [2019-12-18 15:44:06,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:06,008 INFO L93 Difference]: Finished difference Result 84 states and 170 transitions. [2019-12-18 15:44:06,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 15:44:06,008 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2019-12-18 15:44:06,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:06,009 INFO L225 Difference]: With dead ends: 84 [2019-12-18 15:44:06,010 INFO L226 Difference]: Without dead ends: 81 [2019-12-18 15:44:06,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1186, Invalid=2474, Unknown=0, NotChecked=0, Total=3660 [2019-12-18 15:44:06,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-12-18 15:44:06,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2019-12-18 15:44:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-18 15:44:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 98 transitions. [2019-12-18 15:44:06,014 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 98 transitions. Word has length 36 [2019-12-18 15:44:06,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:06,014 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 98 transitions. [2019-12-18 15:44:06,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-18 15:44:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 98 transitions. [2019-12-18 15:44:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-18 15:44:06,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:06,015 INFO L411 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:06,218 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:06,218 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:06,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:06,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1445291231, now seen corresponding path program 56 times [2019-12-18 15:44:06,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:06,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667473845] [2019-12-18 15:44:06,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:06,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667473845] [2019-12-18 15:44:06,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921967001] [2019-12-18 15:44:06,547 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 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-18 15:44:06,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:44:06,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:06,612 INFO L264 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 33 conjunts are in the unsatisfiable core [2019-12-18 15:44:06,613 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:06,645 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:06,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:06,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-12-18 15:44:06,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765660722] [2019-12-18 15:44:06,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-12-18 15:44:06,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:06,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-12-18 15:44:06,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=794, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 15:44:06,646 INFO L87 Difference]: Start difference. First operand 48 states and 98 transitions. Second operand 33 states. [2019-12-18 15:44:07,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:07,467 INFO L93 Difference]: Finished difference Result 85 states and 172 transitions. [2019-12-18 15:44:07,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-18 15:44:07,467 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2019-12-18 15:44:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:07,468 INFO L225 Difference]: With dead ends: 85 [2019-12-18 15:44:07,469 INFO L226 Difference]: Without dead ends: 82 [2019-12-18 15:44:07,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1218, Invalid=2564, Unknown=0, NotChecked=0, Total=3782 [2019-12-18 15:44:07,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-12-18 15:44:07,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-12-18 15:44:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-18 15:44:07,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 166 transitions. [2019-12-18 15:44:07,472 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 166 transitions. Word has length 36 [2019-12-18 15:44:07,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:07,472 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 166 transitions. [2019-12-18 15:44:07,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-12-18 15:44:07,473 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 166 transitions. [2019-12-18 15:44:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 15:44:07,473 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:07,473 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:07,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:07,676 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:07,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:07,677 INFO L82 PathProgramCache]: Analyzing trace with hash 662802534, now seen corresponding path program 57 times [2019-12-18 15:44:07,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:07,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802165553] [2019-12-18 15:44:07,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:07,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:08,030 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-18 15:44:08,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802165553] [2019-12-18 15:44:08,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564556581] [2019-12-18 15:44:08,031 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 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-18 15:44:08,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-12-18 15:44:08,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:08,103 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-18 15:44:08,104 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:08,130 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-18 15:44:08,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:08,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-12-18 15:44:08,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876007170] [2019-12-18 15:44:08,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-18 15:44:08,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:08,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-18 15:44:08,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 15:44:08,132 INFO L87 Difference]: Start difference. First operand 82 states and 166 transitions. Second operand 34 states. [2019-12-18 15:44:09,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:09,003 INFO L93 Difference]: Finished difference Result 86 states and 174 transitions. [2019-12-18 15:44:09,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:44:09,004 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 37 [2019-12-18 15:44:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:09,005 INFO L225 Difference]: With dead ends: 86 [2019-12-18 15:44:09,005 INFO L226 Difference]: Without dead ends: 83 [2019-12-18 15:44:09,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 686 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1298, Invalid=2734, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 15:44:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-18 15:44:09,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 49. [2019-12-18 15:44:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-12-18 15:44:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 100 transitions. [2019-12-18 15:44:09,008 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 100 transitions. Word has length 37 [2019-12-18 15:44:09,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:09,009 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 100 transitions. [2019-12-18 15:44:09,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-18 15:44:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 100 transitions. [2019-12-18 15:44:09,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 15:44:09,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:09,009 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:09,213 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:09,213 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:09,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:09,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1854355258, now seen corresponding path program 58 times [2019-12-18 15:44:09,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:09,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469127037] [2019-12-18 15:44:09,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:09,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:09,747 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-18 15:44:09,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469127037] [2019-12-18 15:44:09,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726625343] [2019-12-18 15:44:09,748 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 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-18 15:44:09,844 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:44:09,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:09,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-18 15:44:09,849 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:09,898 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-18 15:44:09,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:09,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-12-18 15:44:09,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499060808] [2019-12-18 15:44:09,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-12-18 15:44:09,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:09,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-12-18 15:44:09,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2019-12-18 15:44:09,901 INFO L87 Difference]: Start difference. First operand 49 states and 100 transitions. Second operand 34 states. [2019-12-18 15:44:11,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:11,049 INFO L93 Difference]: Finished difference Result 87 states and 176 transitions. [2019-12-18 15:44:11,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:44:11,049 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 37 [2019-12-18 15:44:11,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:11,050 INFO L225 Difference]: With dead ends: 87 [2019-12-18 15:44:11,050 INFO L226 Difference]: Without dead ends: 84 [2019-12-18 15:44:11,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1325, Invalid=2707, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 15:44:11,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-12-18 15:44:11,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-12-18 15:44:11,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-12-18 15:44:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 170 transitions. [2019-12-18 15:44:11,054 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 170 transitions. Word has length 37 [2019-12-18 15:44:11,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:11,055 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 170 transitions. [2019-12-18 15:44:11,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-12-18 15:44:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 170 transitions. [2019-12-18 15:44:11,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 15:44:11,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:11,055 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:11,258 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:11,259 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:11,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:11,259 INFO L82 PathProgramCache]: Analyzing trace with hash -927957869, now seen corresponding path program 59 times [2019-12-18 15:44:11,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:11,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875717568] [2019-12-18 15:44:11,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:11,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875717568] [2019-12-18 15:44:11,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723240187] [2019-12-18 15:44:11,638 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 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-18 15:44:11,706 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-12-18 15:44:11,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:11,708 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-18 15:44:11,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:11,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:11,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-18 15:44:11,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721332414] [2019-12-18 15:44:11,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-18 15:44:11,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:11,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-18 15:44:11,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 15:44:11,757 INFO L87 Difference]: Start difference. First operand 84 states and 170 transitions. Second operand 35 states. [2019-12-18 15:44:12,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:12,674 INFO L93 Difference]: Finished difference Result 88 states and 178 transitions. [2019-12-18 15:44:12,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-18 15:44:12,674 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2019-12-18 15:44:12,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:12,675 INFO L225 Difference]: With dead ends: 88 [2019-12-18 15:44:12,676 INFO L226 Difference]: Without dead ends: 85 [2019-12-18 15:44:12,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1345, Invalid=2815, Unknown=0, NotChecked=0, Total=4160 [2019-12-18 15:44:12,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-18 15:44:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2019-12-18 15:44:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-18 15:44:12,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 102 transitions. [2019-12-18 15:44:12,680 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 102 transitions. Word has length 38 [2019-12-18 15:44:12,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:12,681 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 102 transitions. [2019-12-18 15:44:12,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-18 15:44:12,681 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 102 transitions. [2019-12-18 15:44:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-18 15:44:12,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:12,681 INFO L411 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:12,884 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:12,884 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:12,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:12,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1650438455, now seen corresponding path program 60 times [2019-12-18 15:44:12,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:12,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062949666] [2019-12-18 15:44:12,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:13,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062949666] [2019-12-18 15:44:13,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671311575] [2019-12-18 15:44:13,241 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 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-18 15:44:13,316 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-12-18 15:44:13,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:13,318 INFO L264 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2019-12-18 15:44:13,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:13,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:13,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-12-18 15:44:13,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149323559] [2019-12-18 15:44:13,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-12-18 15:44:13,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:13,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-12-18 15:44:13,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=895, Unknown=0, NotChecked=0, Total=1190 [2019-12-18 15:44:13,354 INFO L87 Difference]: Start difference. First operand 50 states and 102 transitions. Second operand 35 states. [2019-12-18 15:44:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:14,249 INFO L93 Difference]: Finished difference Result 89 states and 180 transitions. [2019-12-18 15:44:14,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-18 15:44:14,249 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2019-12-18 15:44:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:14,250 INFO L225 Difference]: With dead ends: 89 [2019-12-18 15:44:14,250 INFO L226 Difference]: Without dead ends: 86 [2019-12-18 15:44:14,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 804 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1379, Invalid=2911, Unknown=0, NotChecked=0, Total=4290 [2019-12-18 15:44:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-12-18 15:44:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-12-18 15:44:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-12-18 15:44:14,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 174 transitions. [2019-12-18 15:44:14,254 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 174 transitions. Word has length 38 [2019-12-18 15:44:14,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:14,255 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 174 transitions. [2019-12-18 15:44:14,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-12-18 15:44:14,255 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 174 transitions. [2019-12-18 15:44:14,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 15:44:14,255 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:14,256 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:14,459 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:14,459 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:14,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:14,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1298077438, now seen corresponding path program 61 times [2019-12-18 15:44:14,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:14,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171349692] [2019-12-18 15:44:14,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:14,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171349692] [2019-12-18 15:44:14,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023854242] [2019-12-18 15:44:14,876 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 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-18 15:44:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:14,938 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-18 15:44:14,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:14,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:14,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-12-18 15:44:14,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877150897] [2019-12-18 15:44:14,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-18 15:44:14,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:14,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-18 15:44:14,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=948, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:44:14,975 INFO L87 Difference]: Start difference. First operand 86 states and 174 transitions. Second operand 36 states. [2019-12-18 15:44:15,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:15,961 INFO L93 Difference]: Finished difference Result 90 states and 182 transitions. [2019-12-18 15:44:15,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 15:44:15,962 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2019-12-18 15:44:15,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:15,963 INFO L225 Difference]: With dead ends: 90 [2019-12-18 15:44:15,963 INFO L226 Difference]: Without dead ends: 87 [2019-12-18 15:44:15,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1464, Invalid=3092, Unknown=0, NotChecked=0, Total=4556 [2019-12-18 15:44:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-12-18 15:44:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 51. [2019-12-18 15:44:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-18 15:44:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 104 transitions. [2019-12-18 15:44:15,966 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 104 transitions. Word has length 39 [2019-12-18 15:44:15,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:15,966 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 104 transitions. [2019-12-18 15:44:15,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-18 15:44:15,966 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 104 transitions. [2019-12-18 15:44:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 15:44:15,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:15,966 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:16,167 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:16,167 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:16,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:16,168 INFO L82 PathProgramCache]: Analyzing trace with hash -376015390, now seen corresponding path program 62 times [2019-12-18 15:44:16,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:16,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275870905] [2019-12-18 15:44:16,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:16,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275870905] [2019-12-18 15:44:16,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61014750] [2019-12-18 15:44:16,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 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-18 15:44:16,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:44:16,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:16,607 INFO L264 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-18 15:44:16,608 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:16,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:16,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-12-18 15:44:16,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263531324] [2019-12-18 15:44:16,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-18 15:44:16,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:16,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-18 15:44:16,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=948, Unknown=0, NotChecked=0, Total=1260 [2019-12-18 15:44:16,659 INFO L87 Difference]: Start difference. First operand 51 states and 104 transitions. Second operand 36 states. [2019-12-18 15:44:18,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:18,013 INFO L93 Difference]: Finished difference Result 91 states and 184 transitions. [2019-12-18 15:44:18,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 15:44:18,014 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 39 [2019-12-18 15:44:18,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:18,014 INFO L225 Difference]: With dead ends: 91 [2019-12-18 15:44:18,015 INFO L226 Difference]: Without dead ends: 88 [2019-12-18 15:44:18,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1342, Invalid=3214, Unknown=0, NotChecked=0, Total=4556 [2019-12-18 15:44:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-12-18 15:44:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-12-18 15:44:18,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-18 15:44:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 178 transitions. [2019-12-18 15:44:18,017 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 178 transitions. Word has length 39 [2019-12-18 15:44:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:18,017 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 178 transitions. [2019-12-18 15:44:18,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-18 15:44:18,018 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 178 transitions. [2019-12-18 15:44:18,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 15:44:18,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:18,018 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:18,221 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:18,221 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:18,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:18,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1585694971, now seen corresponding path program 63 times [2019-12-18 15:44:18,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:18,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255593827] [2019-12-18 15:44:18,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:18,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:18,899 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:18,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255593827] [2019-12-18 15:44:18,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339385662] [2019-12-18 15:44:18,900 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 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-18 15:44:19,020 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-12-18 15:44:19,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:19,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-18 15:44:19,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:19,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:19,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-18 15:44:19,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218803901] [2019-12-18 15:44:19,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-18 15:44:19,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:19,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-18 15:44:19,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 15:44:19,080 INFO L87 Difference]: Start difference. First operand 88 states and 178 transitions. Second operand 37 states. [2019-12-18 15:44:20,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:20,453 INFO L93 Difference]: Finished difference Result 92 states and 186 transitions. [2019-12-18 15:44:20,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 15:44:20,454 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 40 [2019-12-18 15:44:20,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:20,455 INFO L225 Difference]: With dead ends: 92 [2019-12-18 15:44:20,455 INFO L226 Difference]: Without dead ends: 89 [2019-12-18 15:44:20,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1514, Invalid=3178, Unknown=0, NotChecked=0, Total=4692 [2019-12-18 15:44:20,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-12-18 15:44:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 52. [2019-12-18 15:44:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-18 15:44:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2019-12-18 15:44:20,459 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 106 transitions. Word has length 40 [2019-12-18 15:44:20,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:20,459 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 106 transitions. [2019-12-18 15:44:20,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-18 15:44:20,459 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 106 transitions. [2019-12-18 15:44:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 15:44:20,460 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:20,460 INFO L411 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:20,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:20,665 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:20,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:20,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1228425103, now seen corresponding path program 64 times [2019-12-18 15:44:20,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:20,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838147594] [2019-12-18 15:44:20,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:21,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838147594] [2019-12-18 15:44:21,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619638262] [2019-12-18 15:44:21,459 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 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-18 15:44:21,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:44:21,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:21,573 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 37 conjunts are in the unsatisfiable core [2019-12-18 15:44:21,575 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:21,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:21,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-12-18 15:44:21,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608692915] [2019-12-18 15:44:21,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-12-18 15:44:21,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:21,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-12-18 15:44:21,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1002, Unknown=0, NotChecked=0, Total=1332 [2019-12-18 15:44:21,629 INFO L87 Difference]: Start difference. First operand 52 states and 106 transitions. Second operand 37 states. [2019-12-18 15:44:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:22,943 INFO L93 Difference]: Finished difference Result 93 states and 188 transitions. [2019-12-18 15:44:22,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-18 15:44:22,944 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 40 [2019-12-18 15:44:22,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:22,945 INFO L225 Difference]: With dead ends: 93 [2019-12-18 15:44:22,945 INFO L226 Difference]: Without dead ends: 90 [2019-12-18 15:44:22,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 907 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1550, Invalid=3280, Unknown=0, NotChecked=0, Total=4830 [2019-12-18 15:44:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-12-18 15:44:22,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-12-18 15:44:22,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-18 15:44:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 182 transitions. [2019-12-18 15:44:22,948 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 182 transitions. Word has length 40 [2019-12-18 15:44:22,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:22,949 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 182 transitions. [2019-12-18 15:44:22,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-12-18 15:44:22,949 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 182 transitions. [2019-12-18 15:44:22,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 15:44:22,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:22,950 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:23,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:23,154 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:23,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:23,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1911904150, now seen corresponding path program 65 times [2019-12-18 15:44:23,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:23,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605460026] [2019-12-18 15:44:23,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:23,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605460026] [2019-12-18 15:44:23,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639063864] [2019-12-18 15:44:23,864 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 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-18 15:44:23,981 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-12-18 15:44:23,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:23,984 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-18 15:44:23,986 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:24,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:24,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-18 15:44:24,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387105538] [2019-12-18 15:44:24,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-18 15:44:24,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:24,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-18 15:44:24,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 15:44:24,040 INFO L87 Difference]: Start difference. First operand 90 states and 182 transitions. Second operand 38 states. [2019-12-18 15:44:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:25,103 INFO L93 Difference]: Finished difference Result 94 states and 190 transitions. [2019-12-18 15:44:25,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 15:44:25,103 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 41 [2019-12-18 15:44:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:25,104 INFO L225 Difference]: With dead ends: 94 [2019-12-18 15:44:25,104 INFO L226 Difference]: Without dead ends: 91 [2019-12-18 15:44:25,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 880 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1640, Invalid=3472, Unknown=0, NotChecked=0, Total=5112 [2019-12-18 15:44:25,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-12-18 15:44:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 53. [2019-12-18 15:44:25,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-12-18 15:44:25,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 108 transitions. [2019-12-18 15:44:25,108 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 108 transitions. Word has length 41 [2019-12-18 15:44:25,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:25,109 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 108 transitions. [2019-12-18 15:44:25,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-18 15:44:25,109 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 108 transitions. [2019-12-18 15:44:25,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 15:44:25,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:25,109 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:25,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:25,310 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:25,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:25,311 INFO L82 PathProgramCache]: Analyzing trace with hash -573527414, now seen corresponding path program 66 times [2019-12-18 15:44:25,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:25,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70975126] [2019-12-18 15:44:25,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:25,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70975126] [2019-12-18 15:44:25,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113086685] [2019-12-18 15:44:25,749 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 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-18 15:44:25,825 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-12-18 15:44:25,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:25,826 INFO L264 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-18 15:44:25,827 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:25,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:25,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-12-18 15:44:25,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302451409] [2019-12-18 15:44:25,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-12-18 15:44:25,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:25,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-12-18 15:44:25,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=1058, Unknown=0, NotChecked=0, Total=1406 [2019-12-18 15:44:25,852 INFO L87 Difference]: Start difference. First operand 53 states and 108 transitions. Second operand 38 states. [2019-12-18 15:44:26,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:26,872 INFO L93 Difference]: Finished difference Result 95 states and 192 transitions. [2019-12-18 15:44:26,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 15:44:26,872 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 41 [2019-12-18 15:44:26,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:26,873 INFO L225 Difference]: With dead ends: 95 [2019-12-18 15:44:26,874 INFO L226 Difference]: Without dead ends: 92 [2019-12-18 15:44:26,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1671, Invalid=3441, Unknown=0, NotChecked=0, Total=5112 [2019-12-18 15:44:26,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-12-18 15:44:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-12-18 15:44:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-12-18 15:44:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 186 transitions. [2019-12-18 15:44:26,877 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 186 transitions. Word has length 41 [2019-12-18 15:44:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:26,878 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 186 transitions. [2019-12-18 15:44:26,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-12-18 15:44:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 186 transitions. [2019-12-18 15:44:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 15:44:26,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:26,879 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:27,082 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:27,083 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:27,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:27,083 INFO L82 PathProgramCache]: Analyzing trace with hash -860513437, now seen corresponding path program 67 times [2019-12-18 15:44:27,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:27,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342673044] [2019-12-18 15:44:27,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:27,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342673044] [2019-12-18 15:44:27,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041361818] [2019-12-18 15:44:27,523 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 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-18 15:44:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:27,590 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-18 15:44:27,591 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:27,618 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:27,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:27,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-12-18 15:44:27,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516527250] [2019-12-18 15:44:27,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-18 15:44:27,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:27,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-18 15:44:27,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1115, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:44:27,619 INFO L87 Difference]: Start difference. First operand 92 states and 186 transitions. Second operand 39 states. [2019-12-18 15:44:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:28,704 INFO L93 Difference]: Finished difference Result 96 states and 194 transitions. [2019-12-18 15:44:28,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-18 15:44:28,705 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 42 [2019-12-18 15:44:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:28,706 INFO L225 Difference]: With dead ends: 96 [2019-12-18 15:44:28,706 INFO L226 Difference]: Without dead ends: 93 [2019-12-18 15:44:28,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1693, Invalid=3563, Unknown=0, NotChecked=0, Total=5256 [2019-12-18 15:44:28,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-12-18 15:44:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2019-12-18 15:44:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-12-18 15:44:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 110 transitions. [2019-12-18 15:44:28,709 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 110 transitions. Word has length 42 [2019-12-18 15:44:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:28,710 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 110 transitions. [2019-12-18 15:44:28,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-18 15:44:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 110 transitions. [2019-12-18 15:44:28,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 15:44:28,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:28,710 INFO L411 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:28,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:28,914 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:28,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:28,914 INFO L82 PathProgramCache]: Analyzing trace with hash -599480345, now seen corresponding path program 68 times [2019-12-18 15:44:28,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:28,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893692160] [2019-12-18 15:44:28,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:29,387 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:29,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893692160] [2019-12-18 15:44:29,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752219414] [2019-12-18 15:44:29,388 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 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-18 15:44:29,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:44:29,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:29,452 INFO L264 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 39 conjunts are in the unsatisfiable core [2019-12-18 15:44:29,453 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:29,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:29,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2019-12-18 15:44:29,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349011866] [2019-12-18 15:44:29,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-18 15:44:29,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:29,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-18 15:44:29,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1115, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 15:44:29,494 INFO L87 Difference]: Start difference. First operand 54 states and 110 transitions. Second operand 39 states. [2019-12-18 15:44:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:30,566 INFO L93 Difference]: Finished difference Result 97 states and 196 transitions. [2019-12-18 15:44:30,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-18 15:44:30,567 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 42 [2019-12-18 15:44:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:30,568 INFO L225 Difference]: With dead ends: 97 [2019-12-18 15:44:30,568 INFO L226 Difference]: Without dead ends: 94 [2019-12-18 15:44:30,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1731, Invalid=3671, Unknown=0, NotChecked=0, Total=5402 [2019-12-18 15:44:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-18 15:44:30,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-12-18 15:44:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-12-18 15:44:30,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 190 transitions. [2019-12-18 15:44:30,571 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 190 transitions. Word has length 42 [2019-12-18 15:44:30,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:30,571 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 190 transitions. [2019-12-18 15:44:30,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-18 15:44:30,571 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 190 transitions. [2019-12-18 15:44:30,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 15:44:30,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:30,571 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:30,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:30,772 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:30,773 INFO L82 PathProgramCache]: Analyzing trace with hash -906112466, now seen corresponding path program 69 times [2019-12-18 15:44:30,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:30,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813828828] [2019-12-18 15:44:30,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:31,267 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:31,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813828828] [2019-12-18 15:44:31,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407229834] [2019-12-18 15:44:31,267 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 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-18 15:44:31,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-12-18 15:44:31,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:31,348 INFO L264 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-18 15:44:31,349 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:31,373 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:31,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:31,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-18 15:44:31,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081886546] [2019-12-18 15:44:31,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-18 15:44:31,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:31,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-18 15:44:31,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 15:44:31,375 INFO L87 Difference]: Start difference. First operand 94 states and 190 transitions. Second operand 40 states. [2019-12-18 15:44:32,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:32,544 INFO L93 Difference]: Finished difference Result 98 states and 198 transitions. [2019-12-18 15:44:32,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 15:44:32,545 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 43 [2019-12-18 15:44:32,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:32,546 INFO L225 Difference]: With dead ends: 98 [2019-12-18 15:44:32,546 INFO L226 Difference]: Without dead ends: 95 [2019-12-18 15:44:32,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1826, Invalid=3874, Unknown=0, NotChecked=0, Total=5700 [2019-12-18 15:44:32,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-12-18 15:44:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 55. [2019-12-18 15:44:32,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-12-18 15:44:32,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 112 transitions. [2019-12-18 15:44:32,549 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 112 transitions. Word has length 43 [2019-12-18 15:44:32,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:32,549 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 112 transitions. [2019-12-18 15:44:32,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-18 15:44:32,550 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 112 transitions. [2019-12-18 15:44:32,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 15:44:32,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:32,550 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:32,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:32,754 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:32,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:32,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1404021454, now seen corresponding path program 70 times [2019-12-18 15:44:32,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:32,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772402154] [2019-12-18 15:44:32,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:33,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772402154] [2019-12-18 15:44:33,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049908582] [2019-12-18 15:44:33,228 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 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-18 15:44:33,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:44:33,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:33,290 INFO L264 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 40 conjunts are in the unsatisfiable core [2019-12-18 15:44:33,290 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:33,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:33,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-12-18 15:44:33,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470667164] [2019-12-18 15:44:33,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-12-18 15:44:33,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:33,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-12-18 15:44:33,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=1174, Unknown=0, NotChecked=0, Total=1560 [2019-12-18 15:44:33,328 INFO L87 Difference]: Start difference. First operand 55 states and 112 transitions. Second operand 40 states. [2019-12-18 15:44:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:34,443 INFO L93 Difference]: Finished difference Result 99 states and 200 transitions. [2019-12-18 15:44:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 15:44:34,444 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 43 [2019-12-18 15:44:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:34,445 INFO L225 Difference]: With dead ends: 99 [2019-12-18 15:44:34,445 INFO L226 Difference]: Without dead ends: 96 [2019-12-18 15:44:34,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1859, Invalid=3841, Unknown=0, NotChecked=0, Total=5700 [2019-12-18 15:44:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-12-18 15:44:34,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-12-18 15:44:34,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-12-18 15:44:34,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 194 transitions. [2019-12-18 15:44:34,449 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 194 transitions. Word has length 43 [2019-12-18 15:44:34,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:34,450 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 194 transitions. [2019-12-18 15:44:34,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-12-18 15:44:34,450 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 194 transitions. [2019-12-18 15:44:34,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 15:44:34,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:34,451 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:34,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:34,654 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:34,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1975284683, now seen corresponding path program 71 times [2019-12-18 15:44:34,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:34,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074301923] [2019-12-18 15:44:34,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:35,150 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:35,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074301923] [2019-12-18 15:44:35,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437279974] [2019-12-18 15:44:35,150 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 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-18 15:44:35,224 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-12-18 15:44:35,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:35,225 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-18 15:44:35,226 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:35,256 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:35,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:35,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-12-18 15:44:35,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72926582] [2019-12-18 15:44:35,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-18 15:44:35,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:35,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-18 15:44:35,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:44:35,257 INFO L87 Difference]: Start difference. First operand 96 states and 194 transitions. Second operand 41 states. [2019-12-18 15:44:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:36,453 INFO L93 Difference]: Finished difference Result 100 states and 202 transitions. [2019-12-18 15:44:36,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-18 15:44:36,454 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 44 [2019-12-18 15:44:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:36,455 INFO L225 Difference]: With dead ends: 100 [2019-12-18 15:44:36,455 INFO L226 Difference]: Without dead ends: 97 [2019-12-18 15:44:36,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1882, Invalid=3970, Unknown=0, NotChecked=0, Total=5852 [2019-12-18 15:44:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-18 15:44:36,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2019-12-18 15:44:36,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-12-18 15:44:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 114 transitions. [2019-12-18 15:44:36,458 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 114 transitions. Word has length 44 [2019-12-18 15:44:36,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:36,458 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 114 transitions. [2019-12-18 15:44:36,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-18 15:44:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 114 transitions. [2019-12-18 15:44:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-18 15:44:36,459 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:36,459 INFO L411 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:36,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 70 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:36,660 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:36,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:36,660 INFO L82 PathProgramCache]: Analyzing trace with hash -574991809, now seen corresponding path program 72 times [2019-12-18 15:44:36,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:36,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957220254] [2019-12-18 15:44:36,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:36,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:37,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957220254] [2019-12-18 15:44:37,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117918798] [2019-12-18 15:44:37,152 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 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-18 15:44:37,239 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-12-18 15:44:37,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:37,241 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 41 conjunts are in the unsatisfiable core [2019-12-18 15:44:37,246 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:37,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:37,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-12-18 15:44:37,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923276847] [2019-12-18 15:44:37,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-12-18 15:44:37,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:37,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-12-18 15:44:37,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=1234, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 15:44:37,300 INFO L87 Difference]: Start difference. First operand 56 states and 114 transitions. Second operand 41 states. [2019-12-18 15:44:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:38,931 INFO L93 Difference]: Finished difference Result 101 states and 204 transitions. [2019-12-18 15:44:38,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 15:44:38,931 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 44 [2019-12-18 15:44:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:38,932 INFO L225 Difference]: With dead ends: 101 [2019-12-18 15:44:38,932 INFO L226 Difference]: Without dead ends: 98 [2019-12-18 15:44:38,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1922, Invalid=4084, Unknown=0, NotChecked=0, Total=6006 [2019-12-18 15:44:38,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-12-18 15:44:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-12-18 15:44:38,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-12-18 15:44:38,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 198 transitions. [2019-12-18 15:44:38,936 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 198 transitions. Word has length 44 [2019-12-18 15:44:38,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:38,937 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 198 transitions. [2019-12-18 15:44:38,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-12-18 15:44:38,937 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 198 transitions. [2019-12-18 15:44:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 15:44:38,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:38,937 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:39,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:39,138 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:39,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:39,139 INFO L82 PathProgramCache]: Analyzing trace with hash 1104283334, now seen corresponding path program 73 times [2019-12-18 15:44:39,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:39,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044816330] [2019-12-18 15:44:39,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:39,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044816330] [2019-12-18 15:44:39,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446344974] [2019-12-18 15:44:39,647 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 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-18 15:44:39,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:39,714 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-18 15:44:39,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:39,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:39,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-12-18 15:44:39,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201084100] [2019-12-18 15:44:39,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-18 15:44:39,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:39,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-18 15:44:39,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1296, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 15:44:39,764 INFO L87 Difference]: Start difference. First operand 98 states and 198 transitions. Second operand 42 states. [2019-12-18 15:44:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:41,031 INFO L93 Difference]: Finished difference Result 102 states and 206 transitions. [2019-12-18 15:44:41,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 15:44:41,032 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 45 [2019-12-18 15:44:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:41,033 INFO L225 Difference]: With dead ends: 102 [2019-12-18 15:44:41,033 INFO L226 Difference]: Without dead ends: 99 [2019-12-18 15:44:41,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2022, Invalid=4298, Unknown=0, NotChecked=0, Total=6320 [2019-12-18 15:44:41,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-12-18 15:44:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 57. [2019-12-18 15:44:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-12-18 15:44:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 116 transitions. [2019-12-18 15:44:41,036 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 116 transitions. Word has length 45 [2019-12-18 15:44:41,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:41,037 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 116 transitions. [2019-12-18 15:44:41,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-18 15:44:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 116 transitions. [2019-12-18 15:44:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 15:44:41,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:41,037 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:41,239 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:41,239 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:41,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:41,240 INFO L82 PathProgramCache]: Analyzing trace with hash -644876838, now seen corresponding path program 74 times [2019-12-18 15:44:41,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:41,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062689939] [2019-12-18 15:44:41,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:41,776 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:41,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062689939] [2019-12-18 15:44:41,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896190018] [2019-12-18 15:44:41,776 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 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-18 15:44:41,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 15:44:41,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:41,843 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-18 15:44:41,843 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:41,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:41,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-12-18 15:44:41,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977522578] [2019-12-18 15:44:41,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-12-18 15:44:41,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:41,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-12-18 15:44:41,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=426, Invalid=1296, Unknown=0, NotChecked=0, Total=1722 [2019-12-18 15:44:41,871 INFO L87 Difference]: Start difference. First operand 57 states and 116 transitions. Second operand 42 states. [2019-12-18 15:44:43,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:43,129 INFO L93 Difference]: Finished difference Result 103 states and 208 transitions. [2019-12-18 15:44:43,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 15:44:43,130 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 45 [2019-12-18 15:44:43,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:43,131 INFO L225 Difference]: With dead ends: 103 [2019-12-18 15:44:43,131 INFO L226 Difference]: Without dead ends: 100 [2019-12-18 15:44:43,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2057, Invalid=4263, Unknown=0, NotChecked=0, Total=6320 [2019-12-18 15:44:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-18 15:44:43,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-12-18 15:44:43,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-12-18 15:44:43,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 202 transitions. [2019-12-18 15:44:43,134 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 202 transitions. Word has length 45 [2019-12-18 15:44:43,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:43,134 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 202 transitions. [2019-12-18 15:44:43,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-12-18 15:44:43,134 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 202 transitions. [2019-12-18 15:44:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-18 15:44:43,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:43,135 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:43,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:43,338 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:43,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:43,339 INFO L82 PathProgramCache]: Analyzing trace with hash -126954957, now seen corresponding path program 75 times [2019-12-18 15:44:43,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:43,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28773338] [2019-12-18 15:44:43,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:43,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28773338] [2019-12-18 15:44:43,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552490002] [2019-12-18 15:44:43,880 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 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-18 15:44:43,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-12-18 15:44:43,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:43,968 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-18 15:44:43,969 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:44,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:44,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-18 15:44:44,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205388323] [2019-12-18 15:44:44,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-18 15:44:44,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:44,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-18 15:44:44,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1359, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 15:44:44,015 INFO L87 Difference]: Start difference. First operand 100 states and 202 transitions. Second operand 43 states. [2019-12-18 15:44:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:45,222 INFO L93 Difference]: Finished difference Result 104 states and 210 transitions. [2019-12-18 15:44:45,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 15:44:45,223 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 46 [2019-12-18 15:44:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:45,224 INFO L225 Difference]: With dead ends: 104 [2019-12-18 15:44:45,224 INFO L226 Difference]: Without dead ends: 101 [2019-12-18 15:44:45,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1175 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1953, Invalid=4689, Unknown=0, NotChecked=0, Total=6642 [2019-12-18 15:44:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-18 15:44:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 58. [2019-12-18 15:44:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-12-18 15:44:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 118 transitions. [2019-12-18 15:44:45,230 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 118 transitions. Word has length 46 [2019-12-18 15:44:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:45,230 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 118 transitions. [2019-12-18 15:44:45,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-18 15:44:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 118 transitions. [2019-12-18 15:44:45,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-18 15:44:45,231 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:45,231 INFO L411 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:45,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 74 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:45,435 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:45,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:45,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1483654807, now seen corresponding path program 76 times [2019-12-18 15:44:45,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:45,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026761118] [2019-12-18 15:44:45,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:44:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:45,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026761118] [2019-12-18 15:44:45,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056693094] [2019-12-18 15:44:45,990 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 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-18 15:44:46,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 15:44:46,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 15:44:46,057 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 43 conjunts are in the unsatisfiable core [2019-12-18 15:44:46,058 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 15:44:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 15:44:46,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 15:44:46,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-12-18 15:44:46,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885713255] [2019-12-18 15:44:46,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-12-18 15:44:46,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:44:46,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-12-18 15:44:46,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1359, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 15:44:46,098 INFO L87 Difference]: Start difference. First operand 58 states and 118 transitions. Second operand 43 states. [2019-12-18 15:44:47,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:44:47,384 INFO L93 Difference]: Finished difference Result 105 states and 212 transitions. [2019-12-18 15:44:47,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 15:44:47,385 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 46 [2019-12-18 15:44:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:44:47,386 INFO L225 Difference]: With dead ends: 105 [2019-12-18 15:44:47,386 INFO L226 Difference]: Without dead ends: 102 [2019-12-18 15:44:47,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1252 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2123, Invalid=4519, Unknown=0, NotChecked=0, Total=6642 [2019-12-18 15:44:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-12-18 15:44:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-12-18 15:44:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-18 15:44:47,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 206 transitions. [2019-12-18 15:44:47,389 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 206 transitions. Word has length 46 [2019-12-18 15:44:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:44:47,389 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 206 transitions. [2019-12-18 15:44:47,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-12-18 15:44:47,390 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 206 transitions. [2019-12-18 15:44:47,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 15:44:47,390 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:44:47,390 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:44:47,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 75 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 15:44:47,591 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:44:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:44:47,591 INFO L82 PathProgramCache]: Analyzing trace with hash 359363934, now seen corresponding path program 77 times [2019-12-18 15:44:47,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:44:47,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576878343] [2019-12-18 15:44:47,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:44:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:44:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:44:47,683 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:44:47,684 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:44:47,687 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [187] [187] ULTIMATE.startENTRY-->L694: Formula: (let ((.cse0 (store |v_#valid_39| 0 0))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20| 1))) (and (= 0 |v_#NULL.base_4|) (= v_ULTIMATE.start_main_~argv.base_8 |v_ULTIMATE.start_main_#in~argv.base_9|) (= 0 |v_ULTIMATE.start_main_~#id1~0.offset_16|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| |v_ULTIMATE.start_#in~argv.offset_5|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#id1~0.base_20|) |v_ULTIMATE.start_main_~#id1~0.offset_16| 0)) |v_#memory_int_11|) (= |v_ULTIMATE.start_#in~argv.base_5| |v_ULTIMATE.start_main_#in~argv.base_9|) (= |v_ULTIMATE.start_main_#in~argv.offset_9| v_ULTIMATE.start_main_~argv.offset_8) (= v_~i~0_33 3) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_16|) (< 0 |v_#StackHeapBarrier_11|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#id1~0.base_20|)) (= (store (store |v_#length_15| |v_ULTIMATE.start_main_~#id1~0.base_20| 4) |v_ULTIMATE.start_main_~#id2~0.base_20| 4) |v_#length_14|) (= |v_#NULL.offset_4| 0) (= v_~j~0_37 6) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id1~0.base_20|) (= v_ULTIMATE.start_main_~argc_7 |v_ULTIMATE.start_main_#in~argc_9|) (= (select .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20|) 0) (= (store .cse1 |v_ULTIMATE.start_main_~#id2~0.base_20| 1) |v_#valid_37|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#id2~0.base_20|) (= |v_ULTIMATE.start_#in~argc_5| |v_ULTIMATE.start_main_#in~argc_9|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_12|, #length=|v_#length_15|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|} OutVars{ULTIMATE.start_main_~argv.offset=v_ULTIMATE.start_main_~argv.offset_8, ~j~0=v_~j~0_37, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_18|, ULTIMATE.start_main_~#id1~0.base=|v_ULTIMATE.start_main_~#id1~0.base_20|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_#in~argv.offset=|v_ULTIMATE.start_#in~argv.offset_5|, ULTIMATE.start_main_~argv.base=v_ULTIMATE.start_main_~argv.base_8, ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_20|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_16|, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_22, ULTIMATE.start_main_~argc=v_ULTIMATE.start_main_~argc_7, #length=|v_#length_14|, ULTIMATE.start_#in~argc=|v_ULTIMATE.start_#in~argc_5|, ULTIMATE.start_#in~argv.base=|v_ULTIMATE.start_#in~argv.base_5|, ULTIMATE.start_main_#in~argv.base=|v_ULTIMATE.start_main_#in~argv.base_9|, ULTIMATE.start_main_#in~argv.offset=|v_ULTIMATE.start_main_#in~argv.offset_9|, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_22, ~i~0=v_~i~0_33, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, #valid=|v_#valid_37|, ULTIMATE.start_main_#in~argc=|v_ULTIMATE.start_main_#in~argc_9|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#id1~0.offset=|v_ULTIMATE.start_main_~#id1~0.offset_16|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv.base, ULTIMATE.start_main_~argv.offset, ~j~0, ULTIMATE.start_main_#in~argv.offset, ULTIMATE.start_main_#t~nondet4, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5, ~i~0, ULTIMATE.start_main_~#id1~0.base, #NULL.offset, #NULL.base, ULTIMATE.start_main_~argv.base, ULTIMATE.start_main_~#id2~0.base, ULTIMATE.start_main_~#id2~0.offset, ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#in~argc, #memory_int, ULTIMATE.start_main_~argc, #length, ULTIMATE.start_main_~#id1~0.offset] because there is no mapped edge [2019-12-18 15:44:47,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [153] [153] L694-1-->L695-1: Formula: (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0.base_6|) |v_ULTIMATE.start_main_~#id2~0.offset_6| 1))) InVars {ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, #memory_int=|v_#memory_int_6|} OutVars{ULTIMATE.start_main_~#id2~0.base=|v_ULTIMATE.start_main_~#id2~0.base_6|, ULTIMATE.start_main_~#id2~0.offset=|v_ULTIMATE.start_main_~#id2~0.offset_6|, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_3|, #memory_int=|v_#memory_int_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4, #memory_int] because there is no mapped edge [2019-12-18 15:44:47,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [155] [155] t1ENTRY-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~arg.offset_4 |v_t1Thread1of1ForFork1_#in~arg.offset_4|) (= v_t1Thread1of1ForFork1_~k~0_12 0) (= v_t1Thread1of1ForFork1_~arg.base_4 |v_t1Thread1of1ForFork1_#in~arg.base_4|)) InVars {t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{t1Thread1of1ForFork1_~arg.base=v_t1Thread1of1ForFork1_~arg.base_4, t1Thread1of1ForFork1_~arg.offset=v_t1Thread1of1ForFork1_~arg.offset_4, t1Thread1of1ForFork1_#in~arg.base=|v_t1Thread1of1ForFork1_#in~arg.base_4|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_12, t1Thread1of1ForFork1_#in~arg.offset=|v_t1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_~arg.base, t1Thread1of1ForFork1_~arg.offset, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,688 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [159] [159] t2ENTRY-->L685-6: Formula: (and (= v_t2Thread1of1ForFork0_~arg.offset_4 |v_t2Thread1of1ForFork0_#in~arg.offset_4|) (= 0 v_t2Thread1of1ForFork0_~k~1_12) (= |v_t2Thread1of1ForFork0_#in~arg.base_4| v_t2Thread1of1ForFork0_~arg.base_4)) InVars {t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} OutVars{t2Thread1of1ForFork0_~arg.offset=v_t2Thread1of1ForFork0_~arg.offset_4, t2Thread1of1ForFork0_#in~arg.offset=|v_t2Thread1of1ForFork0_#in~arg.offset_4|, t2Thread1of1ForFork0_~arg.base=v_t2Thread1of1ForFork0_~arg.base_4, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_12, t2Thread1of1ForFork0_#in~arg.base=|v_t2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_~arg.offset, t2Thread1of1ForFork0_~arg.base, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,689 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,690 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,691 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,692 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,693 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,694 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,695 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,696 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_19 (+ v_t1Thread1of1ForFork1_~k~0_20 1)) (< v_t1Thread1of1ForFork1_~k~0_20 20) (= (+ v_~j~0_25 1) v_~i~0_23)) InVars {~j~0=v_~j~0_25, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_20} OutVars{~j~0=v_~j~0_25, ~i~0=v_~i~0_23, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_13|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_19} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 15:44:47,701 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (= v_~j~0_35 (+ v_~i~0_31 1)) (= (+ v_t2Thread1of1ForFork0_~k~1_34 1) v_t2Thread1of1ForFork0_~k~1_33) (< v_t2Thread1of1ForFork0_~k~1_34 20)) InVars {~i~0=v_~i~0_31, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_34} OutVars{~j~0=v_~j~0_35, ~i~0=v_~i~0_31, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_12|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_33} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 15:44:47,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [181] [181] L695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (= v_ULTIMATE.start_main_~condJ~0_15 0)) (.cse0 (= v_ULTIMATE.start_main_~condI~0_15 0))) (and (or (not .cse0) (not .cse1)) (let ((.cse2 (<= 46 v_~j~0_27))) (or (and .cse2 (= v_ULTIMATE.start_main_~condJ~0_15 1)) (and (not .cse2) .cse1))) (let ((.cse3 (<= 46 v_~i~0_25))) (or (and .cse0 (not .cse3)) (and .cse3 (= v_ULTIMATE.start_main_~condI~0_15 1)))))) InVars {~j~0=v_~j~0_27, ~i~0=v_~i~0_25} OutVars{~j~0=v_~j~0_27, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_15, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_15, ~i~0=v_~i~0_25, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0, ULTIMATE.start_main_~condI~0, ULTIMATE.start_main_#t~nondet5] because there is no mapped edge [2019-12-18 15:44:47,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:44:47 BasicIcfg [2019-12-18 15:44:47,717 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:44:47,718 INFO L168 Benchmark]: Toolchain (without parser) took 91948.70 ms. Allocated memory was 145.2 MB in the beginning and 502.3 MB in the end (delta: 357.0 MB). Free memory was 100.4 MB in the beginning and 467.7 MB in the end (delta: -367.3 MB). Peak memory consumption was 375.8 MB. Max. memory is 7.1 GB. [2019-12-18 15:44:47,719 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 145.2 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 15:44:47,719 INFO L168 Benchmark]: CACSL2BoogieTranslator took 674.33 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 163.7 MB in the end (delta: -63.6 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-18 15:44:47,720 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.07 ms. Allocated memory is still 203.4 MB. Free memory was 163.7 MB in the beginning and 161.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:44:47,720 INFO L168 Benchmark]: Boogie Preprocessor took 26.30 ms. Allocated memory is still 203.4 MB. Free memory was 161.7 MB in the beginning and 159.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 15:44:47,720 INFO L168 Benchmark]: RCFGBuilder took 404.31 ms. Allocated memory is still 203.4 MB. Free memory was 159.8 MB in the beginning and 140.1 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:44:47,721 INFO L168 Benchmark]: TraceAbstraction took 90793.55 ms. Allocated memory was 203.4 MB in the beginning and 502.3 MB in the end (delta: 298.8 MB). Free memory was 140.1 MB in the beginning and 467.7 MB in the end (delta: -327.6 MB). Peak memory consumption was 357.3 MB. Max. memory is 7.1 GB. [2019-12-18 15:44:47,722 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.24 ms. Allocated memory is still 145.2 MB. Free memory is still 119.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 674.33 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 163.7 MB in the end (delta: -63.6 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 45.07 ms. Allocated memory is still 203.4 MB. Free memory was 163.7 MB in the beginning and 161.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.30 ms. Allocated memory is still 203.4 MB. Free memory was 161.7 MB in the beginning and 159.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 404.31 ms. Allocated memory is still 203.4 MB. Free memory was 159.8 MB in the beginning and 140.1 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 90793.55 ms. Allocated memory was 203.4 MB in the beginning and 502.3 MB in the end (delta: 298.8 MB). Free memory was 140.1 MB in the beginning and 467.7 MB in the end (delta: -327.6 MB). Peak memory consumption was 357.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 1.3s, 53 ProgramPointsBefore, 16 ProgramPointsAfterwards, 51 TransitionsBefore, 14 TransitionsAfterwards, 740 CoEnabledTransitionPairs, 6 FixpointIterations, 12 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 3 ChoiceCompositions, 380 VarBasedMoverChecksPositive, 7 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 9 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 604 CheckedPairsTotal, 41 TotalNumberOfCompositions - CounterExampleResult [Line: 703]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arg={0:0}, i=3, j=6] [L695] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arg={0:0}, arg={0:0}, i=3, j=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 90.6s, OverallIterations: 79, TraceHistogramMax: 20, AutomataDifference: 45.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 899 SDtfs, 2769 SDslu, 3466 SDs, 0 SdLazy, 5216 SolverSat, 6109 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5176 GetRequests, 1924 SyntacticMatches, 0 SemanticMatches, 3252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32614 ImplicationChecksByTransitivity, 55.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 78 MinimizatonAttempts, 931 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 21.9s InterpolantComputationTime, 4221 NumberOfCodeBlocks, 4221 NumberOfCodeBlocksAsserted, 533 NumberOfCheckSat, 4022 ConstructedInterpolants, 0 QuantifiedInterpolants, 394964 SizeOfPredicates, 1480 NumberOfNonLiveVariables, 12506 ConjunctsInSsa, 1858 ConjunctsInUnsatCore, 152 InterpolantComputations, 4 PerfectInterpolantSequences, 0/19000 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...