/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread/triangular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 19:39:01,770 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 19:39:01,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 19:39:01,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 19:39:01,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 19:39:01,791 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 19:39:01,792 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 19:39:01,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 19:39:01,796 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 19:39:01,796 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 19:39:01,797 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 19:39:01,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 19:39:01,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 19:39:01,800 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 19:39:01,801 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 19:39:01,802 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 19:39:01,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 19:39:01,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 19:39:01,805 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 19:39:01,807 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 19:39:01,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 19:39:01,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 19:39:01,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 19:39:01,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 19:39:01,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 19:39:01,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 19:39:01,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 19:39:01,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 19:39:01,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 19:39:01,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 19:39:01,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 19:39:01,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 19:39:01,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 19:39:01,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 19:39:01,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 19:39:01,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 19:39:01,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 19:39:01,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 19:39:01,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 19:39:01,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 19:39:01,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 19:39:01,825 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-VariableLbe.epf [2019-12-18 19:39:01,839 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 19:39:01,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 19:39:01,840 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 19:39:01,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 19:39:01,841 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 19:39:01,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 19:39:01,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 19:39:01,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 19:39:01,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 19:39:01,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 19:39:01,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 19:39:01,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 19:39:01,842 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 19:39:01,843 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 19:39:01,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 19:39:01,843 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 19:39:01,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 19:39:01,843 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 19:39:01,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 19:39:01,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 19:39:01,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 19:39:01,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 19:39:01,844 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 19:39:01,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 19:39:01,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 19:39:01,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 19:39:01,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 19:39:01,845 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 19:39:01,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 19:39:01,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 19:39:02,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 19:39:02,142 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 19:39:02,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 19:39:02,147 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 19:39:02,147 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 19:39:02,148 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-2.i [2019-12-18 19:39:02,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42bf6ae2c/a05eb38fd63a4368a257058896d5735e/FLAG796d3ae87 [2019-12-18 19:39:02,797 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 19:39:02,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-2.i [2019-12-18 19:39:02,817 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42bf6ae2c/a05eb38fd63a4368a257058896d5735e/FLAG796d3ae87 [2019-12-18 19:39:03,146 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42bf6ae2c/a05eb38fd63a4368a257058896d5735e [2019-12-18 19:39:03,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 19:39:03,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 19:39:03,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 19:39:03,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 19:39:03,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 19:39:03,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:39:03" (1/1) ... [2019-12-18 19:39:03,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a8f91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03, skipping insertion in model container [2019-12-18 19:39:03,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 07:39:03" (1/1) ... [2019-12-18 19:39:03,176 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 19:39:03,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 19:39:03,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:39:03,772 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 19:39:03,842 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 19:39:03,909 INFO L208 MainTranslator]: Completed translation [2019-12-18 19:39:03,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03 WrapperNode [2019-12-18 19:39:03,910 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 19:39:03,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 19:39:03,911 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 19:39:03,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 19:39:03,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03" (1/1) ... [2019-12-18 19:39:03,934 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03" (1/1) ... [2019-12-18 19:39:03,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 19:39:03,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 19:39:03,953 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 19:39:03,953 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 19:39:03,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03" (1/1) ... [2019-12-18 19:39:03,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03" (1/1) ... [2019-12-18 19:39:03,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03" (1/1) ... [2019-12-18 19:39:03,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03" (1/1) ... [2019-12-18 19:39:03,969 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03" (1/1) ... [2019-12-18 19:39:03,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03" (1/1) ... [2019-12-18 19:39:03,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03" (1/1) ... [2019-12-18 19:39:03,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 19:39:03,985 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 19:39:03,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 19:39:03,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 19:39:03,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03" (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 19:39:04,039 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-12-18 19:39:04,039 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-12-18 19:39:04,039 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-12-18 19:39:04,040 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-12-18 19:39:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 19:39:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 19:39:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 19:39:04,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 19:39:04,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 19:39:04,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 19:39:04,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 19:39:04,042 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 19:39:04,352 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 19:39:04,352 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-12-18 19:39:04,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:39:04 BoogieIcfgContainer [2019-12-18 19:39:04,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 19:39:04,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 19:39:04,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 19:39:04,360 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 19:39:04,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 07:39:03" (1/3) ... [2019-12-18 19:39:04,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282af6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:39:04, skipping insertion in model container [2019-12-18 19:39:04,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 07:39:03" (2/3) ... [2019-12-18 19:39:04,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@282af6e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 07:39:04, skipping insertion in model container [2019-12-18 19:39:04,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 07:39:04" (3/3) ... [2019-12-18 19:39:04,364 INFO L109 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2019-12-18 19:39:04,376 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 19:39:04,376 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 19:39:04,383 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-18 19:39:04,385 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 19:39:04,418 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,419 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,419 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,420 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,421 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,422 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,422 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,439 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,439 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,440 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,440 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,440 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,441 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,441 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,442 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,442 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,442 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,442 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,443 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,443 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,443 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,446 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,446 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,447 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,447 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,448 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,448 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,448 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,457 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,457 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,458 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,458 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,458 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,460 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of1ForFork0_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,465 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,466 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,466 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,466 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,467 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,467 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of1ForFork1_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 19:39:04,494 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-12-18 19:39:04,514 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 19:39:04,514 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 19:39:04,514 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 19:39:04,515 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 19:39:04,515 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 19:39:04,515 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 19:39:04,515 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 19:39:04,515 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 19:39:04,528 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 51 transitions [2019-12-18 19:39:04,530 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-18 19:39:04,568 INFO L126 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-18 19:39:04,568 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:39:04,576 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 19:39:04,582 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 53 places, 51 transitions [2019-12-18 19:39:04,600 INFO L126 PetriNetUnfolder]: 5/49 cut-off events. [2019-12-18 19:39:04,600 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 19:39:04,602 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 19:39:04,606 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 740 [2019-12-18 19:39:04,607 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 19:39:05,741 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-12-18 19:39:05,859 INFO L206 etLargeBlockEncoding]: Checked pairs total: 604 [2019-12-18 19:39:05,859 INFO L214 etLargeBlockEncoding]: Total number of compositions: 41 [2019-12-18 19:39:05,863 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 16 places, 14 transitions [2019-12-18 19:39:05,877 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 35 states. [2019-12-18 19:39:05,879 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-18 19:39:05,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 19:39:05,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:05,885 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 19:39:05,886 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:05,892 INFO L82 PathProgramCache]: Analyzing trace with hash 205828742, now seen corresponding path program 1 times [2019-12-18 19:39:05,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:05,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455089380] [2019-12-18 19:39:05,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:06,125 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 19:39:06,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455089380] [2019-12-18 19:39:06,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:39:06,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 19:39:06,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358924523] [2019-12-18 19:39:06,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 19:39:06,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:06,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 19:39:06,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 19:39:06,156 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-18 19:39:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:06,204 INFO L93 Difference]: Finished difference Result 48 states and 115 transitions. [2019-12-18 19:39:06,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:39:06,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 19:39:06,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:06,227 INFO L225 Difference]: With dead ends: 48 [2019-12-18 19:39:06,227 INFO L226 Difference]: Without dead ends: 28 [2019-12-18 19:39:06,229 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 19:39:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-18 19:39:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-18 19:39:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-18 19:39:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 60 transitions. [2019-12-18 19:39:06,263 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 60 transitions. Word has length 5 [2019-12-18 19:39:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:06,263 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 60 transitions. [2019-12-18 19:39:06,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 19:39:06,264 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 60 transitions. [2019-12-18 19:39:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 19:39:06,264 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:06,264 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:06,265 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:06,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:06,265 INFO L82 PathProgramCache]: Analyzing trace with hash 232906128, now seen corresponding path program 1 times [2019-12-18 19:39:06,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:06,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363341056] [2019-12-18 19:39:06,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:06,378 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 19:39:06,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363341056] [2019-12-18 19:39:06,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:39:06,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 19:39:06,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248034253] [2019-12-18 19:39:06,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 19:39:06,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:06,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 19:39:06,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 19:39:06,396 INFO L87 Difference]: Start difference. First operand 28 states and 60 transitions. Second operand 4 states. [2019-12-18 19:39:06,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:06,414 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-18 19:39:06,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 19:39:06,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-18 19:39:06,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:06,417 INFO L225 Difference]: With dead ends: 34 [2019-12-18 19:39:06,417 INFO L226 Difference]: Without dead ends: 30 [2019-12-18 19:39:06,418 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 19:39:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-18 19:39:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-18 19:39:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-18 19:39:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-18 19:39:06,425 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 7 [2019-12-18 19:39:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:06,425 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-18 19:39:06,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 19:39:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-18 19:39:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:39:06,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:06,426 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:06,427 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:06,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash 484474390, now seen corresponding path program 1 times [2019-12-18 19:39:06,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:06,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415234599] [2019-12-18 19:39:06,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:06,499 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 19:39:06,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415234599] [2019-12-18 19:39:06,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:39:06,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:39:06,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323662447] [2019-12-18 19:39:06,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:39:06,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:06,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:39:06,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:39:06,501 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 5 states. [2019-12-18 19:39:06,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:06,542 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-18 19:39:06,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 19:39:06,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:39:06,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:06,543 INFO L225 Difference]: With dead ends: 34 [2019-12-18 19:39:06,543 INFO L226 Difference]: Without dead ends: 28 [2019-12-18 19:39:06,544 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 19:39:06,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-18 19:39:06,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-12-18 19:39:06,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-18 19:39:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-18 19:39:06,549 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 9 [2019-12-18 19:39:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:06,550 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-18 19:39:06,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:39:06,550 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-18 19:39:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 19:39:06,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:06,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:06,551 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:06,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:06,551 INFO L82 PathProgramCache]: Analyzing trace with hash 483962890, now seen corresponding path program 2 times [2019-12-18 19:39:06,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:06,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008995741] [2019-12-18 19:39:06,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:06,627 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 19:39:06,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008995741] [2019-12-18 19:39:06,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 19:39:06,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 19:39:06,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345946503] [2019-12-18 19:39:06,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 19:39:06,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:06,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 19:39:06,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 19:39:06,630 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 5 states. [2019-12-18 19:39:06,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:06,682 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-18 19:39:06,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:39:06,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-18 19:39:06,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:06,685 INFO L225 Difference]: With dead ends: 32 [2019-12-18 19:39:06,685 INFO L226 Difference]: Without dead ends: 28 [2019-12-18 19:39:06,685 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 19:39:06,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-12-18 19:39:06,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-12-18 19:39:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-18 19:39:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-18 19:39:06,690 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 9 [2019-12-18 19:39:06,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:06,691 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-18 19:39:06,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 19:39:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-18 19:39:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 19:39:06,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:06,692 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:06,692 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:06,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:06,693 INFO L82 PathProgramCache]: Analyzing trace with hash 2133804259, now seen corresponding path program 3 times [2019-12-18 19:39:06,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:06,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088909591] [2019-12-18 19:39:06,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:06,781 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 19:39:06,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088909591] [2019-12-18 19:39:06,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290113941] [2019-12-18 19:39:06,782 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 19:39:06,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-18 19:39:06,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:06,852 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 19:39:06,857 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:06,884 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 19:39:06,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:06,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-18 19:39:06,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766524588] [2019-12-18 19:39:06,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:39:06,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:06,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:39:06,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:39:06,887 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 7 states. [2019-12-18 19:39:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:06,949 INFO L93 Difference]: Finished difference Result 32 states and 66 transitions. [2019-12-18 19:39:06,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 19:39:06,950 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-18 19:39:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:06,952 INFO L225 Difference]: With dead ends: 32 [2019-12-18 19:39:06,952 INFO L226 Difference]: Without dead ends: 29 [2019-12-18 19:39:06,952 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 19:39:06,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-18 19:39:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 22. [2019-12-18 19:39:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-18 19:39:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2019-12-18 19:39:06,958 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 46 transitions. Word has length 10 [2019-12-18 19:39:06,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:06,960 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 46 transitions. [2019-12-18 19:39:06,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:39:06,960 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 46 transitions. [2019-12-18 19:39:06,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-18 19:39:06,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:06,961 INFO L411 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:07,165 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:07,167 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:07,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:07,168 INFO L82 PathProgramCache]: Analyzing trace with hash 2117948007, now seen corresponding path program 4 times [2019-12-18 19:39:07,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:07,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631654706] [2019-12-18 19:39:07,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:07,219 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 19:39:07,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631654706] [2019-12-18 19:39:07,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391363202] [2019-12-18 19:39:07,220 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 19:39:07,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:39:07,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:07,278 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-18 19:39:07,280 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:07,302 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 19:39:07,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:07,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-12-18 19:39:07,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544023605] [2019-12-18 19:39:07,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 19:39:07,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:07,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 19:39:07,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 19:39:07,306 INFO L87 Difference]: Start difference. First operand 22 states and 46 transitions. Second operand 7 states. [2019-12-18 19:39:07,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:07,380 INFO L93 Difference]: Finished difference Result 33 states and 68 transitions. [2019-12-18 19:39:07,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 19:39:07,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-18 19:39:07,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:07,383 INFO L225 Difference]: With dead ends: 33 [2019-12-18 19:39:07,383 INFO L226 Difference]: Without dead ends: 30 [2019-12-18 19:39:07,384 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 19:39:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-18 19:39:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-18 19:39:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-18 19:39:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2019-12-18 19:39:07,388 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 62 transitions. Word has length 10 [2019-12-18 19:39:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:07,388 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 62 transitions. [2019-12-18 19:39:07,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 19:39:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 62 transitions. [2019-12-18 19:39:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:39:07,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:07,389 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:07,595 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:07,596 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:07,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1723422894, now seen corresponding path program 5 times [2019-12-18 19:39:07,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:07,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956205150] [2019-12-18 19:39:07,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:07,657 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 19:39:07,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956205150] [2019-12-18 19:39:07,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374090815] [2019-12-18 19:39:07,658 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 19:39:07,710 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:39:07,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:07,711 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:39:07,713 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:07,728 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 19:39:07,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:07,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-18 19:39:07,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360611419] [2019-12-18 19:39:07,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:39:07,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:07,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:39:07,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:39:07,730 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand 8 states. [2019-12-18 19:39:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:07,817 INFO L93 Difference]: Finished difference Result 34 states and 70 transitions. [2019-12-18 19:39:07,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:39:07,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-18 19:39:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:07,818 INFO L225 Difference]: With dead ends: 34 [2019-12-18 19:39:07,818 INFO L226 Difference]: Without dead ends: 31 [2019-12-18 19:39:07,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:39:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-18 19:39:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2019-12-18 19:39:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-18 19:39:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 48 transitions. [2019-12-18 19:39:07,823 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 48 transitions. Word has length 11 [2019-12-18 19:39:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:07,823 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 48 transitions. [2019-12-18 19:39:07,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:39:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 48 transitions. [2019-12-18 19:39:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 19:39:07,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:07,824 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:08,031 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:08,031 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:08,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:08,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1231878834, now seen corresponding path program 6 times [2019-12-18 19:39:08,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:08,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368596054] [2019-12-18 19:39:08,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:08,091 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 19:39:08,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368596054] [2019-12-18 19:39:08,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253149794] [2019-12-18 19:39:08,092 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 19:39:08,140 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2019-12-18 19:39:08,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:08,142 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-18 19:39:08,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:08,165 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 19:39:08,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:08,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-12-18 19:39:08,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658163543] [2019-12-18 19:39:08,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 19:39:08,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:08,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 19:39:08,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-18 19:39:08,167 INFO L87 Difference]: Start difference. First operand 23 states and 48 transitions. Second operand 8 states. [2019-12-18 19:39:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:08,249 INFO L93 Difference]: Finished difference Result 35 states and 72 transitions. [2019-12-18 19:39:08,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:39:08,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-18 19:39:08,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:08,250 INFO L225 Difference]: With dead ends: 35 [2019-12-18 19:39:08,251 INFO L226 Difference]: Without dead ends: 32 [2019-12-18 19:39:08,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:39:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-18 19:39:08,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-12-18 19:39:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-18 19:39:08,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2019-12-18 19:39:08,258 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 66 transitions. Word has length 11 [2019-12-18 19:39:08,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:08,258 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 66 transitions. [2019-12-18 19:39:08,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 19:39:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 66 transitions. [2019-12-18 19:39:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 19:39:08,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:08,259 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:08,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:08,463 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:08,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:08,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1886502219, now seen corresponding path program 7 times [2019-12-18 19:39:08,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:08,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837974836] [2019-12-18 19:39:08,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:08,538 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 19:39:08,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837974836] [2019-12-18 19:39:08,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582244968] [2019-12-18 19:39:08,539 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 19:39:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:08,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:39:08,588 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:08,615 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 19:39:08,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:08,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-18 19:39:08,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724327814] [2019-12-18 19:39:08,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:39:08,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:08,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:39:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:39:08,617 INFO L87 Difference]: Start difference. First operand 32 states and 66 transitions. Second operand 9 states. [2019-12-18 19:39:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:08,704 INFO L93 Difference]: Finished difference Result 36 states and 74 transitions. [2019-12-18 19:39:08,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 19:39:08,704 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-18 19:39:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:08,705 INFO L225 Difference]: With dead ends: 36 [2019-12-18 19:39:08,705 INFO L226 Difference]: Without dead ends: 33 [2019-12-18 19:39:08,705 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 19:39:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-18 19:39:08,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2019-12-18 19:39:08,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-18 19:39:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 50 transitions. [2019-12-18 19:39:08,709 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 50 transitions. Word has length 12 [2019-12-18 19:39:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:08,709 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 50 transitions. [2019-12-18 19:39:08,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:39:08,709 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 50 transitions. [2019-12-18 19:39:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-18 19:39:08,710 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:08,710 INFO L411 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:08,914 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:08,915 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:08,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:08,915 INFO L82 PathProgramCache]: Analyzing trace with hash -466461505, now seen corresponding path program 8 times [2019-12-18 19:39:08,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:08,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213936685] [2019-12-18 19:39:08,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:08,972 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 19:39:08,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213936685] [2019-12-18 19:39:08,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246276501] [2019-12-18 19:39:08,973 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 19:39:09,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:39:09,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:09,023 INFO L264 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-18 19:39:09,024 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:09,036 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 19:39:09,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:09,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-12-18 19:39:09,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612042396] [2019-12-18 19:39:09,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 19:39:09,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:09,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 19:39:09,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-18 19:39:09,039 INFO L87 Difference]: Start difference. First operand 24 states and 50 transitions. Second operand 9 states. [2019-12-18 19:39:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:09,144 INFO L93 Difference]: Finished difference Result 37 states and 76 transitions. [2019-12-18 19:39:09,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 19:39:09,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-18 19:39:09,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:09,146 INFO L225 Difference]: With dead ends: 37 [2019-12-18 19:39:09,146 INFO L226 Difference]: Without dead ends: 34 [2019-12-18 19:39:09,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-12-18 19:39:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-12-18 19:39:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-12-18 19:39:09,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-18 19:39:09,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 70 transitions. [2019-12-18 19:39:09,152 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 70 transitions. Word has length 12 [2019-12-18 19:39:09,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:09,153 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 70 transitions. [2019-12-18 19:39:09,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 19:39:09,153 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 70 transitions. [2019-12-18 19:39:09,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:39:09,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:09,153 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:09,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:09,357 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:09,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:09,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1647973050, now seen corresponding path program 9 times [2019-12-18 19:39:09,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:09,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700172043] [2019-12-18 19:39:09,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:09,435 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 19:39:09,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700172043] [2019-12-18 19:39:09,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327629823] [2019-12-18 19:39:09,436 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 19:39:09,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-12-18 19:39:09,489 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:09,490 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:39:09,491 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:09,511 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 19:39:09,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:09,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-18 19:39:09,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219371627] [2019-12-18 19:39:09,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:39:09,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:09,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:39:09,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:39:09,513 INFO L87 Difference]: Start difference. First operand 34 states and 70 transitions. Second operand 10 states. [2019-12-18 19:39:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:09,640 INFO L93 Difference]: Finished difference Result 38 states and 78 transitions. [2019-12-18 19:39:09,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:39:09,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-18 19:39:09,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:09,642 INFO L225 Difference]: With dead ends: 38 [2019-12-18 19:39:09,642 INFO L226 Difference]: Without dead ends: 35 [2019-12-18 19:39:09,643 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 19:39:09,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-18 19:39:09,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2019-12-18 19:39:09,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-18 19:39:09,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 52 transitions. [2019-12-18 19:39:09,646 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 52 transitions. Word has length 13 [2019-12-18 19:39:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:09,646 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 52 transitions. [2019-12-18 19:39:09,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:39:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 52 transitions. [2019-12-18 19:39:09,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 19:39:09,647 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:09,647 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:09,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:09,852 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:09,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1575404710, now seen corresponding path program 10 times [2019-12-18 19:39:09,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:09,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697956801] [2019-12-18 19:39:09,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:09,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:09,949 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 19:39:09,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697956801] [2019-12-18 19:39:09,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267510087] [2019-12-18 19:39:09,950 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 19:39:10,012 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:39:10,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:10,013 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-18 19:39:10,023 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:10,060 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 19:39:10,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:10,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-18 19:39:10,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426168433] [2019-12-18 19:39:10,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 19:39:10,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:10,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 19:39:10,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 19:39:10,064 INFO L87 Difference]: Start difference. First operand 25 states and 52 transitions. Second operand 10 states. [2019-12-18 19:39:10,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:10,193 INFO L93 Difference]: Finished difference Result 39 states and 80 transitions. [2019-12-18 19:39:10,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:39:10,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-12-18 19:39:10,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:10,194 INFO L225 Difference]: With dead ends: 39 [2019-12-18 19:39:10,194 INFO L226 Difference]: Without dead ends: 36 [2019-12-18 19:39:10,194 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 19:39:10,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-18 19:39:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-18 19:39:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-18 19:39:10,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 74 transitions. [2019-12-18 19:39:10,200 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 74 transitions. Word has length 13 [2019-12-18 19:39:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:10,201 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 74 transitions. [2019-12-18 19:39:10,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 19:39:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 74 transitions. [2019-12-18 19:39:10,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 19:39:10,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:10,202 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:10,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:10,410 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:10,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:10,411 INFO L82 PathProgramCache]: Analyzing trace with hash 452443059, now seen corresponding path program 11 times [2019-12-18 19:39:10,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:10,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005297040] [2019-12-18 19:39:10,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:10,507 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 19:39:10,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005297040] [2019-12-18 19:39:10,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511958009] [2019-12-18 19:39:10,508 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 19:39:10,559 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-12-18 19:39:10,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:10,560 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-18 19:39:10,562 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:10,582 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 19:39:10,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:10,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-18 19:39:10,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874395892] [2019-12-18 19:39:10,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:39:10,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:10,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:39:10,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:39:10,584 INFO L87 Difference]: Start difference. First operand 36 states and 74 transitions. Second operand 11 states. [2019-12-18 19:39:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:10,744 INFO L93 Difference]: Finished difference Result 40 states and 82 transitions. [2019-12-18 19:39:10,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 19:39:10,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-18 19:39:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:10,745 INFO L225 Difference]: With dead ends: 40 [2019-12-18 19:39:10,746 INFO L226 Difference]: Without dead ends: 37 [2019-12-18 19:39:10,746 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 19:39:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-18 19:39:10,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-12-18 19:39:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-18 19:39:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 54 transitions. [2019-12-18 19:39:10,750 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 54 transitions. Word has length 14 [2019-12-18 19:39:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:10,750 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 54 transitions. [2019-12-18 19:39:10,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:39:10,750 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 54 transitions. [2019-12-18 19:39:10,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 19:39:10,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:10,751 INFO L411 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:10,958 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:10,958 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:10,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:10,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1592905449, now seen corresponding path program 12 times [2019-12-18 19:39:10,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:10,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555740562] [2019-12-18 19:39:10,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:11,045 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 19:39:11,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555740562] [2019-12-18 19:39:11,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197711758] [2019-12-18 19:39:11,046 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 19:39:11,109 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-12-18 19:39:11,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:11,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-18 19:39:11,111 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:11,126 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 19:39:11,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:11,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-12-18 19:39:11,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429985656] [2019-12-18 19:39:11,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 19:39:11,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:11,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 19:39:11,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-12-18 19:39:11,128 INFO L87 Difference]: Start difference. First operand 26 states and 54 transitions. Second operand 11 states. [2019-12-18 19:39:11,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:11,294 INFO L93 Difference]: Finished difference Result 41 states and 84 transitions. [2019-12-18 19:39:11,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 19:39:11,295 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-18 19:39:11,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:11,296 INFO L225 Difference]: With dead ends: 41 [2019-12-18 19:39:11,296 INFO L226 Difference]: Without dead ends: 38 [2019-12-18 19:39:11,296 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 19:39:11,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-18 19:39:11,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-12-18 19:39:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-18 19:39:11,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 78 transitions. [2019-12-18 19:39:11,300 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 78 transitions. Word has length 14 [2019-12-18 19:39:11,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:11,300 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 78 transitions. [2019-12-18 19:39:11,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 19:39:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 78 transitions. [2019-12-18 19:39:11,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:39:11,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:11,301 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:11,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:11,508 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:11,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:11,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1140833246, now seen corresponding path program 13 times [2019-12-18 19:39:11,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:11,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787415296] [2019-12-18 19:39:11,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:11,607 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 19:39:11,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787415296] [2019-12-18 19:39:11,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736659043] [2019-12-18 19:39:11,608 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 19:39:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:11,654 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:39:11,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:11,676 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 19:39:11,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:11,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-18 19:39:11,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768829662] [2019-12-18 19:39:11,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:39:11,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:11,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:39:11,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:39:11,678 INFO L87 Difference]: Start difference. First operand 38 states and 78 transitions. Second operand 12 states. [2019-12-18 19:39:11,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:11,860 INFO L93 Difference]: Finished difference Result 42 states and 86 transitions. [2019-12-18 19:39:11,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:39:11,861 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-18 19:39:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:11,861 INFO L225 Difference]: With dead ends: 42 [2019-12-18 19:39:11,861 INFO L226 Difference]: Without dead ends: 39 [2019-12-18 19:39:11,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:39:11,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-18 19:39:11,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-12-18 19:39:11,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-12-18 19:39:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2019-12-18 19:39:11,868 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 56 transitions. Word has length 15 [2019-12-18 19:39:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:11,868 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 56 transitions. [2019-12-18 19:39:11,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:39:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 56 transitions. [2019-12-18 19:39:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 19:39:11,871 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:11,871 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:12,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:12,072 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:12,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:12,073 INFO L82 PathProgramCache]: Analyzing trace with hash -2135428606, now seen corresponding path program 14 times [2019-12-18 19:39:12,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:12,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796923234] [2019-12-18 19:39:12,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:12,323 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 19:39:12,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796923234] [2019-12-18 19:39:12,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840389868] [2019-12-18 19:39:12,324 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 19:39:12,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-18 19:39:12,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:12,408 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-18 19:39:12,409 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:12,455 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 19:39:12,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:12,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-12-18 19:39:12,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522090119] [2019-12-18 19:39:12,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 19:39:12,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 19:39:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 19:39:12,458 INFO L87 Difference]: Start difference. First operand 27 states and 56 transitions. Second operand 12 states. [2019-12-18 19:39:12,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:12,661 INFO L93 Difference]: Finished difference Result 43 states and 88 transitions. [2019-12-18 19:39:12,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:39:12,662 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-12-18 19:39:12,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:12,663 INFO L225 Difference]: With dead ends: 43 [2019-12-18 19:39:12,663 INFO L226 Difference]: Without dead ends: 40 [2019-12-18 19:39:12,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-12-18 19:39:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-18 19:39:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-18 19:39:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-18 19:39:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 82 transitions. [2019-12-18 19:39:12,668 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 82 transitions. Word has length 15 [2019-12-18 19:39:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:12,668 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 82 transitions. [2019-12-18 19:39:12,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 19:39:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 82 transitions. [2019-12-18 19:39:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 19:39:12,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:12,669 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:12,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:12,873 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:12,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:12,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1006092315, now seen corresponding path program 15 times [2019-12-18 19:39:12,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:12,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890615319] [2019-12-18 19:39:12,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:12,984 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 19:39:12,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890615319] [2019-12-18 19:39:12,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151769300] [2019-12-18 19:39:12,985 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 19:39:13,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-12-18 19:39:13,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:13,051 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-18 19:39:13,052 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:13,071 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 19:39:13,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:13,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-18 19:39:13,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228300645] [2019-12-18 19:39:13,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:39:13,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:13,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:39:13,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:39:13,073 INFO L87 Difference]: Start difference. First operand 40 states and 82 transitions. Second operand 13 states. [2019-12-18 19:39:13,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:13,261 INFO L93 Difference]: Finished difference Result 44 states and 90 transitions. [2019-12-18 19:39:13,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 19:39:13,261 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-18 19:39:13,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:13,262 INFO L225 Difference]: With dead ends: 44 [2019-12-18 19:39:13,262 INFO L226 Difference]: Without dead ends: 41 [2019-12-18 19:39:13,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-12-18 19:39:13,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-18 19:39:13,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 28. [2019-12-18 19:39:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-18 19:39:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 58 transitions. [2019-12-18 19:39:13,267 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 58 transitions. Word has length 16 [2019-12-18 19:39:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:13,267 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 58 transitions. [2019-12-18 19:39:13,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:39:13,268 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 58 transitions. [2019-12-18 19:39:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 19:39:13,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:13,268 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:13,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:13,473 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:13,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:13,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1773777041, now seen corresponding path program 16 times [2019-12-18 19:39:13,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:13,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648937175] [2019-12-18 19:39:13,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 19:39:13,554 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 19:39:13,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648937175] [2019-12-18 19:39:13,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434061239] [2019-12-18 19:39:13,555 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 19:39:13,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-18 19:39:13,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-18 19:39:13,624 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-18 19:39:13,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-18 19:39:13,658 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 19:39:13,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-18 19:39:13,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-18 19:39:13,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574949543] [2019-12-18 19:39:13,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 19:39:13,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 19:39:13,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 19:39:13,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-18 19:39:13,660 INFO L87 Difference]: Start difference. First operand 28 states and 58 transitions. Second operand 13 states. [2019-12-18 19:39:13,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 19:39:13,856 INFO L93 Difference]: Finished difference Result 45 states and 92 transitions. [2019-12-18 19:39:13,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 19:39:13,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2019-12-18 19:39:13,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 19:39:13,857 INFO L225 Difference]: With dead ends: 45 [2019-12-18 19:39:13,857 INFO L226 Difference]: Without dead ends: 42 [2019-12-18 19:39:13,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2019-12-18 19:39:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-12-18 19:39:13,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-12-18 19:39:13,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-18 19:39:13,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 86 transitions. [2019-12-18 19:39:13,861 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 86 transitions. Word has length 16 [2019-12-18 19:39:13,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 19:39:13,861 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 86 transitions. [2019-12-18 19:39:13,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 19:39:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 86 transitions. [2019-12-18 19:39:13,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 19:39:13,865 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 19:39:13,865 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 19:39:14,068 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-18 19:39:14,068 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 19:39:14,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 19:39:14,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1124090998, now seen corresponding path program 17 times [2019-12-18 19:39:14,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 19:39:14,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477758] [2019-12-18 19:39:14,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 19:39:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:39:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 19:39:14,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 19:39:14,112 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 19:39:14,116 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_~j~0_16 6) (= 0 |v_ULTIMATE.start_main_~#id2~0.offset_16|) (< 0 |v_#StackHeapBarrier_11|) (= v_~i~0_16 3) (= 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_#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_16, ULTIMATE.start_main_#t~nondet4=|v_ULTIMATE.start_main_#t~nondet4_7|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_10|, 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_14, 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_14, ~i~0=v_~i~0_16, #NULL.base=|v_#NULL.base_4|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_12|, #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 19:39:14,116 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 19:39:14,117 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_10 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_10, 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 19:39:14,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 5) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 19:39:14,117 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_10) (= |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_10, 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 19:39:14,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 5) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 19:39:14,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 5) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 19:39:14,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 5) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 19:39:14,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 5) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 19:39:14,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 5) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 19:39:14,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 5) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 19:39:14,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 5) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 19:39:14,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [177] [177] L677-6-->L677-6: Formula: (and (= v_t1Thread1of1ForFork1_~k~0_13 (+ v_t1Thread1of1ForFork1_~k~0_14 1)) (< v_t1Thread1of1ForFork1_~k~0_14 5) (= v_~i~0_10 (+ v_~j~0_10 1))) InVars {~j~0=v_~j~0_10, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_14} OutVars{~j~0=v_~j~0_10, ~i~0=v_~i~0_10, t1Thread1of1ForFork1_#t~post2=|v_t1Thread1of1ForFork1_#t~post2_9|, t1Thread1of1ForFork1_~k~0=v_t1Thread1of1ForFork1_~k~0_13} AuxVars[] AssignedVars[~i~0, t1Thread1of1ForFork1_#t~post2, t1Thread1of1ForFork1_~k~0] because there is no mapped edge [2019-12-18 19:39:14,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [185] [185] L685-6-->L685-6: Formula: (and (< v_t2Thread1of1ForFork0_~k~1_16 5) (= (+ v_t2Thread1of1ForFork0_~k~1_16 1) v_t2Thread1of1ForFork0_~k~1_15) (= v_~j~0_14 (+ v_~i~0_14 1))) InVars {~i~0=v_~i~0_14, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_16} OutVars{~j~0=v_~j~0_14, ~i~0=v_~i~0_14, t2Thread1of1ForFork0_#t~post3=|v_t2Thread1of1ForFork0_#t~post3_8|, t2Thread1of1ForFork0_~k~1=v_t2Thread1of1ForFork0_~k~1_15} AuxVars[] AssignedVars[~j~0, t2Thread1of1ForFork0_#t~post3, t2Thread1of1ForFork0_~k~1] because there is no mapped edge [2019-12-18 19:39:14,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [181] [181] L695-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse1 (= v_ULTIMATE.start_main_~condJ~0_11 0)) (.cse2 (= v_ULTIMATE.start_main_~condI~0_11 0))) (and (let ((.cse0 (<= 16 v_~j~0_12))) (or (and .cse0 (= v_ULTIMATE.start_main_~condJ~0_11 1)) (and .cse1 (not .cse0)))) (or (not .cse1) (not .cse2)) (let ((.cse3 (<= 16 v_~i~0_12))) (or (and .cse3 (= v_ULTIMATE.start_main_~condI~0_11 1)) (and (not .cse3) .cse2))))) InVars {~j~0=v_~j~0_12, ~i~0=v_~i~0_12} OutVars{~j~0=v_~j~0_12, ULTIMATE.start_main_~condJ~0=v_ULTIMATE.start_main_~condJ~0_11, ULTIMATE.start_main_~condI~0=v_ULTIMATE.start_main_~condI~0_11, ~i~0=v_~i~0_12, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_7|} 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 19:39:14,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 07:39:14 BasicIcfg [2019-12-18 19:39:14,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 19:39:14,135 INFO L168 Benchmark]: Toolchain (without parser) took 10978.14 ms. Allocated memory was 145.8 MB in the beginning and 294.6 MB in the end (delta: 148.9 MB). Free memory was 100.7 MB in the beginning and 144.5 MB in the end (delta: -43.8 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. [2019-12-18 19:39:14,135 INFO L168 Benchmark]: CDTParser took 1.49 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 19:39:14,136 INFO L168 Benchmark]: CACSL2BoogieTranslator took 751.67 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 100.5 MB in the beginning and 161.2 MB in the end (delta: -60.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-18 19:39:14,136 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.47 ms. Allocated memory is still 202.4 MB. Free memory was 161.2 MB in the beginning and 159.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-18 19:39:14,137 INFO L168 Benchmark]: Boogie Preprocessor took 31.07 ms. Allocated memory is still 202.4 MB. Free memory was 159.3 MB in the beginning and 158.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:39:14,137 INFO L168 Benchmark]: RCFGBuilder took 369.83 ms. Allocated memory is still 202.4 MB. Free memory was 157.4 MB in the beginning and 138.1 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. [2019-12-18 19:39:14,138 INFO L168 Benchmark]: TraceAbstraction took 9777.47 ms. Allocated memory was 202.4 MB in the beginning and 294.6 MB in the end (delta: 92.3 MB). Free memory was 138.1 MB in the beginning and 144.5 MB in the end (delta: -6.4 MB). Peak memory consumption was 85.8 MB. Max. memory is 7.1 GB. [2019-12-18 19:39:14,140 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 751.67 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 100.5 MB in the beginning and 161.2 MB in the end (delta: -60.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.47 ms. Allocated memory is still 202.4 MB. Free memory was 161.2 MB in the beginning and 159.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.07 ms. Allocated memory is still 202.4 MB. Free memory was 159.3 MB in the beginning and 158.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 369.83 ms. Allocated memory is still 202.4 MB. Free memory was 157.4 MB in the beginning and 138.1 MB in the end (delta: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9777.47 ms. Allocated memory was 202.4 MB in the beginning and 294.6 MB in the end (delta: 92.3 MB). Free memory was 138.1 MB in the beginning and 144.5 MB in the end (delta: -6.4 MB). Peak memory consumption was 85.8 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, 0 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: 9.6s, OverallIterations: 19, TraceHistogramMax: 5, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 192 SDtfs, 518 SDslu, 319 SDs, 0 SdLazy, 389 SolverSat, 331 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 76 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 53 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 14804 SizeOfPredicates, 70 NumberOfNonLiveVariables, 1316 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 0/200 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...